L¹ polynomial regression achieves Õ(n^{O(log(1/ε)/σ)}) for smoothed agnostic halfspace learning, with nearly matching SQ lower bound n^{Ω(log(1+σ/ε²)/σ)}.
Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC) , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Near-optimal SQ Lower Bound for Smoothed Agnostic Learning of Boolean Halfspaces
L¹ polynomial regression achieves Õ(n^{O(log(1/ε)/σ)}) for smoothed agnostic halfspace learning, with nearly matching SQ lower bound n^{Ω(log(1+σ/ε²)/σ)}.