Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
A guided tour of Chernoff bounds
Information Processing Letters
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning with a slowly changing distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Polynomial uniform convergence and polynomial-sample learnability
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Tracking Drifting Concepts By Minimizing Disagreements
Machine Learning - Special issue on computational learning theory
On the complexity of learning from drifting distributions
Information and Computation
The complexity of learning according to two models of a drifting environment
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning in Neural Networks: Theoretical Foundations
Learning in Neural Networks: Theoretical Foundations
Learning Under Persistent Drift
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics)
Mining time-changing data streams
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Neighborhood Property--Based Pattern Selection for Support Vector Machines
Neural Computation
Collaborative filtering on streaming data with interest-drifting
Intelligent Data Analysis - Knowlegde Discovery from Data Streams
Multi-agent System Approach to React to Sudden Environmental Changes
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
New analysis and algorithm for learning with drifting distributions
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Hi-index | 0.00 |
This paper examines learning problems in which the target function is allowed to change. The learner sees a sequence of random examples, labelled according to a sequence of functions, and must provide an accurate estimate of the target function sequence. We consider a variety of restrictions on how the target function is allowed to change, including infrequent but arbitrary changes, sequences that correspond to slow walks on a graph whose nodes are functions, and changes that are small on average, as measured by the probability of disagreements between consecutive functions. We first study estimation, in which the learner sees a batch of examples and is then required to give an accurate estimate of the function sequence. Our results provide bounds on the sample complexity and allowable drift rate for these problems. We also study prediction, in which the learner must produce online a hypothesis after each labelled example and the average misclassification probability over this hypothesis sequence should be small. Using a deterministic analysis in a general metric space setting, we provide a technique for constructing a successful prediction algorithm, given a successful estimation algorithm. This leads to sample complexity and drift rate bounds for the prediction of changing concepts.