Fast Learning Beyond Finite Variance: Fractional Bernstein Geometry under Heavy-Tailed Losses
Abstract
Classical fast-rate theory typically relies on second-moment or related Bernstein-type control. We ask whether fast rates remain possible when variance does not exist. For finite classes, we introduce a fractional Bernstein condition for centered relative losses. An observable median-of-means pairwise selector achieves and a matching minimax lower bound shows that this interpolation law is sharp up to constants. We derive the fractional Bernstein geometry from primitive increment regularity and polynomial risk growth; in particular, Lipschitz increments and quadratic growth yield and the exponent . We then show that this regime arises in vector quantization genuinely below finite variance. Relative squared losses require only a first moment, and therefore remain well defined in regimes where every absolute population distortion is infinite. A weighted Voronoi margin condition yields local quadratic relative-risk growth without requiring a second moment. For a symmetric two-component Student-\(t\) family, we prove the explicit separation law Hence, sufficient separation yields local finite-dictionary relative quantization at rate despite .
Then back it, or bet against it.
Related papers
Open the market on this paper to see 7 more related papers.