Nataly Brukhim

Most-cited papers

A Characterization of Multiclass Learnability
Nataly Brukhim, Dan Carmon, Irit Dinur, S. Moran +1 more
2022IEEE Annual Symposium on Foundations of Computer Science96 citations Open access
Semantic Scholar
Following High-level Navigation Instructions on a Simulated Quadcopter with Imitation Learning
Valts Blukis, Nataly Brukhim, Andrew Bennett, Ross A. Knepper +1 more
2018Robotics: Science and Systems Conference67 citations Open access
Semantic Scholar
Projection-free Adaptive Regret with Membership Oracles
Zhou Lu, Nataly Brukhim, Paula Gradu, Elad Hazan
2022International Conference on Algorithmic Learning Theory18 citations Open access
Semantic Scholar
A Boosting Approach to Reinforcement Learning
Nataly Brukhim, Elad Hazan, Karan Singh
2021Neural Information Processing Systems16 citations Open access
Semantic Scholar
Multiclass Boosting and the Cost of Weak Learning
Nataly Brukhim, Elad Hazan, S. Moran, Indraneel Mukherjee +1 more
2021Neural Information Processing Systems16 citations
Semantic Scholar
Online Agnostic Boosting via Regret Minimization
Nataly Brukhim, Xinyi Chen, Elad Hazan, S. Moran
2020Neural Information Processing Systems16 citations
Semantic Scholar
Multiclass Boosting: Simple and Intuitive Weak Learning Criteria
Nataly Brukhim, Amit Daniely, Y. Mansour, S. Moran
2023Neural Information Processing Systems15 citations Open access
Semantic Scholar
Boosting for Control of Dynamical Systems
Naman Agarwal, Nataly Brukhim, Elad Hazan, Zhou Lu
2019International Conference on Machine Learning15 citations
Semantic Scholar
Improper Multiclass Boosting
Nataly Brukhim, Steve Hanneke, S. Moran
2023Annual Conference Computational Learning Theory10 citations
Semantic Scholar
Online Boosting with Bandit Feedback
Nataly Brukhim, Elad Hazan
2020International Conference on Algorithmic Learning Theory10 citations
Semantic Scholar
Predict and Constrain: Modeling Cardinality in Deep Structured Prediction
Nataly Brukhim, A. Globerson
2018International Conference on Machine Learning10 citations
Semantic Scholar
Boosting for Dynamical Systems
Naman Agarwal, Nataly Brukhim, Elad Hazan, Zhou Lu
2019arXiv.org6 citations
Semantic Scholar
On the Hardness of Bandit Learning
Nataly Brukhim, Aldo Pacchiano, Miroslav Dudík, Robert F. Schapire
2025Annual Conference Computational Learning Theory3 citations
Semantic Scholar
A Fine-grained Characterization of PAC Learnability
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito +3 more
2025Annual Conference Computational Learning Theory3 citations
Semantic Scholar
Of Dice and Games: A Theory of Generalized Boosting
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito +3 more
2024arXiv.org2 citations
Semantic Scholar
A Unified Model and Dimension for Interactive Estimation
Nataly Brukhim, Miroslav Dudík, Aldo Pacchiano, R. Schapire
2023Neural Information Processing Systems1 citations Open access
Semantic Scholar
Learning Conditional Averages
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito +3 more
2026Annual Conference Computational Learning Theory0 citations
Semantic Scholar
Lookahead identification in adversarial bandits: accuracy and memory bounds
Nataly Brukhim, Nicolò Cesa-Bianchi, C. Ciliberto
2026arXiv.org0 citations
Semantic Scholar
Of Dice and Games: A Theory of Generalized Boosting
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito +3 more
2025Annual Conference Computational Learning Theory0 citations
Semantic Scholar
A note on the distinct distances problem over finite fields
Nataly Brukhim, A. Bruner, O. Raz
2025arXiv.org0 citations
Semantic Scholar