Nataly Brukhim
14 papers · 2018–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
π Cross-Pollinator (14) π Conference Polyglot (5) π Academic Marathon (7) π Renaissance Researcher (5) π Interdisciplinary Bridge
πΊοΈ
Taxonomy Completionist
(15)
π§
Keyword Pioneer
π£
Hot Topic Early Bird
π
Century Club
(14)
Conferences
NIPS (5)
COLT (4)
ALT (2)
ICML (2)
RSS (1)
Top co-authors
Keywords
online convex optimization
(3)
regret minimization
(2)
multiclass boosting
(2)
weak learner
(2)
weak learning
(2)
agnostic learning
(2)
ensemble learning
(2)
online boosting
(2)
pac learning
(2)
frank-wolfe method
(2)
supervised learning
(1)
multiclass classification
(1)
markov decision process
(1)
function approximation
(1)
interactive learning
(1)
instruction following
(1)
deep architecture
(1)
structured prediction
(1)
bandit feedback
(1)
oracle complexity
(1)
Papers
On the Hardness of Bandit Learning
COLT 2025
Of Dice and Games: A Theory of Generalized Boosting
COLT 2025
A Fine-grained Characterization of PAC Learnability
COLT 2025
Projection-free Adaptive Regret with Membership Oracles
ALT 2023
A Unified Model and Dimension for Interactive Estimation
NIPS 2023
Multiclass Boosting: Simple and Intuitive Weak Learning Criteria
NIPS 2023
Improper Multiclass Boosting
COLT 2023
A Boosting Approach to Reinforcement Learning
NIPS 2022
Online Boosting with Bandit Feedback
ALT 2021
Multiclass Boosting and the Cost of Weak Learning
NIPS 2021
Online Agnostic Boosting via Regret Minimization
NIPS 2020
Boosting for Control of Dynamical Systems
ICML 2020
Following High-level Navigation Instructions on a Simulated Quadcopter with Imitation Learning
RSS 2018
Predict and Constrain: Modeling Cardinality in Deep Structured Prediction
ICML 2018