Robert E. Schapire
36 papers · 2000–2026 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+14 more ↓ Show less ↑
π§ Keyword Pioneer πΊοΈ Taxonomy Completionist (16) π Interdisciplinary Bridge π Renaissance Researcher (5) π£ Hot Topic Early Bird
π
Interdisciplinary Bridge
π
Academic Marathon
(24)
πΊοΈ
Taxonomy Completionist
(16)
π
Keyword Trendsetter Combo
(5)
π¬
Deep Specialist
(14)
π±
Topic Pioneer
π
Keyword Champion
(3)
π
Century Club
(35)
ποΈ
Keyword Collector
(50)
π
Trend Setter
π₯
Unstoppable
(16)
π
Conference Pioneer
β‘
Prolific Year
(5)
β
The Questioner
Conferences
NIPS (15)
COLT (8)
JMLR (7)
ALT (3)
ICML (2)
IJCAI (1)
Top co-authors
Keywords
regret bound
(10)
online learning
(7)
multiclass classification
(5)
contextual bandit
(4)
reinforcement learning
(4)
boosting algorithm
(4)
classification
(3)
ensemble learning
(3)
weak learner
(3)
pac learning
(3)
weak classifier
(3)
game theory
(3)
multi-armed bandit
(3)
imitation learning
(2)
exponential loss
(2)
binary classification
(2)
apprenticeship learning
(2)
interactive learning
(2)
convergence analysis
(2)
agnostic learning
(2)
Papers
Multi-distribution Learning: From Worst-Case Optimality to Lexicographic Min-Max Optimality
ALT 2026
Provable Interactive Learning with Hindsight Instruction Feedback
ICML 2024
A Unified Model and Dimension for Interactive Estimation
NIPS 2023
Provably sample-efficient RL with side information about latent dynamics
NIPS 2022
Multiclass Boosting and the Cost of Weak Learning
NIPS 2021
Bayesian decision-making under misspecified priors with applications to meta-learning
NIPS 2021
Gradient descent follows the regularization path for general losses
COLT 2020
Interactive Learning of a Dynamic Structure
ALT 2020
Reinforcement Learning with Convex Constraints
NIPS 2019
Robust Inference for Multiclass Classification
ALT 2018
On Oracle-Efficient PAC RL with Rich Observations
NIPS 2018
Contextual Decision Processes with low Bellman rank are PAC-Learnable
ICML 2017
Corralling a Band of Bandit Algorithms
COLT 2017
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
NIPS 2016
Instance-dependent Regret Bounds for Dueling Bandits
COLT 2016
Contextual Dueling Bandits
COLT 2015
Achieving All with No Parameters: AdaNormalHedge
COLT 2015
Fast Convergence of Regularized Learning in Games
NIPS 2015
Efficient and Parsimonious Agnostic Active Learning
NIPS 2015
Collaborative Place Models
IJCAI 2015
Robust Multi-objective Learning with Mentor Feedback
COLT 2014
A Drifting-Games Analysis for Online Learning and Applications to Boosting
NIPS 2014
The Rate of Convergence of AdaBoost
JMLR 2013
A Theory of Multiclass Boosting
JMLR 2013
Open Problem: Does AdaBoost Always Cycle?
COLT 2012
The Rate of Convergence of Adaboost
COLT 2011
A Reduction from Apprenticeship Learning to Classification
NIPS 2010
Non-Stochastic Bandit Slate Problems
NIPS 2010
A Theory of Multiclass Boosting
NIPS 2010
Margin-based Ranking and an Equivalence between AdaBoost and RankBoost
JMLR 2009
FilterBoost: Regression and Classification on Large Datasets
NIPS 2007
Maximum Entropy Density Estimation with Generalized Regularization and an Application to Species Distribution Modeling
JMLR 2007
A Game-Theoretic Approach to Apprenticeship Learning
NIPS 2007
The Dynamics of AdaBoost: Cyclic Behavior and Convergence of Margins
JMLR 2004
An Efficient Boosting Algorithm for Combining Preferences
JMLR 2003
Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers
JMLR 2000