27-Year-Old Open Problem Closed: Sharp SVM Margin-Based Generalization Bound Proven
LucaAmb · x · 2026-09-16
Researchers @aryehazan and Steve Hanneke, with the help of an AI assistant, announce they have resolved the sharp realizable margin-based generalization bound for SVMs, an open problem since the 1998 Shawe-Taylor/Bartlett/Williamson/Anthony bound that carried extra log factors.
- The authors had a false start in their 2020 ALT paper, which this result makes up for
- Paper link shared in the follow-up comment
More from Research
- Memory layer cuts agent context tokens 23-62x and beats full history on 90-day recall — No_Advertising2536 · 2026-09-16
- Mathematician satirizes AI benchmarks: 'we never solved problems for benchmarks' — RexDouglass · 2026-09-16
- Japan's crowdsourced Minna de Honkoku OCR upgrades to v19 with better kanbun recognition — tkasasagi · 2026-09-16
- Reddit essay: LLMs just blur information like a weighted sum — and AGI isn't here — Helpful-Series132 · 2026-09-16
- Jev programming likened to MapReduce for decisions: parallel, mutually unaware queries — cocktailpeanut · 2026-09-16
- CMU's Decoy Direction Optimization blocks refusal-ablation attacks at 30-450x lower cost — CarnegieMellonU · 2026-09-16