d^{poly(ℓ/ε)} algorithms for exponential families under polynomial-approximable unknown truncation, including first results for arbitrary Gaussians; poly(d/ε) for halfspaces/rectangles.
New Results for Learning Noisy Parities and Halfspaces
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
d^{poly(ℓ/ε)} algorithms for exponential families under polynomial-approximable unknown truncation, including first results for arbitrary Gaussians; poly(d/ε) for halfspaces/rectangles.