Learning Nested Halfspaces and Uphill Decision Trees

DOI10.1007/978-3-540-72927-3_28MaRDI QIDQ5434063zbMATH OpenOpenAlexFDO

Authors Adam Tauman Kalai

Publication date 3 January 2008

Published in Learning Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72927-3_28

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning Theory
• On the learnability of rich function classes
• Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
• On the complexity of function learning
• Fat-shattering and the learnability of real-valued functions

Cited in

(1)

• Improved approximation of linear threshold functions

This page was built for publication: Learning Nested Halfspaces and Uphill Decision Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434063)