paper

Optimistic Rates for Multiclass PAC Learning

arXiv:2608.10869

Abstract

Worst-case multiclass bounds do not become smaller when the best classifier is already nearly correct: what is missing is an optimistic rate, a guarantee whose fluctuation scales with the oracle risk itself. For a class of Natarajan dimension and Daniely-Shalev-Shwartz dimension , the optimal excess risk is known at the two endpoints ( realizable, agnostic [HMZ24, CEH+26, Pab26]) and open in between. We close the gap: at every fixed oracle risk , the optimal excess risk is , uniformly in the alphabet size, attained by a learner that knows neither nor the confidence level. The upper bound composes the cover-menu-compression architecture of [CEH+26], at the realizable rate of [Pab26], with a new comparator-facing relative compression theorem: a size- compression rule that empirically dominates a comparator has population risk at most with , without stability; this transfers the comparison principle of the sharp binary theory [MQZ26] while discarding its Boolean-cube geometry, which does not lift to multiclass labels. The lower bound forces both terms using one class and one distribution at every fixed , by a pair-Assouad scheme calibrated to and a fiber argument on the pseudo-cubes underlying the Natarajan-versus-DS separation of [BCD+22]. Both theorems extend to list learning: against the best -tuple of hypotheses, the same architecture and the same two engines yield an optimistic rate and a lower bound of the same shape, forcing the fluctuation term that [Pab26] expected to be necessary against list comparators, and removing the factor from the known realizable list lower bound.

The main theorems are machine-checked in Lean 4; Section D records what is verified and in which form, and the development is available at https://github.com/xiaoyulics/multiclass-pac-learning

Optimistic Rates for Multiclass PAC Learning · wovepaper