Avrim Blum
41 papers · 2004–2026 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
π£ Hot Topic Early Bird π Interdisciplinary Bridge π§ Keyword Pioneer πΊοΈ Taxonomy Completionist (15) π Conference Polyglot (7)
π
Renaissance Researcher
(8)
π§
Keyword Pioneer
π£
Hot Topic Early Bird
π
Keyword Trendsetter Combo
(3)
π
Keyword Champion
π¬
Deep Specialist
(13)
ποΈ
Keyword Collector
(162)
π
Conference Pioneer
π
Trend Setter
π
Century Club
(39)
π₯
Unstoppable
(6)
β‘
Prolific Year
(5)
Conferences
NIPS (13)
COLT (9)
ALT (5)
AISTATS (4)
ICML (4)
JMLR (4)
AAAI (2)
Top co-authors
Research topics
Keywords
sample complexity
(6)
online learning
(5)
pac learning
(5)
active learning
(5)
adversarial learning
(5)
robust learning
(4)
game theory
(4)
adversarial robustness
(3)
adversarial attack
(3)
distributed learning
(3)
regret bound
(3)
poisoning attack
(3)
lifelong learning
(2)
multi-objective optimization
(2)
collaborative learning
(2)
semi-supervised learning
(2)
distance estimation
(2)
agnostic learning
(2)
data poisoning
(2)
empirical risk minimization
(2)
Papers
Regularized Robustly Reliable Learners
ALT 2026
A Theoretical Model for Grit in Pursuing Ambitious Ends
AAAI 2026
Proofs as Explanations: Short Certificates for Reliable Predictions
COLT 2025
A Model for Combinatorial Dictionary Learning and Inference
ALT 2025
Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
ALT 2025
PAC Learning with Improvements
ICML 2025
Distributional Adversarial Loss
AISTATS 2025
Agnostic Multi-Robust Learning using ERM
AISTATS 2024
On the Vulnerability of Fairness Constrained Learning to Malicious Noise
AISTATS 2024
Dueling Optimization with a Monotone Adversary
ALT 2024
An Analysis of Robustness of Non-Lipschitz Networks
JMLR 2023
Eliciting User Preferences for Personalized Multi-Objective Decision Making through Comparative Feedback
NIPS 2023
Strategic Classification under Unknown Personalized Manipulation
NIPS 2023
A Theory of PAC Learnability under Transformation Invariances
NIPS 2022
Robustly-reliable learners under poisoning attacks
COLT 2022
Boosting Barely Robust Learners: A New Perspective on Adversarial Robustness
NIPS 2022
Learning Complexity of Simulated Annealing
AISTATS 2021
Robust learning under clean-label attack
COLT 2021
Excess Capacity and Backdoor Poisoning
NIPS 2021
One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learning
ICML 2021
Communication-Aware Collaborative Learning
AAAI 2021
Online Learning with Primary and Secondary Losses
NIPS 2020
Active Local Learning
COLT 2020
Random Smoothing Might be Unable to Certify $\ell_\infty$ Robustness for High-Dimensional Images
JMLR 2020
Active Tolerant Testing
COLT 2018
On preserving non-discrimination when combining expert advice
NIPS 2018
Efficient PAC Learning from the Crowd
COLT 2017
Lifelong Learning in Costly Feature Spaces
ALT 2017
Collaborative PAC Learning
NIPS 2017
Efficient Co-Training of Linear Separators under Weak Dependence
COLT 2017
The Ladder: A Reliable Leaderboard for Machine Learning Competitions
ICML 2015
Efficient Representations for Lifelong Learning and Autoencoding
COLT 2015
Learning Optimal Commitment to Overcome Insecurity
NIPS 2014
Active Learning and Best-Response Dynamics
NIPS 2014
Learning Mixtures of Ranking Models
NIPS 2014
Exploiting Ontology Structures and Unlabeled Data for Learning
ICML 2013
Distributed Learning, Communication Complexity and Privacy
COLT 2012
Trading off Mistakes and Don't-Know Predictions
NIPS 2010
Tracking Dynamic Sources of Malicious Activity at Internet Scale
NIPS 2009
From External to Internal Regret
JMLR 2007
Preference Elicitation and Query Learning
JMLR 2004