mlsanityData to 7 Oct 2026

Gaussian Approximation for Multivariate Martingale Sums from Uniformly Ergodic Markov Chains

arXiv 2609.09480 ↗First posted 8 Sep 2026math.PR cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We develop Gaussian approximation bounds in higher-order Wasserstein distance Wp, p≥2, for sums of multivariate martingale differences generated by a uniformly ergodic Markov chain. Under an L(2+η)p-moment condition with η>0, we establish the explicit bound Oleft( p3 |A|42 + pd1/4|A|21/2|A|42 right) where A∈ℝn collects the L(2+η)p-sizes of the n individual martingale increments. In the balanced-increment regime where the individual increments have comparable sizes of order n-1/2, it yields the first optimal O(n-1/2) Gaussian approximation rate for fixed p and d. Consequently, we also obtain the first optimal O(n-1/2) Wp Gaussian approximation rate for multivariate additive functionals of uniformly ergodic Markov chains. Our analysis develops two techniques for addressing the interplay between higher-order Wasserstein distance and temporal dependence. First, building on the Ornstein--Uhlenbeck relative-score approach of Fang and Koike (2023), we formulate the bound in terms of antisymmetric Stein couplings while retaining the conditional tensor structure. Second, we develop a refresh-then-maximal coupling that combines an independent first-step resampling, which preserves the desired Stein identity, with a subsequent maximal coupling that provides effective control of the coupling increment. These tools may be useful more broadly for Gaussian approximation under temporal dependence.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 27 references that are in the map. First posted on arXiv 8 Sep 2026.

Builds on

7 of 27 references.

References · 7

  1. 2021Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysiscited by 89
  2. 2021A Lyapunov Theory for Finite-Sample Guarantees of Asynchronous Q-Learning and TD-Learning Variantscited by 57
  3. 2019Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLTcited by 30
  4. 2024Gaussian Approximation and Multiplier Bootstrap for Polyak-Ruppert Averaged Linear Stochastic Approximation with Applications to TD Learningcited by 19
  5. 2024Constant Stepsize Q-learning: Distributional Convergence, Bias and Extrapolationcited by 17
  6. 2024Rates of Convergence in the Central Limit Theorem for Markov Chains, with an Application to TD Learningcited by 17
  7. 2026Finite-Sample Wasserstein Error Bounds and Concentration Inequalities for Nonlinear Stochastic Approximationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.