no code implementations • 15 Jun 2021 • Allan Grønlund, Mikael Høgsgaard, Lior Kamma, Kasper Green Larsen
The framework is simple and powerful enough to extend the generalization bounds by Arora et al. to also hold for the original network.
no code implementations • NeurIPS 2020 • Allan Grønlund, Lior Kamma, Kasper Green Larsen
We then explain the short comings of the $k$'th margin bound and prove a stronger and more refined margin-based generalization bound for boosted classifiers that indeed succeeds in explaining the performance of modern gradient boosters.
no code implementations • ICML 2020 • Allan Grønlund, Lior Kamma, Kasper Green Larsen
Support Vector Machines (SVMs) are among the most fundamental tools for binary classification.
no code implementations • NeurIPS 2019 • Allan Grønlund, Lior Kamma, Kasper Green Larsen, Alexander Mathiasen, Jelani Nelson
To date, the strongest known generalization (upper bound) is the $k$th margin bound of Gao and Zhou (2013).
no code implementations • NeurIPS 2018 • Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen
We settle this question by giving tight asymptotic bounds on the exact tradeoff between the central parameters, thus providing a complete understanding of the performance of feature hashing.