Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Dirksen (2012)
Itô isomorphisms for $L^{p}$-valued Poisson stochastic integralsAnnals of Probability, 42
(1986)
Inégalités de Khintchine dans C p (1 < p < ∞)
M. Rudelson, R. Vershynin (2005)
Sampling from large matrices: An approach through geometric functional analysisJ. ACM, 54
B. Rosén (1970)
On Bounds on the Central Moments of Even Order of a Sum of Independent Random VariablesAnnals of Mathematical Statistics, 41
J. Roos (1986)
A mathematical introduction
D. Luenberger (1968)
Optimization by Vector Space Methods
Yudong Chen, Srinadh Bhojanapalli, Sujay Sanghavi, Rachel Ward (2013)
Coherent Matrix CompletionArXiv, abs/1306.2979
M. Fornasier, K. Schnass, J. Vybíral (2010)
Learning Functions of Few Arbitrary Linear Parameters in High DimensionsFoundations of Computational Mathematics, 12
T. Tao (2012)
Topics in Random Matrix Theory
(1997)
Convex analysis. Princeton Landmarks in Mathematics
A. Bandeira, R. Handel (2014)
Sharp nonasymptotic bounds on the norm of random matrices with independent entriesarXiv: Probability
J. Tropp (2008)
On the conditioning of random subdictionariesApplied and Computational Harmonic Analysis, 25
A. Cohen, M. Davenport, D. Leviatan (2011)
On the Stability and Accuracy of Least Squares ApproximationsFoundations of Computational Mathematics, 13
Nicholas Harvey, Neil Olver (2013)
Pipage Rounding, Pessimistic Estimators and Matrix Concentration
Josip Djolonga, Andreas Krause, V. Cevher (2013)
High-Dimensional Gaussian Process Bandits
A. Buchholz (2001)
Operator Khintchine inequality in non-commutative probabilityMathematische Annalen, 319
S. Boucheron, G. Lugosi, P. Massart (2013)
Concentration Inequalities - A Nonasymptotic Theory of Independence
A. Magen, Anastasios Zouzias (2010)
Low rank matrix-valued chernoff bounds and approximate matrix multiplication
A. Barvinok (2002)
A course in convexity, 54
Michael Cohen, Rasmus Kyng, G. Miller, J. Pachocki, Richard Peng, Anup Rao, S. Xu (2014)
Solving SDD linear systems in nearly mlog1/2n timeProceedings of the forty-sixth annual ACM symposium on Theory of computing
V. Koltchinskii, École Saint-Flour (2011)
Oracle inequalities in empirical risk minimization and sparse recovery problems
(2011)
volume 2033 of Lecture Notes in Mathematics
M. Junge, Quanhua Xu (2003)
Noncommutative Burkholder/Rosenthal inequalitiesAnnals of Probability, 31
K. Weylandt, A. Sardini, C. Higgins, M. Valverdet (1999)
ChannelsThe Journal of Physiology, 517
J. Tropp (2015)
An Introduction to Matrix Concentration InequalitiesArXiv, abs/1501.01571
D. Paulin, Lester Mackey, J. Tropp (2014)
Efron–Stein inequalities for random matricesAnnals of Probability, 44
M. Rudelson (1996)
Random Vectors in the Isotropic PositionJournal of Functional Analysis, 164
M. Junge, Q. Zeng (2011)
Noncommutative Bennett and Rosenthal inequalitiesAnnals of Probability, 41
P. Sutcliffe (1968)
Oxford University PressPMLA/Publications of the Modern Language Association of America, 83
J. Tropp (2010)
Improved Analysis of the subsampled Randomized Hadamard TransformArXiv, abs/1011.1595
R. Oliveira (2009)
The spectrum of random k-lifts of large graphs (with possibly large k)arXiv: Combinatorics
M. Junge, Quanhua Xu (2007)
Noncommutative Burkholder/Rosenthal inequalities II: ApplicationsIsrael Journal of Mathematics, 167
Emilie Morvant, Sokol Koço, L. Ralaivola (2012)
PAC-Bayesian Generalization Bound on Confusion Matrix for Multi-Class ClassificationArXiv, abs/1202.6228
William March, G. Biros (2014)
Far-Field Compression for Fast Kernel Summation Methods in High DimensionsArXiv, abs/1409.2802
Sin-Shuen Cheung, A. So, Kuncheng Wang (2012)
Linear Matrix Inequalities with Stochastically Dependent Perturbations and Applications to Chance-Constrained Semidefinite OptimizationSIAM J. Optim., 22
H. Rosenthal (1970)
On the subspaces ofLp(p>2) spanned by sequences of independent random variablesIsrael Journal of Mathematics, 8
(1997)
Princeton
V. Petrov (1975)
Some Inequalities for the Distributions of Sums of Independent Random Variables
A. Esmaili (2005)
Probability and Random ProcessesTechnometrics, 47
G. Pisier (1993)
Non-commutative vector valued Lp-spaces and completely p-summing mapsarXiv: Functional Analysis
J. A. TROPP
Yuxin Chen, L. Guibas, Qi-Xing Huang (2014)
Near-Optimal Joint Object Matching via Convex RelaxationArXiv, abs/1402.1473
R. Horn, Charles Johnson (1985)
Matrix analysis
J. Kuelbs (1978)
Probability on Banach spaces
P. Constantine, D. Gleich (2014)
Computing Active Subspaces
Kenneth Kreutz–Delgado (2018)
- Finite-Dimensional Vector SpacesPhysical Components of Tensors
J. Tropp (2015)
Second-Order Matrix Concentration InequalitiesarXiv: Probability
Richard Chen, Alex Gittens, J. Tropp (2011)
The Masked Sample Covariance Estimator: An Analysis via Matrix Concentration InequalitiesInformation and Inference: A Journal of the IMA, 1
S. Nagaev, I. Pinelis (1978)
Some Inequalities for the Distribution of Sums of Independent Random VariablesTheory of Probability and Its Applications, 22
David Lopez-Paz, S. Sra, Alex Smola, Zoubin Ghahramani, B. Scholkopf (2014)
Randomized Nonlinear Component AnalysisArXiv, abs/1402.0119
R. Bass, K. Gröchenig (2012)
Relevant Sampling of Band-limited FunctionsArXiv, abs/1203.0146
R. Oliveira (2013)
The lower tail of random quadratic forms with applications to ordinary least squaresProbability Theory and Related Fields, 166
R. Latala, K. Oleszkiewicz (1994)
On the best constant in the Khinchin-Kahane inequalityStudia Mathematica, 109
Lester Mackey, Michael Jordan, Richard Chen, Brendan Farrell, J. Tropp (2012)
Matrix concentration inequalities via the method of exchangeable pairsAnnals of Probability, 42
(2011)
Springer-Verlag
Xiaohong Chen, T. Christensen (2013)
Optimal Uniform Convergence Rates for Sieve Nonparametric Instrumental Variables RegressionPolitical Methods: Quantitative Methods eJournal
(2014)
31st Intl
Stephen Boyd, L. Vandenberghe (2005)
Convex OptimizationJournal of the American Statistical Association, 100
(1974)
New York-Heidelberg
[In contemporary applied and computational mathematics, a frequent challenge is to bound the expectation of the spectral norm of a sum of independent random matrices. This quantity is controlled by the norm of the expected square of the random matrix and the expectation of the maximum squared norm achieved by one of the summands; there is also a weak dependence on the dimension of the random matrix. The purpose of this paper is to give a complete, elementary proof of this important inequality.]
Published: Sep 22, 2016
Keywords: Probability inequality; Random matrix; Sum of independent random variables
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.