Title
Generalization and Robustness of Batched Weighted Average Algorithm with V-Geometrically Ergodic Markov Data.
Abstract
We analyze the generalization and robustness of the batched weighted average algorithm for V-geometrically ergodic Markov data. This algorithm is a good alternative to the empirical risk minimization algorithm when the latter suffers from overfitting or when optimizing the empirical risk is hard. For the generalization of the algorithm, we prove a PAC-style bound on the training sample size for the expected L-1-loss to converge to the optimal loss when training data are V-geometrically ergodic Markov chains. For the robustness, we show that if the training target variable's values contain bounded noise, then the generalization bound of the algorithm deviates at most by the range of the noise. Our results can be applied to the regression problem, the classification problem, and the case where there exists an unknown deterministic target hypothesis.
Year
Venue
Field
2013
ALGORITHMIC LEARNING THEORY (ALT 2013)
Existential quantification,Markov chain,Ergodic theory,Empirical risk minimization,Algorithm,Robustness (computer science),Artificial intelligence,Overfitting,Machine learning,Sample size determination,Mathematics,Bounded function
DocType
Volume
ISSN
Conference
8139
0302-9743
Citations 
PageRank 
References 
1
0.37
18
Authors
3
Name
Order
Citations
PageRank
Viet Cuong Nguyen1213.03
Lam Si Tung Ho2184.96
Vu Dinh3265.14