The performance bounds of learning machines based on exponentially strongly mixing sequences
From MaRDI portal
Publication:2458710
Recommendations
- The Generalization Performance of Learning Machine with NA Dependent Sequence
- scientific article; zbMATH DE number 5524586
- The bound for the rate of uniform convergence for a learning machine based on an -mixing sequence
- The generalization performance of ERM algorithm with strongly mixing observations
- Learning rates of regularized regression for exponentially strongly mixing sequence
Cites work
- A note on uniform laws of averages for dependent processes
- Advances in Neural Networks – ISNN 2005
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1453032 (Why is no real title available?)
- scientific article; zbMATH DE number 3349105 (Why is no real title available?)
- Learning and generalisation. With applications to neural networks.
- Minimum complexity regression estimation with weakly dependent observations
- Mixing Conditions for Markov Chains
- New approaches to statistical learning theory
- On the mathematical foundations of learning
- Probability Inequalities for Sums of Bounded Random Variables
- Rates of convergence for empirical processes of stationary mixing sequences
- Rates of uniform convergence of empirical means with mixing processes
- Scale-sensitive dimensions, uniform convergence, and learnability
- Some applications of concentration inequalities to statistics
- Uniform and universal Glivenko-Cantelli classes
Cited in
(23)- Learning from uniformly ergodic Markov chains
- Semi-supervised learning based on high density region estimation
- The generalization performance of ERM algorithm with strongly mixing observations
- Generalization ability of online pairwise support vector machine
- Learning rates of regularized regression for exponentially strongly mixing sequence
- Fast learning from \(\alpha\)-mixing observations
- Measuring the capacity of sets of functions in the analysis of ERM
- scientific article; zbMATH DE number 5524586 (Why is no real title available?)
- Generalization bounds of ERM algorithm with Markov chain samples
- Learning from regularized regression algorithms with \(p\)-order Markov chain sampling
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Concentration inequalities for empirical processes of linear time series
- The consistency of least-square regularized regression with negative association sequence
- Risk minimization for time series binary choice with variable selection
- The bound for the rate of uniform convergence for a learning machine based on an -mixing sequence
- Advances in Neural Networks – ISNN 2005
- The Generalization Performance of Learning Machine with NA Dependent Sequence
- Learning performance of Tikhonov regularization algorithm with geometrically beta-mixing observations
- Greedy approximation and regression analysis for the discrete TM system
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- Generalization bounds of incremental SVM
- Understanding generalization of functional linear regression from non-i.i.d. sample viewpoint
- Robust learning of Huber loss under exponentially strongly mixing sequence
This page was built for publication: The performance bounds of learning machines based on exponentially strongly mixing sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458710)
