English
Related papers

Related papers: The L1-Potts functional for robust jump-sparse rec…

200 papers

In the blind deconvolution problem, we observe the convolution of an unknown filter and unknown signal and attempt to reconstruct the filter and signal. The problem seems impossible in general, since there are seemingly many more unknowns…

Information Theory · Computer Science 2021-06-15 Qingyun Sun , David Donoho

We study the question of reconstructing two signals $f$ and $g$ from their convolution $y = f\ast g$. This problem, known as {\em blind deconvolution}, pervades many areas of science and technology, including astronomy, medical imaging,…

Information Theory · Computer Science 2016-06-16 Xiaodong Li , Shuyang Ling , Thomas Strohmer , Ke Wei

Sparse reconstruction approaches using the re-weighted l1-penalty have been shown, both empirically and theoretically, to provide a significant improvement in recovering sparse signals in comparison to the l1-relaxation. However, numerical…

Machine Learning · Statistics 2013-12-06 Dmitry Malioutov , Aleksandr Aravkin

In this paper, we consider a squared $L_1/L_2$ regularized model for sparse signal recovery from noisy measurements. We first establish the existence of optimal solutions to the model under mild conditions. Next, we propose a proximal…

Optimization and Control · Mathematics 2025-11-10 Na Zhang , Hong Chen , Qia Li , Junpeng Zhou

Reconstruction fidelity of sparse signals contaminated by sparse noise is considered. Statistical mechanics inspired tools are used to show that the l1-norm based convex optimization algorithm exhibits a phase transition between the…

Information Theory · Computer Science 2013-09-17 Mikko Vehkapera , Yoshiyuki Kabashima , Saikat Chatterjee

We investigate implicit regularization schemes for gradient descent methods applied to unpenalized least squares regression to solve the problem of reconstructing a sparse signal from an underdetermined system of linear measurements under…

Machine Learning · Statistics 2019-09-12 Tomas Vaškevičius , Varun Kanade , Patrick Rebeschini

We introduce an algorithm for the deconvolution of radio synthesis images that accounts for the non-coplanar-baseline effect, allows multiscale reconstruction onto arbitrarily positioned pixel grids, and allows the antenna elements to have…

Instrumentation and Methods for Astrophysics · Physics 2013-10-09 Stephen J. Hardy

Blind deconvolution is a ubiquitous problem of recovering two unknown signals from their convolution. Unfortunately, this is an ill-posed problem in general. This paper focuses on the {\em short and sparse} blind deconvolution problem,…

Signal Processing · Electrical Eng. & Systems 2019-07-23 Yuqian Zhang , Han-Wen Kuo , John Wright

We study fundamental limits of first-order stochastic optimization in a range of nonconvex settings, including L-smooth functions satisfying Quasar-Convexity (QC), Quadratic Growth (QG), and Restricted Secant Inequalities (RSI). While the…

Machine Learning · Statistics 2025-06-03 El Mehdi Saad , Wei-Cheng Lee , Francesco Orabona

Compressed sensing has shown that it is possible to reconstruct sparse high dimensional signals from few linear measurements. In many cases, the solution can be obtained by solving an L1-minimization problem, and this method is accurate…

Numerical Analysis · Mathematics 2009-04-27 Deanna Needell

We consider the problem of exact reconstruction of univariate functions with jump discontinuities at unknown positions from their moments. These functions are assumed to satisfy an a priori unknown linear homogeneous differential equation…

Classical Analysis and ODEs · Mathematics 2009-09-18 Dmitry Batenkov

The removal of blur from a signal, in the presence of noise, is readily accomplished if the blur can be described in precise mathematical terms. However, there is growing interest in problems where the extent of blur is known only…

Statistics Theory · Mathematics 2007-11-06 Peter Hall , Peihua Qiu

This paper is motivated by structured sparsity for deep neural network training. We study a weighted group L0-norm constraint, and present the projection and normal cone of this set. Using randomized smoothing, we develop zeroth and…

Optimization and Control · Mathematics 2022-12-22 Michael R. Metel

We study the problem of recovering the underlining sparse signals from clean or noisy phaseless measurements. Due to the sparse prior of signals, we adopt an L0regularized variational model to ensure only a small number of nonzero elements…

Optimization and Control · Mathematics 2016-12-09 Yuping Duan , Chunlin Wu , Zhi-Feng Pang , Huibin Chang

We tackle the problem of recovering an unknown signal observed in an ill-posed inverse problem framework. More precisely, we study a procedure commonly used in numerical analysis or image deblurring: minimizing an empirical loss function…

Statistics Theory · Mathematics 2007-09-18 J. M. Loubes

The observations in many applications consist of counts of discrete events, such as photons hitting a dector, which cannot be effectively modeled using an additive bounded or Gaussian noise model, and instead require a Poisson noise model.…

Optimization and Control · Mathematics 2016-11-17 Zachary T. Harmany , Roummel F. Marcia , Rebecca M. Willett

We consider estimation of a step function $f$ from noisy observations of a deconvolution $\phi*f$, where $\phi$ is some bounded $L_1$-function. We use a penalized least squares estimator to reconstruct the signal $f$ from the observations,…

Statistics Theory · Mathematics 2008-12-18 Leif Boysen , Axel Munk

Signals and images with discontinuities appear in many problems in such diverse areas as biology, medicine, mechanics, and electrical engineering. The concrete data are often discrete, indirect and noisy measurements of some quantities…

Numerical Analysis · Mathematics 2021-03-11 Lukas Kiefer , Martin Storath , Andreas Weinmann

We study the asymptotics for jump-penalized least squares regression aiming at approximating a regression function by piecewise constant functions. Besides conventional consistency and convergence rates of the estimates in $L^2([0,1))$ our…

Statistics Theory · Mathematics 2009-03-02 Leif Boysen , Angela Kempe , Volkmar Liebscher , Axel Munk , Olaf Wittich

In this paper, we investigate the theoretical guarantees of penalized $\lun$ minimization (also called Basis Pursuit Denoising or Lasso) in terms of sparsity pattern recovery (support and sign consistency) from noisy measurements with…

Information Theory · Computer Science 2011-09-13 Charles Dossal , Marie-Line Chabanol , Gabriel Peyré , Jalal Fadili