An efficient black-box reduction from PQ to TDS learning for any Boolean concept class in the distribution-free setting implies hardness for TDS learning of halfspaces, while membership queries enable efficient PQ learning of halfspaces via iterative Forster transforms.
The Reverse Isoperimetric Problem for Gaussian Measure
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
d^{poly(ℓ/ε)} algorithms for exponential families under polynomial-approximable unknown truncation, including first results for arbitrary Gaussians; poly(d/ε) for halfspaces/rectangles.
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.