Fetching the paper…
Reading the bibliography…
This tutorial provides an exposition of a flexible geometric framework for high dimensional estimation problems with constraints.
A. Dvoretzky, A theorem on convex bodies and applications to Banach spaces
1959
Earlier work this paper cites.
A. Dvoretzky, Some results on convex bodies and Banach spaces
1961
Earlier work this paper cites.
R. Rockafellar, Convex analysis
1970
Earlier work this paper cites.
V. Milman, New proof of the theorem of Dvoretzky on sections of convex bodies
1971
Earlier work this paper cites.
Fernique, X. Regularité des trajectoires des fonctions aléatoires gaussiennes
1975
Earlier work this paper cites.
V. Milman, Geometrical inequalities and mixed volumes in the Local Theory of Banach spaces
1985
Earlier work this paper cites.
V. Milman, Random subspaces of proportional dimension of finite dimensional normed spaces: approach through the isoperimetric inequality
1985
Earlier work this paper cites.
V. Milman, G. Schechtman, Asymptotic theory of finite-dimensional normed spaces
1986
Earlier work this paper cites.
A. Pajor, N. Tomczak-Jaegermann, Subspaces of small codimension of finite dimen- sional Banach spaces
1986
Earlier work this paper cites.
M. Talagrand, Regularity of Gaussian processes
1987
Earlier work this paper cites.
Y. Gordon, On Milman’s inequality and random subspaces which escape through a mesh in ℝ n \mathbb{R}^{n}
1988
Earlier work this paper cites.
G. Pisier, The volume of convex bodies and Banach space geometry
1989
Earlier work this paper cites.
K. Ball, An elementary introduction to modern convex geometry
1997
Earlier work this paper cites.
A. Giannopoulos, V. Milman, How small can the intersection of a few rotations of a symmetric convex body be?
1997
Earlier work this paper cites.
A. Giannopoulos,V. Milman, On the diameter of proportional sections of a symmetric convex body
1997
Earlier work this paper cites.
S. Chen, D. Donoho, M. Saunders, Atomic decomposition by basis pursuit
1998
Earlier work this paper cites.
A. Giannopoulos, V. D. Milman, Mean width and diameter of proportional sections of a symmetric convex body
1998
Earlier work this paper cites.
V. Milman, Surprising geometric phenomena in high-dimensional convexity theory
1998
Earlier work this paper cites.
Y. Seginer, The expected norm of random matrices
2000
Earlier work this paper cites.
A. Ben-Tal, A. Nemirovski, Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
2001
Earlier work this paper cites.
M. Ledoux, The concentration of measure phenomenon
2001
Earlier work this paper cites.
D. Donoho, M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via l 1 l^{1} minimization
2003
Earlier work this paper cites.
S. Mendelson, A few notes on Statistical Learning Theory
2003
Earlier work this paper cites.
S. Boucheron, O. Bousquet, G. Lugosi, Concentration inequalities
2004
Earlier work this paper cites.
A. Giannopoulos, V. Milman, Asymptotic convex geometry: short overview
2004
Cited alongside, same era.
S. Mendelson, Geometric parameters in learning theory
2004
Cited alongside, same era.
A. Giannopoulos, V. D. Milman, Asymptotic formulas for the diameter of sections of symmetric convex bodies
2005
Cited alongside, same era.
N. Srebro, N. Alon, T. Jaakkola, Generalization error bounds for collaborative prediction with low-rank matrices
2005
Cited alongside, same era.
M. Talagrand, The generic chaining. Upper and lower bounds of stochastic processes
2005
Cited alongside, same era.
G. Paouris, Concentration of mass on convex bodies
2006
Cited alongside, same era.
B. Recht, A simpler approach to matrix completion
2011
Later among the works it cites.
F. Bach, R. Jenatton, J. Mairal,G. Obozinski, Structured sparsity through convex optimization
2012
Later among the works it cites.
D. Chafaï, O. Guédon, G. Lecué, A. Pajor, Interactions between compressed sensing random matrices and high dimensional geometry
2012
Later among the works it cites.
V. Chandrasekaran, B. Recht, P. Parrilo, A. Willsky, The convex geometry of linear inverse problems
2012
Later among the works it cites.
M. Davenport, M. Duarte, Y. Eldar, G. Kutyniok, Introduction to compressed sensing
2012
Later among the works it cites.
N. Rao, B. Recht, R. Nowak, Tight Measurement Bounds for Exact Recovery of Structured Sparse Signals
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Rudelson, R. Vershynin, Combinatorics of random processes and sections of convex bodies
2006
Cited alongside, same era.
B. Klartag, Power-law estimates for the central limit theorem for convex sets
2007
Cited alongside, same era.
S. Mendelson, A. Pajor, N. Tomczak-Jaegermann, Reconstruction and subgaussian operators in asymptotic geometric analysis
2007
Cited alongside, same era.
P. Boufounos, R. Baraniuk, 1 1 -Bit compressive sensing
2008
Cited alongside, same era.
H. Rauhut, K. Schnass, P. Vandergheynst, Compressed sensing and redundant dictionaries
2008
Cited alongside, same era.
M. Rudelson, R. Vershynin, On sparse reconstruction from Fourier and Gaussian measurements
2008
Cited alongside, same era.
2012
Later among the works it cites.
R. Vershynin, Introduction to the non-asymptotic analysis of random matrices
2012
Later among the works it cites.
S. Artstein-Avidan, A. Giannopoulos, V. Milman, Asymptotic Geometric Analysis
2013
Later among the works it cites.
M. Davenport, D. Needell, M. Wakin, Signal space CoSaMP for sparse recovery with redundant dictionaries
2013
Later among the works it cites.
S. Foucart, H. Rauhut, A mathematical introduction to compressive sensing
2013
Later among the works it cites.
G. Kutyniok, Theory and applications of compressed sensing
2013
Later among the works it cites.
Y. Plan, R. Vershynin, One-bit compressed sensing by linear programming
2013
Later among the works it cites.
Y. Plan, R. Vershynin, Robust 1-bit compressed sensing and sparse logistic regression: a convex programming approach
2013
Later among the works it cites.
R. Adamczak, R. Latala, A. Litvak, K. Oleszkiewicz, A. Pajor, N. Tomczak-Jaegermann, A short proof of Paouris’ inequality
2014
Closest in time.
A. Ai, A. Lapanowski, Y. Plan and R. Vershynin, One-bit compressed sensing with non-Gaussian measurements, Linear Algebra and Applications 441 (2014), 222–239
2014
Closest in time.
D. Amelunxen, M. Lotz, M. McCoy, J. A. Tropp, Living on the edge: A geometric theory of phase transitions in convex optimization
2014
Closest in time.
S. Chatterjee, A new perspective on least squares under convex constraint
2014
Closest in time.
A. Giannopoulos, S. Brazitikos, P. Valettas, B.-H. Vritsiou, Geometry of isotropic convex bodies
2014
Closest in time.
G. Lecué, S. Mendelson, Sparse recovery under weak moment assumptions
2014
Closest in time.
Y. Plan, R. Vershynin, Dimension reduction by random hyperplane tessellations
2014
Closest in time.
2014
Closest in time.
E. Candès, T. Tao, The power of convex relaxation: near-optimal matrix completion
2080
Closest in time.
L. Jacques, J. Laska, P. Boufounos, R. Baraniuk, Robust 1 1 -bit compressive sensing via binary stable embeddings of sparse vectors
2082
Closest in time.