arxiv
PublishedSeptember 2, 2026 at 4:00 AM
Logarithmic-Free Moment and Generalization Bounds for Uniformly Stable Algorithms
Publisher summary· verbatim
arXiv:2608.09870v2 Announce Type: replace-cross Abstract: Uniform stability is a classical tool for controlling the generalization error of a learning algorithm. Bousquet, Klochkov, and Zhivotovskiy (2020) showed that the problem can be reduced to a moment inequality for a sum of weakly interacting
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
The Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗