On generic chaining and the smallest singular value of random matrices with heavy tails
From MaRDI portal
(Redirected from Publication:418699)
Abstract: We present a very general chaining method which allows one to control the supremum of the empirical process in rather general situations. We use this method to establish two main results. First, a quantitative (non asymptotic) version of the classical Bai-Yin Theorem on the singular values of a random matrix with i.i.d entries that have heavy tails, and second, a sharp estimate on the quadratic empirical process when , and is an isotropic, unconditional, log-concave measure.
Recommendations
- On the singular values of random matrices
- Tail bounds via generic chaining
- Chaining, interpolation and convexity II: the contraction principle
- The probabilistic estimates on the largest and smallest \(q\)-singular values of random matrices
- The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
Cites work
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 53996 (Why is no real title available?)
- scientific article; zbMATH DE number 194093 (Why is no real title available?)
- scientific article; zbMATH DE number 3518027 (Why is no real title available?)
- scientific article; zbMATH DE number 1302647 (Why is no real title available?)
- scientific article; zbMATH DE number 1975220 (Why is no real title available?)
- Chevet type inequality and norms of submatrices
- Concentration of mass on convex bodies
- Empirical processes with a bounded \(\psi_1\) diameter
- Estimation of moments of sums of independent real random variables
- Global versus local asymptotic theories of finite-dimensional normed spaces
- How close is the sample covariance matrix to the actual covariance matrix?
- Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
- Non-asymptotic theory of random matrices: extreme singular values
- On Weak Tail Domination of Random Vectors
- Order statistics and concentration of \(l_r\) norms for log-concave vectors
- Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
- RANDOM POINTS IN ISOTROPIC UNCONDITIONAL CONVEX BODIES
- Random vectors in the isotropic position
- Reconstruction and subgaussian operators in asymptotic geometric analysis
- Regularity of Gaussian processes
- Sampling convex bodies: a random matrix approach
- Sharp bounds on the rate of convergence of the empirical covariance matrix
- Some limit theorems for empirical processes (with discussion)
- Tail and moment estimates for sums of independent random variables with logarithmically concave tails
- The Brunn-Minkowski inequality in Gauss space
- The Generic Chaining
- The Supremum of Some Canonical Processes
- Uniform Central Limit Theorems
- Weak convergence and empirical processes. With applications to statistics
Cited in
(17)- General nonexact oracle inequalities for classes with a subexponential envelope
- Bounds for stochastic processes on product index spaces
- On the interval of fluctuation of the singular values of random matrices
- Suprema of canonical Weibull processes
- Quantitative Version of a Silverstein’s Result
- On a contraction property of Bernoulli canonical processes
- Asymptotic geometric analysis: achievements and perspective
- Tail bounds via generic chaining
- Chaining, interpolation and convexity II: the contraction principle
- Sampling discretization and related problems
- Covariance estimation under missing observations and \(L_4 - L_2\) moment equivalence
- The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
- Upper bounds on product and multiplier empirical processes
- On multiplier processes under weak moment assumptions
- Phase retrieval: stability and recovery guarantees
- Learning without concentration
- Empirical approximation of the Gaussian distribution in \(\mathbb{R}^d\)
This page was built for publication: On generic chaining and the smallest singular value of random matrices with heavy tails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418699)