PAC learning intersections of halfspaces with membership queries

DOI10.1007/PL00013834zbMath0910.68170OpenAlexW2070705993MaRDI QIDQ1271191

K. Appert

Publication date: 11 November 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00013834

zbMATH Keywords

POLLYrandomized learning algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (10)

Learning unions of high-dimensional boxes over the reals ⋮ A characterization of 2-threshold functions via pairs of prime segments ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Learning intersections and thresholds of halfspaces ⋮ The hardest halfspace ⋮ Optimal bounds for sign-representing the intersection of two halfspaces by polynomials ⋮ Cryptographic hardness for learning intersections of halfspaces ⋮ Unconditional lower bounds for learning intersections of halfspaces ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ On the limits of efficient teachability

This page was built for publication: PAC learning intersections of halfspaces with membership queries