Matrix Moment and Concentration Inequalities for Martingales and Ergodic Markov Chains with Applications in Statistical Learning

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Peng, Yang, Xin, Yuchen, Zhang, Zhihua
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915612535554048
author Peng, Yang
Xin, Yuchen
Zhang, Zhihua
author_facet Peng, Yang
Xin, Yuchen
Zhang, Zhihua
contents In this paper, we study moment and concentration inequalities for the spectral norm of sums of dependent random matrices. We establish novel Rosenthal-Burkholder inequalities for discrete-time matrix local martingales, Burkholder-Davis-Gundy inequality for continuous matrix local martingales, as well as matrix Rosenthal, Hoeffding, and Bernstein inequalities for ergodic Markov chains. Compared with previous work on matrix concentration inequalities for Markov chains, which assume a non-zero absolute $L^2$-spectral gap or the stronger $ψ$-mixing condition, our results assume geometric ergodicity, a condition commonly used in statistical applications. Furthermore, our results have leading terms that match the Markov chain central limit theorem, rather than relying on suboptimal variance proxies. We also give dimension-free versions of the inequalities, which are independent of the ambient dimension $d$ and relies on the effective rank instead. This enables the generalization of our results to linear operators in infinite-dimensional Hilbert spaces. Our results have extensive applications in statistics and machine learning; in particular, we obtain improved bounds in covariance estimation and principal component analysis on Markovian data.
format Preprint
id arxiv_https___arxiv_org_abs_2508_04327
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Matrix Moment and Concentration Inequalities for Martingales and Ergodic Markov Chains with Applications in Statistical Learning
Peng, Yang
Xin, Yuchen
Zhang, Zhihua
Probability
Statistics Theory
In this paper, we study moment and concentration inequalities for the spectral norm of sums of dependent random matrices. We establish novel Rosenthal-Burkholder inequalities for discrete-time matrix local martingales, Burkholder-Davis-Gundy inequality for continuous matrix local martingales, as well as matrix Rosenthal, Hoeffding, and Bernstein inequalities for ergodic Markov chains. Compared with previous work on matrix concentration inequalities for Markov chains, which assume a non-zero absolute $L^2$-spectral gap or the stronger $ψ$-mixing condition, our results assume geometric ergodicity, a condition commonly used in statistical applications. Furthermore, our results have leading terms that match the Markov chain central limit theorem, rather than relying on suboptimal variance proxies. We also give dimension-free versions of the inequalities, which are independent of the ambient dimension $d$ and relies on the effective rank instead. This enables the generalization of our results to linear operators in infinite-dimensional Hilbert spaces. Our results have extensive applications in statistics and machine learning; in particular, we obtain improved bounds in covariance estimation and principal component analysis on Markovian data.
title Matrix Moment and Concentration Inequalities for Martingales and Ergodic Markov Chains with Applications in Statistical Learning
topic Probability
Statistics Theory
url https://arxiv.org/abs/2508.04327