Matrix Freedman Inequality for Sub‐Weibull Martingales

ABSTRACT In this paper, we establish a matrix Freedman inequality for martingales with sub‐Weibull tails. Under conditional control of the increments, the top eigenvalue admits a non‐asymptotic tail bound with explicit, dimension‐aware constants. Via Hermitian dilation, our result extends to rectangular matrices, recovers the sub‐Gaussian case at and admits a time‐uniform (supremum‐over‐time) form. Relative to recent Bennett/Bernstein bounds for sub‐Weibull matrix martingales, our thresholds depend only on a variance proxy and a radius. Concretely, in high‐confidence regimes with , these new thresholds match or improve the corresponding modern envelopes at the same confidence level. We illustrate the utility of our bound in two applications: (i) self‐normalized confidence sets for stochastic linear bandits with heavy‐tailed noise and (ii) operator‐norm error bounds for covariance estimation. We corroborate the theory and highlight constant‐level effects through simulations over a range of tail indices and variance levels.

Authors

Institutions

Publication Details

Journal
Stat
Published
2025-11-14
DOI
https://doi.org/10.1002/sta4.70119
Primary Topic
Advanced Bandit Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Matrix Freedman Inequality for Sub‐Weibull Martingales

Íñigo Torres
Stat
Advanced Bandit Algorithms Research
article

Matrix Freedman Inequality for Sub‐Weibull Martingales

Íñigo Torres
article en

Abstract

ABSTRACT In this paper, we establish a matrix Freedman inequality for martingales with sub‐Weibull tails. Under conditional control of the increments, the top eigenvalue admits a non‐asymptotic tail bound with explicit, dimension‐aware constants. Via Hermitian dilation, our result extends to rectangular matrices, recovers the sub‐Gaussian case at and admits a time‐uniform (supremum‐over‐time) form. Relative to recent Bennett/Bernstein bounds for sub‐Weibull matrix martingales, our thresholds depend only on a variance proxy and a radius. Concretely, in high‐confidence regimes with , these new thresholds match or improve the corresponding modern envelopes at the same confidence level. We illustrate the utility of our bound in two applications: (i) self‐normalized confidence sets for stochastic linear bandits with heavy‐tailed noise and (ii) operator‐norm error bounds for covariance estimation. We corroborate the theory and highlight constant‐level effects through simulations over a range of tail indices and variance levels.

StatVol. 14(4)
McGill University (CA)
Openalex Percentile: Top 60%
Advanced Bandit Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.