4.5 Article

User-Friendly Tail Bounds for Sums of Random Matrices

期刊

FOUNDATIONS OF COMPUTATIONAL MATHEMATICS
卷 12, 期 4, 页码 389-434

出版社

SPRINGER
DOI: 10.1007/s10208-011-9099-z

关键词

Discrete-time martingale; Large deviation; Probability inequality; Random matrix; Sum of independent random variables

资金

  1. ONR [N00014-08-1-0883]
  2. DARPA [N66001-08-1-2065]
  3. AFOSR [FA9550-09-1-0643]

向作者/读者索取更多资源

This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the large-deviation behavior of the maximum eigenvalue of the sum. Tail bounds for the norm of a sum of random rectangular matrices follow as an immediate corollary. The proof techniques also yield some information about matrix-valued martingales. In other words, this paper provides noncommutative generalizations of the classical bounds associated with the names Azuma, Bennett, Bernstein, Chernoff, Hoeffding, and McDiarmid. The matrix inequalities promise the same diversity of application, ease of use, and strength of conclusion that have made the scalar inequalities so valuable.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Mathematics, Applied

Second-order matrix concentration inequalities

Joel A. Tropp

APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS (2018)

Article Physics, Multidisciplinary

Fast state tomography with optimal error bounds

M. Guta, J. Kahn, R. Kueng, J. A. Tropp

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL (2020)

Article Statistics & Probability

From Poincare inequalities to nonlinear matrix concentration

De Huang, Joel A. Tropp

Summary: This paper deduces exponential matrix concentration using a short, conceptual argument based on a Poincare inequality. The theory also applies to matrix-valued functions of a uniformly log-concave random vector. The proof relies on subadditivity of Poincare inequalities and a chain rule inequality for the trace of the matrix Dirichlet form, avoiding difficulties associated with a direct extension of the classic scalar argument through symmetrization technique.

BERNOULLI (2021)

Article Computer Science, Theory & Methods

Matrix Concentration for Products

De Huang, Jonathan Niles-Weed, Joel A. Tropp, Rachel Ward

Summary: This paper presents nonasymptotic growth and concentration bounds for a product of independent random matrices, relying on the uniform smoothness properties of the Schatten trace classes. These results refine and extend previous work and are akin to other results on sums of independent random matrices.

FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2022)

Article Mathematics, Applied

Randomized block Krylov methods for approximating extreme eigenvalues

Joel A. Tropp

Summary: Randomized block Krylov subspace methods are powerful algorithms for computing extreme eigenvalues of symmetric matrices or extreme singular values of general matrices. This paper develops new theoretical bounds on the performance of these methods, showing that for matrices with polynomial spectral decay, accurate spectral norm estimates can be obtained with a constant number of steps. The analysis also indicates that algorithm behavior is sensitive to block size, a finding confirmed by numerical evidence.

NUMERISCHE MATHEMATIK (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Inference of Black Hole Fluid-Dynamics from Sparse Interferometric Measurements

Aviad Levis, Daeyoung Lee, Joel A. Tropp, Charles F. Gammie, Katherine L. Bouman

Summary: We propose a method to recover the underlying properties of fluid-dynamical processes from sparse measurements, demonstrated through simulations of black hole evolution. Our approach shows advantages over state-of-the-art dynamic black hole imaging techniques.

2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021) (2021)

Article Mathematics, Applied

An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity

Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, Madeleine Udell

Summary: This paper introduces a new storage-optimal algorithm that can solve almost all SDPs, particularly effective for weakly constrained SDPs. By formulating an approximate complementarity principle, the algorithm significantly reduces the search space for the primal solution. Numerical experiments demonstrate the success of this approach for a variety of large-scale SDPs.

SIAM JOURNAL ON OPTIMIZATION (2021)

Article Quantum Science & Technology

Concentration for Random Product Formulas

Chi-Fang Chen, Hsin-Yuan Huang, Richard Kueng, Joel A. Tropp

Summary: This study explores the use of a simple and powerful randomized method called QDRIFT to accelerate quantum simulation, finding that it can generate random product formulas that approximate the ideal evolution. The gate complexity is shown to be independent of the number of terms in the Hamiltonian, with the same random evolution producing shorter circuits depending on the input state. The proofs rely on concentration inequalities for vector and matrix martingales, and the results are applicable to other randomized product formulas.

PRX QUANTUM (2021)

Article Mathematics, Applied

Binary Component Decomposition Part I: The Positive-Semidefinite Case

Richard Kueng, Joel A. Tropp

Summary: This paper investigates the decomposition of a low-rank positive-semidefinite matrix into symmetric factors with binary entries and provides answers to fundamental questions regarding the existence and uniqueness of these decompositions. The research also introduces tractable factorization algorithms that work under a mild deterministic condition.

SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE (2021)

Article Mathematics, Applied

Scalable Semidefinite Programming

Alp Yurtsever, Joel A. Tropp, Olivier Fercoq, Madeleine Udell, Volkan Cevher

Summary: Semidefinite programming (SDP) is a powerful framework in convex optimization with potential for data science. The paper introduces a randomized algorithm for solving large SDP problems, which is cost-effective. Numerical evidence shows the algorithm's effectiveness in various applications.

SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE (2021)

Article Statistics & Probability

Nonlinear matrix concentration via semigroup methods

De Huang, Joel A. Tropp

Summary: Matrix concentration inequalities provide information about the probability that a random matrix is close to its expectation with respect to the '2 operator norm. This paper uses semigroup methods to derive sharp nonlinear matrix inequalities, with the main result being that the classical Bakry-Emery curvature criterion implies subgaussian concentration for matrix Lipschitz functions, overcoming technical obstacles in previous attempts. The approach unifies and extends much of the previous work on matrix concentration, reproducing the matrix Efron-Stein inequalities and handling matrix-valued functions on a Riemannian manifold with uniformly positive Ricci curvature.

ELECTRONIC JOURNAL OF PROBABILITY (2021)

Article Mathematics, Applied

Low-Rank Tucker Approximation of a Tensor from Streaming Data

Yiming Sun, Yang Guo, Charlene Luo, Joel Tropp, Madeleine Udell

SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE (2020)

Article Mathematics

Randomized numerical linear algebra: Foundations and algorithms

Per-Gunnar Martinsson, Joel A. Tropp

ACTA NUMERICA (2020)

Article Mathematics, Applied

STREAMING LOW-RANK MATRIX APPROXIMATION WITH AN APPLICATION TO SCIENTIFIC SIMULATION

Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher

SIAM JOURNAL ON SCIENTIFIC COMPUTING (2019)

Article Mathematics, Applied

Universality laws for randomized dimension reduction, with applications

Samet Oymak, Joel A. Tropp

INFORMATION AND INFERENCE-A JOURNAL OF THE IMA (2018)

暂无数据