A tight bound of hard thresholding (Q4558539)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

A tight bound of hard thresholding

scientific article; zbMATH DE number 6982964

Language	Label	Description	Also known as
default for all languages	No label defined
English	A tight bound of hard thresholding	scientific article; zbMATH DE number 6982964

Statements

instance of

scholarly article

0 references

publication date

22 November 2018

0 references

full work available at URL

https://arxiv.org/abs/1605.01656

0 references

http://jmlr.csail.mit.edu/papers/v18/16-299.html

0 references

zbMATH Keywords

sparsity

0 references

hard thresholding

0 references

compressed sensing

0 references

stochastic optimization

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling

0 references

Fast global convergence of gradient methods for high-dimensional statistical recovery

0 references

Improved bounds on restricted isometry constants for Gaussian matrices

0 references

Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices

0 references

Greedy sparsity-constrained optimization

0 references

A simple proof of the restricted isometry property for random matrices

0 references

Simultaneous analysis of Lasso and Dantzig selector

0 references

Performance comparisons of greedy algorithms in compressed sensing.

0 references

Iterative thresholding for sparse approximations

0 references

Iterative hard thresholding for compressed sensing

0 references

Sharp RIP bound for sparse signal and low-rank matrix recovery

0 references

New Bounds for Restricted Isometry Constants

0 references

The restricted isometry property and its implications for compressed sensing

0 references

Decoding by Linear Programming

0 references

The Dantzig selector: statistical estimation when $p$ is much larger than $n$. (With discussions and rejoinder).

0 references

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

0 references

The convex geometry of linear inverse problems

0 references

Atomic Decomposition by Basis Pursuit

0 references

Subspace Pursuit for Compressive Sensing Signal Reconstruction

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Compressed sensing

0 references

Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse

0 references

Stable recovery of sparse overcomplete representations in the presence of noise

0 references

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

0 references

Efficient online and batch learning using forward backward splitting

0 references

Least angle regression. (With discussion)

0 references

Hard thresholding pursuit: an algorithm for compressive sensing

0 references

Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants

0 references

A mathematical introduction to compressive sensing

0 references

Sparse online learning via truncated gradient

0 references

High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity

0 references

Regularized $M$-estimators with nonconvexity: statistical and algorithmic theory for local optima

0 references

Sparse principal component analysis and iterative thresholding

0 references

A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

0 references

A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints

0 references

Safe and Effective Importance Sampling

0 references

Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls

0 references

Q4864293

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

0 references

Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)

0 references

On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit

0 references

Dual averaging methods for regularized stochastic learning and online optimization

0 references

A proximal stochastic gradient method with progressive variance reduction

0 references

Truncated power method for sparse eigenvalue problems

0 references

Q4558490

0 references

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

0 references

Identifiers

zbMATH Open document ID

1473.62287

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi A tight bound of hard thresholding