On the complexity of function learning

DOI10.1007/BF00993410zbMath0831.68089MaRDI QIDQ1900975

Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger

Publication date: 29 October 1995

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

learning algorithmstheory of learning functions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Related Items (3)

Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning ⋮ A note on the price of bandit feedback for mistake-bounded online learning ⋮ New bounds on the price of bandit feedback for mistake-bounded online multiclass learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coping with errors in binary search procedures
• Ulam's searching game with a fixed number of lies
• Universal forecasting algorithms
• Lower bound methods and separation results for on-line learning models
• Composite geometric concepts and polynomial predictability
• Toward efficient agnostic learning
• On the density of families of sets
• Simulating access to hidden information while learning
• Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
• A Learning Theorem for Linear Operators
• Universal prediction of individual sequences

This page was built for publication: On the complexity of function learning