Skip to content
Sagan

Paper

Stability beyond Bounded Differences: Sharp Generalization Bounds under Finite $L_p$ Moments

Unreadunread

AI summary

arXiv:2606. 06855v1 Announce Type: new Abstract: While algorithmic stability is a central tool for understanding generalization of learning algorithms, existing high-probability guarantees typically rely on uniform boundedness or sub-Gaussian/sub-Weibull tail assumptions, which can be overly restrictive for modern settings with heavy-tailed or unbounded losses.