Rademacher learning rates for iterated random functions
From MaRDI portal
Cites work
- A note on the Birkhoff ergodic theorem
- Concentration inequalities for dependent random variables via the martingale method
- Concentration inequalities for Markov chains by Marton couplings and spectral methods
- Concentration inequalities for Markov processes via coupling
- Concentration inequalities. A nonasymptotic theory of independence
- Concentration of Measure for the Analysis of Randomized Algorithms
- Concentration of measure without independence: a unified approach via the martingale method
- Deviation inequalities for separately Lipschitz functionals of iterated random functions
- Ergodic behavior of Markov processes. With applications to limit theorems
- Exponential inequalities for nonstationary Markov chains
- Extension of the PAC framework to finite and countable Markov chains
- Foundations of machine learning
- Generalization bounds for non-stationary mixing processes
- Generalization bounds for time series prediction with non-stationary processes
- Generalization bounds of ERM algorithm with Markov chain samples
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- Iterated Random Functions
- Learning and generalisation. With applications to neural networks.
- Learning from dependent observations
- Learning from non-irreducible Markov chains
- Learning from uniformly ergodic Markov chains
- Markov Chains and Stochastic Stability
- Memory-universal prediction of stationary random processes
- Neural Network Learning
- Nonparametric curve estimation from time series
- Nonparametric statistics for stochastic processes. Estimation and prediction.
- Nonparametric time series prediction through adaptive model selection
- On consistency in nonparametric estimation under mixing conditions.
- Optimal Transport
- Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings
- Rates of convergence for empirical processes of stationary mixing sequences
- The concentration of measure phenomenon
- Understanding machine learning. From theory to algorithms
This page was built for publication: Rademacher learning rates for iterated random functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873890)
