Sharp MSE bounds for proximal denoising (Q330102)

From MaRDI portal

Revision as of 14:33, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Sharp MSE bounds for proximal denoising	scientific article

Statements

scholarly article

0 references

Sharp MSE bounds for proximal denoising (English)

0 references

0 references

0 references

Foundations of Computational Mathematics

0 references

publication date

24 October 2016

0 references

full work available at URL

https://arxiv.org/abs/1305.2714

0 references

https://resolver.caltech.edu/CaltechAUTHORS:20160825-102038882

0 references

zbMATH Keywords

convex optimization

0 references

proximity operator

0 references

structured sparsity

0 references

statistical estimation

0 references

model fitting

0 references

stochastic noise

0 references

linear inverse

0 references

generalized LASSO

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions

0 references

Living on the edge: phase transitions in convex programs with random data

0 references

Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations

0 references

Model-Based Compressive Sensing

0 references

Universality in polytope phase transitions and message passing algorithms

0 references

The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing

0 references

The LASSO Risk for Gaussian Matrices

0 references

Square-root lasso: pivotal recovery of sparse signals via conic programming

0 references

0 references

Atomic Norm Denoising With Applications to Line Spectral Estimation

0 references

Simultaneous analysis of Lasso and Dantzig selector

0 references

On the small balls problem for equivalent Gaussian measures

0 references

0 references

Sparsity oracle inequalities for the Lasso

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Neighborliness of randomly projected simplices in high dimensions

0 references

Simple bounds for recovering low-complexity models

0 references

Robust principal component analysis?

0 references

Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements

0 references

Exact matrix completion via convex optimization

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Enhancing sparsity by reweighted \(\ell _{1}\) minimization

0 references

Computational and statistical tradeoffs via convex relaxation

0 references

The convex geometry of linear inverse problems

0 references

Proximal Splitting Methods in Signal Processing

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising

0 references

Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing

0 references

De-noising by soft-thresholding

0 references

Compressed sensing

0 references

High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension

0 references

Minimax risk of matrix denoising by singular value thresholding

0 references

The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising

0 references

The Noise-Sensitivity Phase Transition in Compressed Sensing

0 references

Block-Sparse Signals: Uncertainty Relations and Efficient Recovery

0 references

Corrupted Sensing: Novel Guarantees for Separating Structured Signals

0 references

0 references

On the Convergence of the Proximal Point Algorithm for Convex Minimization

0 references

0 references

0 references

Sparse Recovery of Nonnegative Signals With Minimal Expansion

0 references

Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion

0 references

0 references

0 references

0 references

Stable Image Reconstruction Using Total Variation Minimization

0 references

A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers

0 references

Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

0 references

Nonlinear total variation based noise removal algorithms

0 references

Reconstruction of a low-rank matrix in the presence of Gaussian noise

0 references

On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements

0 references

0 references

Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support

0 references

Compressive principal component pursuit

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10208-015-9278-4

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:330102

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q330102&oldid=38307611"