Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:1704.00835

Help | Advanced Search

Mathematics > Statistics Theory

arXiv:1704.00835 (math)
[Submitted on 3 Apr 2017 (v1) , last revised 17 Mar 2019 (this version, v5)]

Title: Near-Optimality of Linear Recovery from Indirect Observations

Title: 从间接观测中进行线性恢复的近似最优性

Authors:Anatoli Juditsky, Arkadi Nemirovski
Abstract: We consider the problem of recovering linear image $Bx$ of a signal $x$ known to belong to a given convex compact set ${\cal X}$ from indirect observation $\omega=Ax+\xi$ of $x$ corrupted by random noise $\xi$ with finite covariance matrix. It is shown that under some assumptions on ${\cal X}$ (satisfied, e.g., when ${\cal X}$ is the intersection of $K$ concentric ellipsoids/elliptic cylinders, or the unit ball of the spectral norm in the space of matrices) and on the norm $\|\cdot\|$ used to measure the recovery error (satisfied, e.g., by $\|\cdot\|_p$-norms, $1\leq p\leq 2$, on ${\mathbf{R}}^m$ and by the nuclear norm on the space of matrices), one can build, in a computationally efficient manner, a "presumably good" linear in observations estimate, and that in the case of zero mean Gaussian observation noise, this estimate is near-optimal among all (linear and nonlinear) estimates in terms of its worst-case, over $x\in {\cal X}$, expected $\|\cdot\|$-loss. These results form an essential extension of those in our paper arXiv:1602.01355, where the assumptions on ${\cal X}$ were more restrictive, and the norm $\|\cdot\|$ was assumed to be the Euclidean one. In addition, we develop near-optimal estimates for the case of "uncertain-but-bounded" noise, where all we know about $\xi$ is that it is bounded in a given norm by a given $\sigma$. Same as in arXiv:1602.01355, our results impose no restrictions on $A$ and $B$. This arXiv paper slightly strengthens the journal publication Juditsky, A., Nemirovski, A. "Near-Optimality of Linear Recovery from Indirect Observations," Mathematical Statistics and Learning 1:2 (2018), 171-225.
Abstract: We consider the problem of recovering linear image $Bx$ of a signal $x$ known to belong to a given convex compact set ${\cal X}$ from indirect observation $\omega=Ax+\xi$ of $x$ corrupted by random noise $\xi$ with finite covariance matrix. 结果表明,在关于${\cal X}$的一些假设下(例如,当${\cal X}$是$K$个同心椭球/椭圆柱的交集时满足此条件,或者在矩阵空间中为谱范数下的单位球时也满足),以及关于用于测量恢复误差的范数$\|\cdot\|$(例如,由$\|\cdot\|_p$-范数,$1\leq p\leq 2$在${\mathbf{R}}^m$上,以及矩阵空间中的核范数满足),可以以计算高效的方式构建一个“可能良好”的观测线性估计,并且在零均值高斯观测噪声的情况下,这种估计在$x\in {\cal X}$上相对于所有(线性和非线性)估计的最坏情况下的$\|\cdot\|$-损失期望来说是接近最优的。 这些结果是对我们发表在arXiv:1602.01355上的论文中的结果的重要扩展,在那篇论文中,关于${\cal X}$的假设更加严格,并且假定$\|\cdot\|$的范数为欧几里得范数。 此外,我们针对“不确定但有界”的噪声情况发展了接近最优的估计方法,在这种情况下,我们对于$\xi$所知的只是它在一个给定范数下由$\sigma$给出的界限内。 与arXiv:1602.01355相同,我们的结果对$A$和$B$没有任何限制。 这篇arXiv论文略微加强了期刊出版物Juditsky, A., Nemirovski, A.的成果: “从间接观测中进行线性恢复的近似最优性”, 《数学统计与学习》1:2(2018),171-225。
Subjects: Statistics Theory (math.ST)
MSC classes: 62F10, 62F30
Cite as: arXiv:1704.00835 [math.ST]
  (or arXiv:1704.00835v5 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.1704.00835
arXiv-issued DOI via DataCite

Submission history

From: Arkadi Nemirovski [view email]
[v1] Mon, 3 Apr 2017 23:55:18 UTC (36 KB)
[v2] Mon, 17 Apr 2017 14:42:45 UTC (35 KB)
[v3] Sun, 30 Apr 2017 02:29:24 UTC (38 KB)
[v4] Thu, 15 Jun 2017 14:25:52 UTC (38 KB)
[v5] Sun, 17 Mar 2019 12:33:25 UTC (126 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.ST
< prev   |   next >
new | recent | 2017-04
Change to browse by:
math
stat
stat.TH

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号