arXiv Statistics ML By Qiaosen Wang, Chao Gao

Instance-Optimal Adaptive Location Estimation via Multiscale Mid-Summaries

Read the original on arXiv Statistics ML →

arXiv:2609. 20749v1 Announce Type: cross Abstract: Location estimation exhibits markedly different finite-sample behavior across noise distributions: regular families typically yield root-\(n\) rates, whereas compactly supported laws may admit faster, boundary-driven rates.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Statistics ML
Oct 1

Local polynomial density ratio estimation

arXiv:2609. 38412v1 Announce Type: cross Abstract: We propose a novel local-polynomial estimator of the ratio $r=f/g$ of two $d$-dimensional densities $f$ and $g$, from which independent samples are available.

By Hajo Holzmann, Alexander Meister
arXiv Machine Learning
Oct 22

Near Minimax Rate for Quantile Distributional Reinforcement Learning

The paper investigates quantile distributional policy evaluation by approximating the return distribution under a policy with a quantile Bellman fixed point. It constructs an estimator from an empirical Markov decision process and derives non‑asymptotic error bounds in Wasserstein distances, achieving root‑n rates that are independent of the quantile resolution for a wide range of Wasserstein orders. The authors also characterize the exact local asymptotic minimax risk and show that their estimator attains this optimal rate, while examining how the risk depends on resolution in simple state‑space examples.

By Zijie Cheng, Zhihua Zhang
arXiv Machine Learning
Nov 2

A Unified Framework for Probability Estimation of Data-Dependent Events

The paper introduces a unified framework for estimating the probability that an unknown distribution assigns to a data‑dependent event defined by a sample and a known mapping. It analyzes two classical estimators—the empirical plug‑in estimator and the leave‑one‑out (Good–Turing) estimator—showing how their errors relate to generalization gaps and stability under sample deletion. The framework is applied to error estimation for predictors that combine a base classifier with memorized exceptions, leading to new bounds based on VC dimension and mutual information for adaptive missing mass estimation.

By Vitaly Feldman, Satyen Kale, Vinod Raman, Kunal Talwar, Ambuj Tewari