On the complexity of function learning
From MaRDI portal
Publication:1900975
DOI10.1007/BF00993410zbMATH Open0831.68089MaRDI QIDQ1900975FDOQ1900975
Authors: Peter Auer, Philip M. Long, Wolfgang Maass, Gerhard J. Woeginger 
Publication date: 29 October 1995
Published in: Machine Learning (Search for Journal in Brave)
Recommendations
- On the learnability of rich function classes
- Bounds on the Number of Examples Needed for Learning Functions
- Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
- Improved bounds about on-line learning of smooth-functions of a single variable
- Improved bounds about on-line learning of smooth functions of a single variable
Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)
Cites Work
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- On the density of families of sets
- Coping with errors in binary search procedures
- Ulam's searching game with a fixed number of lies
- Composite geometric concepts and polynomial predictability
- Toward efficient agnostic learning
- Title not available (Why is that?)
- Universal prediction of individual sequences
- A Learning Theorem for Linear Operators
- Title not available (Why is that?)
- Lower bound methods and separation results for on-line learning models
- Universal forecasting algorithms
- Title not available (Why is that?)
- Simulating access to hidden information while learning
Cited In (9)
- Title not available (Why is that?)
- Maximal width learning of binary functions
- Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning
- Learning Behaviors of Functions
- 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
- Learning Nested Halfspaces and Uphill Decision Trees
- Learning-Related Complexity of Linear Ranking Functions
- Automatic functions, linear time and learning
This page was built for publication: On the complexity of function learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900975)
