Learning from uniformly ergodic Markov chains

DOI10.1016/J.JCO.2009.01.001zbMATH Open1183.68515OpenAlexW2001960189MaRDI QIDQ1023402FDOQ1023402

Hai Zhang, Bin Zou, Zongben Xu

Publication date: 11 June 2009

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2009.01.001

zbMATH Keywords

uniform convergencegeneralization boundrelative uniform convergenceERM algorithmsuniform ergodic Markov chain samples

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Markov processes (60J99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning Theory
• Adaptive Rejection Sampling for Gibbs Sampling
• Monte Carlo sampling methods using Markov chains and their applications
• On the mathematical foundations of learning
• Markov chains and stochastic stability
• On the Markov chain central limit theorem
• Shannon sampling and function reconstruction from point values
• Capacity of reproducing kernel spaces in learning theory
• An introduction to MCMC for machine learning
• Rates of convergence for empirical processes of stationary mixing sequences
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Mixing times for uniformly ergodic Markov chains
• New approaches to statistical learning theory
• ONLINE LEARNING WITH MARKOV SAMPLING
• Minimum complexity regression estimation with weakly dependent observations
• Learning from dependent observations
• The generalization performance of ERM algorithm with strongly mixing observations
• The performance bounds of learning machines based on exponentially strongly mixing sequences
• Hoeffding's inequality for uniformly ergodic Markov chains
• Stationarity detection in the initial transient problem

Cited In (11)

• Generalization bounds of ERM algorithm with Markov chain samples
• Statistical learning based on Markovian data maximal deviation inequalities and learning rates
• Title not available (Why is that?)
• ERM learning with unbounded sampling
• Learning from regularized regression algorithms with \(p\)-order Markov chain sampling
• Hold-out estimates of prediction models for Markov processes
• Approximations of non-homogeneous Markov chains on abstract states spaces
• Convergence and consistency of ERM algorithm with uniformly ergodic Markov chain samples
• Generalization performance of least-square regularized regression algorithm with Markov chain samples
• Learning from non-irreducible Markov chains
• Generalized Dobrushin ergodicity coefficient and ergodicities of non-homogeneous Markov chains

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)