Nataly Brukhim
15 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 ↓+3 more ↓ Show less ↑
๐ฃ Hot Topic Early Bird ๐ Conference Polyglot ยท Silver ๐ Academic Marathon ยท Sprint ๐ Interdisciplinary Bridge ยท Bronze ๐บ๏ธ Taxonomy Completionist (22)
๐
Keyword Champion
(2)
๐๏ธ
Keyword Collector
(65)
๐
Century Club ยท Bronze
Venues
Top co-authors
Research topics
Keywords
online convex optimization
(3)
pac learning
(3)
sample complexity
(3)
agnostic learning
(2)
frank-wolfe method
(2)
regret minimization
(2)
ensemble learning
(2)
weak learning
(2)
multiclass boosting
(2)
weak learner
(2)
online boosting
(2)
function approximation
(1)
markov decision process
(1)
learnability
(1)
instruction following
(1)
structured prediction
(1)
interactive learning
(1)
cardinality constraint
(1)
multi-class classification
(1)
multi-label classification
(1)
Papers
Learning Conditional Averages
COLT 2026
A Fine-grained Characterization of PAC Learnability
COLT 2025
Of Dice and Games: A Theory of Generalized Boosting
COLT 2025
On the Hardness of Bandit Learning
COLT 2025
A Unified Model and Dimension for Interactive Estimation
NeurIPS 2023
Improper Multiclass Boosting
COLT 2023
Multiclass Boosting: Simple and Intuitive Weak Learning Criteria
NeurIPS 2023
Projection-free Adaptive Regret with Membership Oracles
ALT 2023
A Boosting Approach to Reinforcement Learning
NeurIPS 2022
Multiclass Boosting and the Cost of Weak Learning
NeurIPS 2021
Online Boosting with Bandit Feedback
ALT 2021
Boosting for Control of Dynamical Systems
ICML 2020
Online Agnostic Boosting via Regret Minimization
NeurIPS 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