Complexity of learning according to two models of a drifting environment

Machine Learning

Volumn 37, Issue 3, 1999, Pages 337-354

  Long, Philip M ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; THEOREM PROVING;

AGNOSTIC LEARNING; CONTEXT-SENSITIVE LEARNING;

LEARNING SYSTEMS;

EID: 0033281653     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007666507971     Document Type: Article

References (32)

1. Anthony, M. Biggs, N., & Shawe-Taylor, J. (1990). The learnability of formal concepts. Proceedings of the 1990 Workshop on Computational Learning Theory (pp. 246-257).
2. Auer P., & Warmuth, M.K. (1995). Tracking the best disjunction. Proceedings of the 36th Annual Symposium on the Foundations of Computer Science.
3. Bartlett, P.L. (1992). Learning with a slowly changing distribution. Proceedings of the 1992 Workshop on Computational Learning Theory (pp. 243-252).
4. Bartlett, P.L., Ben-David, S., & Kulkarni, S.R. (1996). Learning changing concepts by exploiting the structure of change. Proceedings of the 1996 Conference on Computational Learning Theory (pp. 131-139).
5. Bartlett, P.L., & Helmbold, D.P. (1995). Manuscript.
6. Barve, R.D., & Long, P.M. (1997). On the complexity of learning from drifting distributions. Information and Computation, 138(2), 101-123.
7. Blum, A., & Chalasani, P. (1992). Learning switching concepts. Proceedings of the Fifth Annual Workshop on Computational Learning Theory (pp. 231-242).
8. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.K. (1989). Learnability and the Vapnik-Chervonenkis dimension. JACM, 36(4), 929-965.
9. Freund, Y., & Mansour, Y. (1997). Learning under persistent drift. Proceedings of the 1997 European Conference on Computational Learning Theory.
10. Freund, Y., & Ron, D. (1995). Learning to mode sequences generated by switching distributions. Proceedings of the 1995 Conference on Computational Learning Theory (pp. 41-50).
11. Haussler, D. (1992). Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1), 78-150.
12. Haussler, D. (1995). Sphere packing numbers for subsets of the boolean n-cube with bounded Vapnik-Chervonenkis dimension. Journal of Combinatorial Theory, Series A, 69(2), 217-232.
13. Haussler, D., Littlestone, N., & Warmuth, M.K. (1994). Predicting {0, 1}-functions on randomly drawn points. Information and Computation, 115(2), 129-161.
14. Helmbold, D.P., & Long, P.M. (1994). Tracking drifting concepts by minimizing disagreements. Machine Learning, 14(1), 27-46.
15. Herbster, M., & Warmuth, M.K. (1995). Tracking the best expert. Proceedings of of the Twelvth International Conference on Machine Learning.
16. Herbster, M., & Warmuth, M.K. (1998). Tracking the best regressor. Proceedings of the 1998 Conference on Computational Learning Theory.
17. Kearns, M.J., Schapire, R.E., & Sellie, L.M. (1994). Toward efficient agnostic learning. Machine Learning, 17, 115-141.
18. Kolmogorov, A.N., & Tihomirov, V.M. (1961). ∈-entropy and ∈-capacity of sets in functional spaces. American Mathematical Society Translations (Ser. 2), 17, 277-364.
19. Kuh, A. (1997). Comparison of tracking algorithms for single layer threshold networks in the presence of random drift. IEEE Trans. on Signal Processing, 45(3), 640-650.
20. Kuh, A., Petsche, T., & Rivest, R. (1990). Learning time varying concepts In NIPS3. Morgan Kaufmann.
21. Kuh, A., Petsche, T., & Rivest, R. (1991). Mistake bounds of incremental learners when concepts drift with applications to feedforward networks. In NIPS4. Morgan Kaufmann.
22. Littlestone, N., & Warmuth, M.K. (1994). The weighted majority algorithm. Information and Computation, 108, 212-261.
23. Pollard, D. (1984). Convergence of Stochastic Processes. Springer Verlag.
24. Pollard, D. (1990). Empirical Processes: Theory and Applications, volume 2 of NSF-CBMS Regional Conference Series in Probability and Statistics. Institute of Math. Stat. and Am. Stat. Assoc.
25. Roy, S. (1991). Semantic complexity of relational queries and data independent data partitioning. Proceedings of the ACM SIGACT-SIGART-SIGMOD Annual Symposium on Principles of Database Systems.
26. Royden, H.L. (1963). Real Analysis. Macmillan.
27. Sauer, N. (1972). On the density of families of sets. J. Combinatorial Theory (A), 13, 145-147.
28. Shelah, S. (1972). A combinatorial problem; stability and order for models and theories in infinitary languages. Pacific J. Math., 41, 247-261.
29. Simon, H.U. (1996. General lower bounds on the number of examples needed for learning probabilistic concepts. Journal of Computer and System Sciences, 52(2), 239-254.
30. Talagrand, M. (1994). Sharper bounds for Gaussian and empirical processes. Annals of Probability, 22, 28-76.
31. Tian, X., & Kuh, A. (1997). Performance bounds for single layer threshold networks when tracking a drifting adversary. Neural Networks, 10(5), 897-906.
32. Vapnik, V.N., & Chervonenkis, A.Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2), 264-280