Adapting to unknown noise level in sparse deconvolution
From MaRDI portal
Publication:4603711
DOI10.1093/imaiai/iaw024zbMath1383.62186arXiv1606.04760OpenAlexW2962682711MaRDI QIDQ4603711
Claire Boyer, Yohann de Castro, Joseph Salmon
Publication date: 19 February 2018
Published in: Information and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.04760
model selectioninverse problemsdeconvolutionsparsityconvex regularizationRice methodsquare-root Lassoconcomitant Beurling Lassoscaled-Lasso
Ridge regression; shrinkage estimators (Lasso) (62J07) Point estimation (62F10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Sampling the Fourier Transform Along Radial Lines ⋮ The MLE is a reliable source: sharp performance guarantees for localization problems ⋮ Prediction bounds for higher order total variation regularized least squares ⋮ The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
Uses Software
Cites Work
- Unnamed Item
- Estimation and testing under sparsity. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Robust recovery of stream of pulses using convex optimization
- Exact reconstruction using Beurling minimal extrapolation
- Super-resolution from noisy data
- \(L_1\)-penalization in functional linear regression with subgaussian design
- On the prediction performance of the Lasso
- \(\ell_{1}\)-penalization for mixture regression models
- Comments on: \(\ell_{1}\)-penalization for mixture regression models
- Near-ideal model selection by \(\ell _{1}\) minimization
- Exact support recovery for sparse spikes deconvolution
- Adaptive estimation of a quadratic functional by model selection.
- Non-uniform spline recovery from small degree polynomial approximation
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials
- Spike detection from inaccurate samplings
- Near Minimax Line Spectral Estimation
- Graph Implementations for Nonsmooth Convex Programs
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Scaled sparse linear regression
- A study of error variance estimation in Lasso regression
- Level Sets and Extrema of Random Processes and Fields
- Atomic Decomposition by Basis Pursuit
- Super-Resolution on the Sphere Using Convex Optimization
- Super-resolution of point sources via convex programming
- Inverse problems in spaces of measures
- Robust Regression and Lasso
- Compressed Sensing Off the Grid
- Towards a Mathematical Theory of Super‐resolution
- Prediction and Discovery
- Convex analysis and monotone operator theory in Hilbert spaces
- Robust Statistics
- Positive trigonometric polynomials and signal processing applications
