Know a great AI tool or AI news source? Submit it to AiByts
2 min read

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.

Read on arXiv - stat.ML(opens in a new tab)

Comments

Sign in to join the discussion.

No comments yet — be the first to share your thoughts.