On-line learning with linear loss constraints

Information and Computation

Volumn 161, Issue 2, 2000, Pages 140-171

  Helmbold, David P ^a   Littlestone, Nicholas ^b   Long, Philip M ^c  

^a University of California Santa Cruz   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; MATHEMATICAL MODELS;

LINEAR LOSS CONSTRAINTS;

LEARNING SYSTEMS;

EID: 0034666807     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2871     Document Type: Article

References (9)

1. Angluin, D. (1988), Queries and concept learning, Machine Learning 2, 319-342.
2. Barzdin, J. M., and Freivald, R. V. (1972), On the prediction of general recursive functions, Soviet Math. Dokl. 13, 1224-1228.
3. Goldman, S. A., Rivest, R. L., and Schapire, R. E. Learning binary relations and total orders, in "Proceedings, 30th Annual Symposium on the Foundations of Computer Science, 1989."
4. Helmbold, D. P., Littlestone, N., and Long, P. M. (2000), Apple tasting, Inform. and Comput. 161, 85-139, doi:10.1006/inco.2000.2870.
5. Littlestone, N. (1988), Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm, Machine Learning 2, 285-318.
6. Littlestone, N. (1989), "Mistake Bounds and Logarithmic Linear-Threshold Learning Algorithms," Ph.D. thesis UC, Santa Cruz.
7. Maass, W., and Turán, G. On the complexity of learning from counterexamples, in "Proceedings, 30th Annual Symposium on the Foundations of Computer Science, 1989."
8. Maass, W., and Turán, G. On the complexity of learning from counterexamples and membership queries, in "Proceedings, 31st Annual Symposium on the Foundations of Computer Science, 1990."
9. Vovk, V. (1990), Aggregating strategies, in "Proceedings, 3rd Workshop on Computational Learning Theory," pp. 371-383, Kaufmann, Los Altos, CA.