Forster Decomposition and Learning Halfspaces with Noise
원문 초록
A Forster transform is an operation that turns a distribution into one with good anti-concentration properties. While a Forster transform does not always exist, we show that any distribution can be efficiently decomposed as a disjoint mixture of few distributions for which a Forster transform exists and can be computed efficiently. As the main application of this result, we obtain the first polynomial-time algorithm for distribution-independent PAC learning of halfspaces in the Massart noise model with strongly polynomial sample complexity, i.e., independent of the bit complexity of the examples. Previous algorithms for this learning problem incurred sample complexity scaling polynomially with the bit complexity, even though such a dependence is not information-theoretically necessary.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Lean Formalization of Generalization Error Bound by Rademacher Complexity
Prospective Learning: Learning for a Dynamic Future
Optimistic Rates for Learning from Label Proportions
Towards a theory of model distillation
SAT-Based PAC Learning of Description Logic Concepts
Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.