Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 30 min ago
PreprintCC BY 4.0arXiv

Markov Chain Convergence in Kernel-Induced Geometry

Abstract

We study the convergence of Markov chains in the geometry induced by Hilbertian embeddings associated with positive definite kernels, also called Maximum Mean Discrepancy (MMD). Under a contraction assumption in the kernel-induced geometry, and a standard spectral gap assumption, we establish non-asymptotic, high-probability bounds for the convergence of the empirical occupation measure to the invariant measure. The obtained bounds separate the roles of the two conditions: the spectral gap determines the effective sample size in the leading term, while the kernel contraction enters only through a linear correction. As an application, we study one-step prediction of dynamical systems from a single trajectory, deriving fast learning rates for a nonlinear least-squares estimator. The rates highlight the interplay between mixing properties in the kernel-induced geometry and the classical source and capacity conditions used in the analysis of least-squares.

Related

  1. Irreducible Markov kernels: a residual kernel approach
    Hervé Loïc, James Ledoux
    HALPreprintCC BY-NC-ND 4.0Full textAnalysis & PDEsProbabilityHAL
  2. Markov chain Monte Carlo for predictively oriented posteriors
    Yann McLatchie, Louis Sharrock, David T. Frazier +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  3. Geometric approximation for the number of returns of a transient Markov chain to its origin
    Fraser Daly, Seva Shneer
    arXivPreprintCC BY-NC-ND 4.0Full textProbabilityarXiv
  4. Convergence-Aware Pareto Selection of Covariate Scaling Transformations for Markov Deterioration Hazard Models: Evidence from Bridge Inspection Data
    Takato Yasuno, Keita Kobayashi, Ryuta Sakaguchi
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. A Markov Chain Approach to Modeling Rugby Union
    Kenny Watts, Jonathan Pipping-Gamón
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{kachaiev2026markov,
  title = {{Markov Chain Convergence in Kernel-Induced Geometry}},
  author = {Oleksii Kachaiev and Luc Brogat-Motte and Silvia Villa and Lorenzo Rosasco},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.13916},
  eprint = {2610.13916},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.13916},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Markov Chain Convergence in Kernel-Induced Geometry
AU  - Oleksii Kachaiev
AU  - Luc Brogat-Motte
AU  - Silvia Villa
AU  - Lorenzo Rosasco
PY  - 2026
DA  - 2026/10/09
PB  - arXiv
DO  - 10.48550/arxiv.2610.13916
UR  - https://arxiv.org/abs/2610.13916
AB  - We study the convergence of Markov chains in the geometry induced by Hilbertian embeddings associated with positive definite kernels, also called Maximum Mean Discrepancy (MMD). Under a contraction assumption in the kernel-induced geometry, and a standard spectral gap assumption, we establish non-asymptotic, high-probability bounds for the convergence of the empirical occupation measure to the invariant measure. The obtained bounds separate the roles of the two conditions: the spectral gap determines the effective sample size in the leading term, while the kernel contraction enters only through a linear correction. As an application, we study one-step prediction of dynamical systems from a single trajectory, deriving fast learning rates for a nonlinear least-squares estimator. The rates highlight the interplay between mixing properties in the kernel-induced geometry and the classical source and capacity conditions used in the analysis of least-squares.
ER  -