Develops an adaptive interval-query 1-bit mean estimator with sample complexity Õ(σ²/ε² log(1/δ) + log(λ/σ)) that is (ε,δ)-PAC and near-optimal for bounded mean-variance distributions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
Develops an adaptive interval-query 1-bit mean estimator with sample complexity Õ(σ²/ε² log(1/δ) + log(λ/σ)) that is (ε,δ)-PAC and near-optimal for bounded mean-variance distributions.