RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 2015, Volume 51, Issue 4, Pages 32–46 (Mi ppi2185)  

This article is cited in 1 scientific paper (total in 1 paper)

Methods of Signal Processing

Estimation of matrices with row sparsity

O. Kloppa, A. B. Tsybakovb

a CREST and MODAL'X, University Paris Ouest, Nanterre, France
b UMR CNRS 9194, ENSAE, Malakoff, France

Abstract: An increasing number of applications is concerned with recovering a sparse matrix from noisy observations. In this paper, we consider the setting where each row of an unknown matrix is sparse. We establish minimax optimal rates of convergence for estimating matrices with row sparsity. A major focus in the present paper is on the derivation of lower bounds.

Funding Agency Grant Number
Labex ANR11-LBX-0023-01
Agence Nationale de la Recherche ANR-13-BSH1-0004-02
ANR-11-LABEX-0047
Conducted as a part of the project Labex MME-DII, grant no. ANR11-LBX-0023-01.
Supported by the French National Research Agency (ANR), grant nos. ANR-13-BSH1-0004-02 and ANR-11-LABEX-0047, and by GENES. Also supported by the “Chaire Economie et Gestion des Nouvelles Données”, under the auspices of Institut Louis Bachelier, Havas Media, and Paris-Dauphine.


Full text: PDF file (260 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2015, 51:4, 335–348

Bibliographic databases:

UDC: 621.391.1+519.2
Received: 15.03.2015
Revised: 08.09.2015

Citation: O. Klopp, A. B. Tsybakov, “Estimation of matrices with row sparsity”, Probl. Peredachi Inf., 51:4 (2015), 32–46; Problems Inform. Transmission, 51:4 (2015), 335–348

Citation in format AMSBIB
\Bibitem{KloTsy15}
\by O.~Klopp, A.~B.~Tsybakov
\paper Estimation of matrices with row sparsity
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 4
\pages 32--46
\mathnet{http://mi.mathnet.ru/ppi2185}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 4
\pages 335--348
\crossref{https://doi.org/10.1134/S0032946015040031}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000367604200003}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84952939495}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2185
  • http://mi.mathnet.ru/eng/ppi/v51/i4/p32

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Z. Shaeiri, M.-R. Karami, A. Aghagolzadeh, “Enhancing the sufficient condition of sparsity pattern recovery”, Digit. Signal Prog., 81 (2018), 43–49  crossref  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:200
    Full text:26
    References:52
    First page:42

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020