mlsanityData to 14 Oct 2026

A variational approach to dimension-free self-normalized concentration

arXiv 2508.06483 ↗First posted 8 Aug 2025math.PR math.ST stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the self-normalized concentration of vector-valued stochastic processes. We focus on bounds for "sub-psi" processes, a well-known and quite general class that encompasses a wide variety of well-known tail conditions (including sub-exponential, sub-Gaussian, sub-gamma, sub-Poisson, and several heavy-tailed settings without a moment generating function such as symmetric or bounded 2nd or 3rd moments). Our results recover and generalize the influential bound of de la Pe~na et al. [20] (proved again in Abbasi-Yadkori et al. [2]) in the sub-Gaussian case. Further, we fill a gap in the literature between determinant-based bounds and more recent bounds based on condition numbers. As applications we prove a Bernstein inequality for random vectors satisfying a moment condition (a more general condition than boundedness), and also provide the first dimension-free self-normalized empirical Bernstein inequality. Our techniques are based on the variational (PAC-Bayes) approach to concentration.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 73 references that are in the map. First posted on arXiv 8 Aug 2025.

Builds on

21 of 73 references.

References · 21

  1. 2017On Kernelized Multi-armed Banditscited by 352
  2. 2021User-friendly introduction to PAC-Bayes boundscited by 239
  3. 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 229
  4. 2020Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processescited by 200
  5. 2020Estimating means of bounded random variables by bettingcited by 169
  6. 2019A Primer on PAC-Bayesian Learningcited by 132
  7. 2020Improved Optimistic Algorithms for Logistic Banditscited by 118
  8. 2017Sub-sampled Cubic Regularization for Non-convex Optimizationcited by 63
  9. 2023On the Sublinear Regret of GP-UCBcited by 26
  10. 2023A unified recipe for deriving (time-uniform) PAC-Bayes boundscited by 25
  11. 2019A Tutorial on Concentration Bounds for System Identificationcited by 19
  12. 2021Martingale Methods for Sequential Estimation of Convex Functionals and Divergencescited by 18
9 more
  1. 2023Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixturescited by 12
  2. 2023Time-Uniform Self-Normalized Concentration for Vector-Valued Processescited by 9
  3. 2025Confidence Estimation via Sequential Likelihood Mixingcited by 7
  4. 2023Time-Uniform Confidence Spheres for Means of Random Vectorscited by 6
  5. 2024Mean Estimation in Banach Spaces Under Infinite Variance and Martingale Dependencecited by 6
  6. 2025Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Boundscited by 4
  7. 2024Achieving Constant Regret in Linear Markov Decision Processescited by 3
  8. 2024Sharp Matrix Empirical Bernstein Inequalitiescited by 2
  9. 2024Dimension-free Structured Covariance Estimationcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.