← Search

Yuefeng Han

3 accepted papers

2026

Stability beyond bounded differences: sharp generalization bounds under finite $L_p$ moments

ICML 2026poster

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 unb…

Cited by 0SourceScholar