AI & ML
Markov Chain Convergence in Kernel-Induced Geometry
arXiv stat.ML0 views
arXiv:2610.13916v1 Announce Type: cross 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.
Source:https://arxiv.org/abs/2610.13916PreviousSLICE: Sequential Likelihood-Free Inference via Conformal E-ValuesNextSurrogate Graph Partitioning for Spatial Prediction
Related posts
AI Agent Security Guide
0dev.to Kubernetes
Hydra v1: new DOI and the complete DOI registry (2026-11-02)
0dev.to OpenSource
Lorenz 1.2.3: AppImage AppStream metadata fix
0dev.to OpenSource
Testing Desktop Apps with AI Without Blocking Your Main Computer
0dev.to Programming
AI Engineer Roadmap 2026: What 390 Job Postings Actually Require
0dev.to Programming
Locus Earth: Building an Open-Source 3D Globe That Runs Directly in Your Browser 🌍
0dev.to JavaScript