A Doeblin-Anchored Contrastive Chart for Learning Markov Transition Kernels
Not on the map. Why?
Abstract (arXiv)
Learning a Markov transition model is not merely conditional density estimation: the learned object must be a valid transition kernel before it is iterated in downstream dynamics. This paper introduces a Doeblin-anchored contrastive chart, a statistical-to-dynamical coordinate framework for learning transition kernels from contrastive objectives. Given a restart law and an anchor strength, the chart mixes the target transition with the restart law. The resulting anchored kernel is simultaneously a Doeblin-minorized Markov kernel, the positive conditional law in a binary contrastive experiment, and an explicitly invertible coordinate for the original transition law. We prove that the anchored contrastive risk identifies the anchored transition density and calibrates excess risk to density error. Since inversion of a learned score may produce a signed or unnormalized object, we introduce a measurable Markovization operator that restores kernel validity while preserving integrated L1 accuracy up to a constant factor. Oracle inequalities and H"older--ReLU approximation bounds yield nonparametric rates for independent transition pairs. For stationary geometrically β-mixing trajectories, a conservative thinning-and-coupling extension yields the same reconstruction interface with an effective sample size. Occupancy-weighted perturbation bounds transfer one-step kernel error to finite-horizon marginal, path-law, and occupation-measure errors under explicit coverage.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 42 references that are in the map. First posted on arXiv 1 Jun 2026.
Builds on
11 of 42 references.
References · 11
- 2019Dream to Control: Learning Behaviors by Latent Imaginationcited by 1,653
- 2018World Modelscited by 1,513
- 2018Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Modelscited by 774
- 2019When to Trust Your Model: Model-Based Policy Optimizationcited by 773
- 2016Error bounds for approximations with deep ReLU networkscited by 574
- 2017Nonparametric regression using deep neural networks with ReLU activation functioncited by 433
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 311
- 2018Conditional Density Estimation with Bayesian Normalising Flowscited by 54
- 2017Converting High-Dimensional Regression to High-Dimensional Conditional Density Estimationcited by 34
- 2018Conditional Noise-Contrastive Estimation of Unnormalised Modelscited by 25
- 2021LinCDE: Conditional Density Estimation via Lindsey's Methodcited by 13
Built on by
Not cited yet.