John Langford
- Dom98.Pedro Domingos. A process-oriented heuristic for model selection. In Machine Learning Proceedings of the Fifteenth International Conference, pages 127-135. Morgan Kaufmann Publishers, San Francisco, CA, 1998. Google Scholar
Digital Library
- Fre98.Yoav Freund. Self bounding learning algorithms. In Proceedings of the !!th Annual Conference on Computational Learning Theory, pages 247-258. ACM Press, New York, NY, 1998. Google ScholarDigital Library
- Kea93.Michael Kearns. Efficient noise-tolerant learnof the Twenty-FiSh Annual ACM Symposium on the Theory of Computing, pages 392--401. ACM Press, New York, NY, 1993. Google ScholarDigital Library
- McA98.David A. McAllester. Some PAC-Bayesian meorems. In rroceeamgs oj me i i m annuat Conference on Computational Learning Theory, pages 230-234. ACM Press, New York, NY, 1998. Google ScholarDigital Library
- Riv87.R.L. Rivest. Learning decision lists. Machine Learning, 2(3):229-246, 1987. Google ScholarDigital Library
- STBWA96.John Shawe-Taylor, Peter Bartlett, Robert work for structural risk minimization. In Proceedings of the 9th Annual Conference on Computational Learning Theory, pages 68-88. ACM Press, New York, NY, 1996. Google ScholarDigital Library
Index Terms
- Microchoice bounds and self bounding learning algorithms
Recommendations
Microchoice Bounds and Self Bounding Learning Algorithms
A major topic in machine learning is to determine good upper bounds on the true error rates of learned hypotheses based upon their empirical performance on training data. In this paper, we demonstrate new adaptive bounds designed for learning algorithms ...
A Microchoice Bound for Continuous-Space Classification Algorithms
Classifiers are often constructed iteratively by introducing changes sequentially to an initial classifier. Langford and Blum ( COLT'99: Proceedings of the 12th Annual Conference on Computational Learning Theory , 1999, San Mateo, CA: Morgan Kaufmann, ...
Bounding Average-Energy Games
Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures - Volume 10203We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound constraint on the ...
Comments