Kasper Green Larsen
24 papers · 2018–2026 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🗺️ Taxonomy Completionist (32) 🏃 Academic Marathon · Sprint 🌍 Conference Polyglot · Silver 🌉 Interdisciplinary Bridge · Bronze 🐣 Hot Topic Early Bird
🔬
Deep Specialist
(16)
🏆
Keyword Champion
(5)
⚡
Prolific Year · Productive
❓
The Questioner
🔥
Unstoppable · Bronze
🗃️
Keyword Collector
(76)
💎
Century Club · Bronze
Venues
Top co-authors
Research topics
Machine Learning
(22)
Optimization & Theory
(20)
Core Methods
(13)
Learning Types
(8)
Mathematics & Optimization
(7)
Optimization
(5)
Mathematics
(4)
Artificial Intelligence
(3)
Application Areas
(3)
Core AI
(2)
Computer Science
(1)
Data Science & Analytics
(1)
Deep Learning
(1)
Applications
(1)
Foundations
(1)
Keywords
sample complexity
(9)
generalization bound
(5)
boosting algorithm
(5)
weak learner
(5)
ensemble learning
(4)
majority vote
(4)
pac learning
(4)
ensemble method
(4)
learning theory
(3)
strong learner
(3)
dimensionality reduction
(3)
voting classifier
(2)
computational complexity
(2)
weak-to-strong learner
(2)
binary classification
(2)
sparse projection
(2)
margin theory
(2)
parallel computing
(2)
feature hashing
(2)
empirical risk minimization
(1)
Papers
Actively Learning Halfspaces without Synthetic Data
COLT 2026
Improved Replicable Boosting with Majority-of-Majorities
ALT 2026
Learning with Monotone Adversarial Corruptions
ALT 2026
Boosting, Voting Classifiers and Randomized Sample Compression Schemes
ALT 2025
Improved Margin Generalization Bounds for Voting Classifiers
COLT 2025
Bagging is an Optimal PAC Learner (Extended Abstract)
IJCAI 2024
Derandomizing Multi-Distribution Learning
NeurIPS 2024
Majority-of-Three: The Simplest Optimal Learner?
COLT 2024
Optimal Parallelization of Boosting
NeurIPS 2024
Replicable Learning of Large-Margin Halfspaces
ICML 2024
Sparse Dimensionality Reduction Revisited
ICML 2024
The Impossibility of Parallelizing Boosting
ALT 2024
The Many Faces of Optimal Weak-to-Strong Learning
NeurIPS 2024
AdaBoost is not an Optimal Weak to Strong Learner
ICML 2023
Bagging is an Optimal PAC Learner
COLT 2023
The Fast Johnson-Lindenstrauss Transform Is Even Faster
ICML 2023
Improved Coresets for Euclidean k-Means
NeurIPS 2022
Optimal Weak to Strong Learning
NeurIPS 2022
CountSketches, Feature Hashing and the Median of Three
ICML 2021
Margins are Insufficient for Explaining Gradient Boosting
NeurIPS 2020
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines
ICML 2020
Margin-Based Generalization Lower Bounds for Boosted Classifiers
NeurIPS 2019
Optimal Minimal Margin Maximization with Boosting
ICML 2019
Fully Understanding The Hashing Trick
NeurIPS 2018