Generalization bounds of ERM algorithm with Markov chain samples
From MaRDI portal
(Redirected from Publication:403479)
Recommendations
- Learning from uniformly ergodic Markov chains
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Convergence and consistency of ERM algorithm with uniformly ergodic Markov chain samples
- The generalization performance of ERM algorithm with strongly mixing observations
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- A note on uniform laws of averages for dependent processes
- Approximation methods for supervised learning
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Concentration inequalities for dependent random variables via the martingale method
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Extension of the PAC framework to finite and countable Markov chains
- General state space Markov chains and MCMC algorithms
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Learning Theory
- Learning and generalisation. With applications to neural networks.
- Learning from dependent observations
- Learning from uniformly ergodic Markov chains
- Learning rates of regularized regression for exponentially strongly mixing sequence
- Markov chains and stochastic stability
- Minimum complexity regression estimation with weakly dependent observations
- New approaches to statistical learning theory
- ONLINE LEARNING WITH MARKOV SAMPLING
- On the mathematical foundations of learning
- Rates of convergence for empirical processes of stationary mixing sequences
- Regularized least square regression with dependent samples
- Shannon sampling and function reconstruction from point values
- 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
- Weighted sums of certain dependent random variables
Cited in
(9)- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- Convergence and consistency of ERM algorithm with uniformly ergodic Markov chain samples
- Learning bounds of ERM principle for sequences of time-dependent samples
- On biased random walks, corrupted intervals, and learning under adversarial design
- Learning from uniformly ergodic Markov chains
- 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
This page was built for publication: Generalization bounds of ERM algorithm with Markov chain samples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403479)
