Haim Kaplan
23 papers · 2018–2026 · 6 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 ↓+9 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (40) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Gold π£ Hot Topic Early Bird
π¬
Deep Specialist
(12)
π€
Dynamic Duo
(19)
π
Renaissance Researcher
(6)
π₯
Unstoppable Β· Bronze
β
The Questioner
β‘
Prolific Year Β· Productive
π
Century Club Β· Bronze
π
Trend Setter
ποΈ
Keyword Collector
(106)
Top co-authors
Research topics
Machine Learning
(19)
Optimization & Theory
(13)
Application Areas
(12)
Mathematics & Optimization
(11)
Optimization
(9)
Security & Privacy
(7)
Artificial Intelligence
(6)
Differential Privacy
(6)
Learning Types
(6)
Core AI
(5)
Core Methods
(5)
Reinforcement Learning
(4)
Methods
(4)
Computer Science
(2)
Applications
(2)
Keywords
differential privacy
(12)
regret bound
(5)
sample complexity
(4)
online algorithm
(4)
online learning
(3)
streaming algorithm
(3)
k-means clustering
(2)
privacy-preserving learning
(2)
private learning
(2)
shuffle model
(2)
apprenticeship learning
(2)
pac learning
(2)
markov decision process
(2)
reinforcement learning
(2)
assignment problem
(1)
statistical learning theory
(1)
policy optimization
(1)
learning theory
(1)
hierarchical reinforcement learning
(1)
adversarial robustness
(1)
Papers
When Can Transformers Count to n?
UAI 2026
Nearly Optimal Sample Complexity for Learning with Label Proportions
ICML 2025
Learning-Augmented Algorithms with Explicit Predictors
NeurIPS 2024
Black-Box Differential Privacy for Interactive ML
NeurIPS 2023
Concurrent Shuffle Differential Privacy Under Continual Observation
ICML 2023
Differentially Private Approximate Quantiles
ICML 2022
FriendlyCore: Practical Differentially Private Aggregation
ICML 2022
Monotone Learning
COLT 2022
Differentially-Private Clustering of Easy Instances
ICML 2021
Differentially Private Multi-Armed Bandits in the Shuffle Model
NeurIPS 2021
Online Markov Decision Processes with Aggregate Bandit Feedback
COLT 2021
The Sparse Vector Technique, Revisited
COLT 2021
Adversarially Robust Streaming Algorithms via Differential Privacy
NeurIPS 2020
Apprenticeship Learning via Frank-Wolfe
AAAI 2020
Near-optimal Regret Bounds for Stochastic Shortest Path
ICML 2020
Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies
ALT 2020
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity
NeurIPS 2020
Privately Learning Thresholds: Closing the Exponential Gap
COLT 2020
Thompson Sampling for Adversarial Bit Prediction
ALT 2020
Unknown mixing times in apprenticeship and reinforcement learning
UAI 2020
Differentially Private Learning of Geometric Concepts
ICML 2019
Learning to Screen
NeurIPS 2019
Differentially Private k-Means with Constant Multiplicative Error
NeurIPS 2018