Quadratic Sample Complexity for Strictly Replicable Realizable Learning with Unknown Marginals
Under the quantifier $\exists A\,\forall D$, where the realizable distribution and its marginal are unknown, we determine the finite-class sample-complexity exponent for strict replicability: two independent samples and one shared seed must produce identical functions.
By Guangjian ZhangarXiv - stat.ML
Read the full story
Originally published by arXiv - stat.ML on Oct 21, 2026.
Comments
Sign in to join the discussion.