# Sharp Time–Data Tradeoffs for Linear Inverse Problems

@article{Oymak2018SharpTT,
title={Sharp Time–Data Tradeoffs for Linear Inverse Problems},
author={Samet Oymak and Benjamin Recht and Mahdi Soltanolkotabi},
journal={IEEE Transactions on Information Theory},
year={2018},
volume={64},
pages={4129-4158}
}
• Published 16 July 2015
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
In this paper, we characterize sharp time–data tradeoffs for optimization problems used for solving linear inverse problems. We focus on the minimization of a least-squares objective subject to a constraint defined as the sub-level set of a penalty function. We present a unified convergence analysis of the gradient projection algorithm applied to such problems. We sharply characterize the convergence rate associated with a wide variety of random measurement ensembles in terms of the number of…
79 Citations

## Figures from this paper

Gradient descent with nonconvex constraints: local concavity determines convergence
• Computer Science
• 2017
This paper develops the notion of local concavity coefficients of the constraint set, measuring the extent to which convexity is violated, which govern the behavior of projected gradient descent over this set and provides a convergence analysis when projections are calculated only approximately.
• Mathematics, Computer Science
ArXiv
• 2021
It is demonstrated that, in the absence of the strong convexity assumption, the proximal-gradient homotopy update can achieve a linear rate of convergence when the number of measurements is sufficiently large.
Structure-Adaptive, Variance-Reduced, and Accelerated Stochastic Optimization
• Computer Science
• 2017
This work proposes an adaptive variant of the two-stage APCG method which does not need to foreknow the restricted strong convexity beforehand, but estimate it on the fly, and enjoys a local accelerated linear convergence rate with respect to the low-dimensional structure of the solution.
Tradeoffs Between Convergence Speed and Reconstruction Accuracy in Inverse Problems
• Computer Science
IEEE Transactions on Signal Processing
• 2018
It is shown that using a coarse estimate of this set may lead to faster convergence at the cost of an additional reconstruction error related to the accuracy of the set approximation, which may provide a possible explanation to the successful approximation of the $\ell _1$ -minimization solution by neural networks with layers representing iterations.
Alternating minimization and alternating descent over nonconvex sets
• Computer Science
• 2017
This work analyzes the performance of alternating minimization for loss functions optimized over two variables, where each variable may be restricted to lie in some potentially nonconvex constraint set and relies on the notion of local concavity coefficients, which has been proposed in Barber and Ha to measure and quantify the Concavity of a general nonconcex set.
Inexact Gradient Projection and Fast Data Driven Compressed Sensing
• Computer Science
IEEE Transactions on Information Theory
• 2018
This work considers different notions of approximation and shows that the progressive fixed precision and the $(1+ \varepsilon)$ -optimal oracles can achieve the same accuracy as for the exact IPG algorithm under the same embedding assumption.
Generalized Line Spectral Estimation via Convex Optimization
• Computer Science
IEEE Transactions on Information Theory
• 2018
It is proved that the frequencies and amplitudes of the components of the mixture can be recovered perfectly from a near-minimal number of observations via this convex program, provided the frequencies are sufficiently separated, and the linear measurements obey natural conditions that are satisfied in a variety of applications.
Fast and Reliable Parameter Estimation from Nonlinear Observations
• Mathematics, Computer Science
SIAM J. Optim.
• 2017
A framework for characterizing time-data tradeoffs for a variety of parameter estimation algorithms when the nonlinear function f is unknown is developed and it is shown that a projected gradient descent scheme converges at a linear rate to a reliable solution with a near minimal number of samples.
Constrained Optimization Involving Nonconvex 𝓁p Norms: Optimality Conditions, Algorithm and Convergence
• Mathematics
ArXiv
• 2021
The optimality conditions for characterizing the local minimizers of the constrained optimization problems involving an `p norm (0 < p < 1) of the variables, which may appear in either the objective or the constraint, are investigated.
A simple homotopy proximal mapping algorithm for compressive sensing
• Computer Science
Machine Learning
• 2018
It is proved that when the measurement matrix satisfies restricted isometric properties (RIP), one of the proposed algorithms with an appropriate setting of a parameter based on the RIP constants converges linearly to the optimal solution up to the noise level.

## References

SHOWING 1-10 OF 120 REFERENCES
Fast global convergence rates of gradient methods for high-dimensional statistical recovery
• Computer Science
NIPS
• 2010
The theory guarantees that Nesterov's first-order method has a globally geometric rate of convergence up to the statistical precision of the model, meaning the typical Euclidean distance between the true unknown parameter θ* and the optimal solution ^θ.
Simple Bounds for Noisy Linear Inverse Problems with Exact Side Information
• Mathematics
ArXiv
• 2013
It is shown that, if precise information about the value f(x_0) or the l_2-norm of the noise is available, one can do a particularly good job at estimation, and the reconstruction error becomes proportional to the “sparsity” of the signal rather than to the ambient dimension of the Noise vector.
Null space conditions and thresholds for rank minimization
• Computer Science
Math. Program.
• 2011
This paper characterize properties of the null space of the linear operator defining the constraint set that are necessary and sufficient for the heuristic to succeed, and obtains dimension-free bounds under which these null space properties hold almost surely as the matrix dimensions tend to infinity.
A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem
• Computer Science, Mathematics
SIAM J. Optim.
• 2013
This paper shows that under suitable assumptions for sparse recovery, the proposed homotopy strategy ensures that all iterates along thehomotopy sol...
The Convex Geometry of Linear Inverse Problems
• Computer Science
Found. Comput. Math.
• 2012
This paper provides a general framework to convert notions of simplicity into convex penalty functions, resulting in convex optimization solutions to linear, underdetermined inverse problems.
Decomposable norm minimization with proximal-gradient homotopy algorithm
• Mathematics, Computer Science
Comput. Optim. Appl.
• 2017
It is shown that if the linear sampling matrix satisfies certain assumptions and the regularizing norm is decomposable, proximal-gradient homotopy algorithm converges with a linear rate even though the objective function is not strongly convex.
Gradient methods for minimizing composite objective function
In this paper we analyze several new methods for solving optimization problems with the objective function formed as a sum of two convex terms: one is smooth and given by a black-box oracle, and
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
• Computer Science
2006 40th Annual Conference on Information Sciences and Systems
• 2006
The first guarantees for universal measurements (i.e. which work for all sparse functions) with reasonable constants are proved, based on the technique of geometric functional analysis and probability in Banach spaces.
Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems
• Computer Science
IEEE Journal of Selected Topics in Signal Processing
• 2007
This paper proposes gradient projection algorithms for the bound-constrained quadratic programming (BCQP) formulation of these problems and test variants of this approach that select the line search parameters in different ways, including techniques based on the Barzilai-Borwein method.
Simple bounds for recovering low-complexity models
• Computer Science
Math. Program.
• 2013
A unified analysis of the recovery of simple objects from random linear measurements shows that an s-sparse vector in $${\mathbb{R}^n}$$ can be efficiently recovered from 2s log n measurements with high probability and a rank r, n × n matrix can be efficient recovered from r(6n − 5r) measurements withhigh probability.