Empirical PAC-Bayes Bounds for Markov Chains
stat.ML, cs.LG
Submitted: 2025-09-25
Updated: 2026-03-11
Comments: To appear in the proceedings of AISTATS 2026
Journal ref: Proceedings of the 29th International Conference on Artificial Intelligence and Statistics (AISTATS), Proceedings of Machine Learning Research, 2026, vol. 300, pp. 361-369
Code: https://github.com/v-ahe/empirical-pac-bayes-markov
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Generalization bounds for mixing processes via delayed online-to-PAC conversions
- Minimax optimality of deep neural networks on dependent data via PAC-Bayes bounds
- Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data
- Estimating the Mixing Coefficients of Geometrically Ergodic Markov Processes
- Estimating the Spectral Gap of a Reversible Markov Chain from a Short Trajectory
- A Note on the PAC Bayesian Theorem
- Optimistic Estimation of Convergence in Markov Chains with the Average-Mixing Time
Related papers
- Behavior of prediction performance metrics with rare events
- Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
- A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
- Efficient quadratic entropy with distance sketches
- Embedding-Bias in Conditional Independence Testing
- From Log-Odds to Shapley Values: An Explanatory Geometry for the Weighted Naive Bayes Classifier