Learning Functions of Halfspaces
Josh Alman, Shyamal Patel, Rocco A. Servedio
2026年份
3被引次数
摘要
We give an algorithm that learns arbitrary Boolean functions of k arbitrary halfspaces over R n , in the challenging distribution-free Probably Approximately Correct (PAC) learning model, running in time 2 √ n•(log n) O(k) . This is the first algorithm that can PAC learn even intersections of two halfspaces in time 2 o(n) .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- Distribution-free Testing for Halfspaces (Almost) Requires PAC LearningXi Chen, Shyamal PatelSODA 2022 · 被引用 2 次
- DNF Learning via Locally Mixing Random WalksJosh Alman, Shivam Nadimpalli, Shyamal Patel, Rocco A. ServedioSTOC 2025
- A Mysterious Connection between Tolerant Junta Testing and Agnostically Learning ConjunctionsXi Chen, Shyamal Patel, Rocco A. ServedioSTOC 2026 · 被引用 4 次
- Hardness of learning DNFs using halfspacesSuprovat Ghoshal, Rishi SaketSTOC 2021
- Distribution-Free Testing of Decision Lists with a Sublinear Number of QueriesXi Chen, Yumou Fei, Shyamal PatelSTOC 2024
