Learning bounds of ERM principle for sequences of time-dependent samples
From MaRDI portal
Recommendations
- Generalization bounds of ERM algorithm with Markov chain samples
- The generalization performance of ERM algorithm with strongly mixing observations
- scientific article; zbMATH DE number 5524586
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Empirical risk minimizing for dynamical data structures
Cites work
- scientific article; zbMATH DE number 1950575 (Why is no real title available?)
- Advanced Lectures on Machine Learning
- Channel Capacity and State Estimation for State-Dependent Gaussian Channels
- Concentration inequalities for dependent random variables via the martingale method
- Functional data analysis.
- Functional linear regression that's interpretable
- Integral Probability Metrics and Their Generating Classes of Functions
- Learning Theory
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
- On the empirical estimation of integral probability metrics
- On uniform deviations of general empirical risks with unboundedness, dependence, and high dimensionality
- PAC-Bayes bounds with data dependent priors
- Probability Inequalities for Sums of Bounded Random Variables
- Risk bounds of learning processes for Lévy processes
- The generalization performance of ERM algorithm with strongly mixing observations
- Weighted sums of certain dependent random variables
Cited in
(2)
This page was built for publication: Learning bounds of ERM principle for sequences of time-dependent samples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1723532)
