A Lower Bound for Agnostically Learning Disjunctions

DOI10.1007/978-3-540-72927-3_30zbMath1203.68158OpenAlexW1500625764MaRDI QIDQ5434065

Adam R. Klivans, Alexander A. Sherstov

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_30

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Approximate Degree in Classical and Quantum Computing ⋮ The unbounded-error communication complexity of symmetric functions ⋮ Dimension-free bounds and structural results in communication complexity ⋮ Learning Hurdles for Sleeping Experts

This page was built for publication: A Lower Bound for Agnostically Learning Disjunctions