d^{poly(ℓ/ε)} algorithms for exponential families under polynomial-approximable unknown truncation, including first results for arbitrary Gaussians; poly(d/ε) for halfspaces/rectangles.
[DGTZ18]) Σ−1/2 (bµ S − µ ) ≤ O log1/2 1 α , bΣS ⪰ Ω α2 · Σ, and Σ−1/2bΣSΣ−1/2 − I F ≤ O log 1 α
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.