Learning from uniformly ergodic Markov chains
From MaRDI portal
Recommendations
- Generalization bounds of ERM algorithm with Markov chain samples
- Convergence and consistency of ERM algorithm with uniformly ergodic Markov chain samples
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- The generalization performance of ERM algorithm with strongly mixing observations
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- Adaptive Rejection Sampling for Gibbs Sampling
- An introduction to MCMC for machine learning
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Capacity of reproducing kernel spaces in learning theory
- Hoeffding's inequality for uniformly ergodic Markov chains
- Learning Theory
- Learning from dependent observations
- Markov chains and stochastic stability
- Minimum complexity regression estimation with weakly dependent observations
- Mixing times for uniformly ergodic Markov chains
- Monte Carlo sampling methods using Markov chains and their applications
- New approaches to statistical learning theory
- ONLINE LEARNING WITH MARKOV SAMPLING
- On the Markov chain central limit theorem
- On the mathematical foundations of learning
- Rates of convergence for empirical processes of stationary mixing sequences
- Shannon sampling and function reconstruction from point values
- Stationarity detection in the initial transient problem
- Support vector machine soft margin classifiers: error analysis
- The generalization performance of ERM algorithm with strongly mixing observations
- The performance bounds of learning machines based on exponentially strongly mixing sequences
Cited in
(15)- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- New Bernstein and Hoeffding type inequalities for regenerative Markov chains
- Generalized Dobrushin ergodicity coefficient and ergodicities of non-homogeneous Markov chains
- Extension of the PAC framework to finite and countable Markov chains
- Hold-out estimates of prediction models for Markov processes
- Statistical learning based on Markovian data maximal deviation inequalities and learning rates
- Learning from regularized regression algorithms with \(p\)-order Markov chain sampling
- Convergence and consistency of ERM algorithm with uniformly ergodic Markov chain samples
- Generalization bounds of ERM algorithm with Markov chain samples
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- The generalization performance of ERM algorithm with strongly mixing observations
- ERM learning with unbounded sampling
- Learning from non-irreducible Markov chains
- Approximations of non-homogeneous Markov chains on abstract states spaces
- ONLINE LEARNING WITH MARKOV SAMPLING
This page was built for publication: Learning from uniformly ergodic Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1023402)
