🤖 AI Summary
This paper investigates the optimality of the empirical mean estimator (EME) within the Local Glivenko–Cantelli (LGC) framework: Can any estimator outperform EME—either by learning broader classes of probability distributions or achieving faster risk decay rates? Leveraging distribution-dependent uniform convergence analysis, minimax risk theory, geometric characterization of measure spaces, and empirical process theory, we establish, for the first time, that EME is minimax optimal under reasonable constraints excluding pathological infinite-dimensional structures. We prove that expanding the learnable distribution class and accelerating convergence rates are fundamentally incompatible objectives. We derive necessary and sufficient conditions for strictly enlarging the class of learnable measures. Furthermore, we construct tight risk upper bounds and explicit counterexamples, systematically characterizing how pathological geometric structures decisively determine the boundary of learnability.
📝 Abstract
We revisit the recently introduced Local Glivenko-Cantelli setting, which studies distribution-dependent uniform convergence rates of the Empirical Mean Estimator (EME). In this work, we investigate generalizations of this setting where arbitrary estimators are allowed rather than just the EME. Can a strictly larger class of measures be learned? Can better risk decay rates be obtained? We provide exhaustive answers to these questions, which are both negative, provided the learner is barred from exploiting some infinite-dimensional pathologies. On the other hand, allowing such exploits does lead to a strictly larger class of learnable measures.