关注
Nataly Brukhim
Nataly Brukhim
在 princeton.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Following high-level navigation instructions on a simulated quadcopter with imitation learning
V Blukis, N Brukhim, A Bennett, RA Knepper, Y Artzi
arXiv preprint arXiv:1806.00047, 2018
622018
A characterization of multiclass learnability
N Brukhim, D Carmon, I Dinur, S Moran, A Yehudayoff
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
44*2022
Boosting for control of dynamical systems
N Agarwal, N Brukhim, E Hazan, Z Lu
International Conference on Machine Learning, 96-103, 2020
19*2020
Projection-free adaptive regret with membership oracles
Z Lu, N Brukhim, P Gradu, E Hazan
International Conference on Algorithmic Learning Theory, 1055-1073, 2023
132023
Online boosting with bandit feedback
N Brukhim, E Hazan
Algorithmic Learning Theory, 397-420, 2021
112021
Online agnostic boosting via regret minimization
N Brukhim, X Chen, E Hazan, S Moran
Advances in Neural Information Processing Systems 33, 644-654, 2020
102020
Predict and constrain: Modeling cardinality in deep structured prediction
N Brukhim, A Globerson
International Conference on Machine Learning, 659-667, 2018
102018
A boosting approach to reinforcement learning
N Brukhim, E Hazan, K Singh
Advances in Neural Information Processing Systems 35, 33806-33817, 2022
82022
Multiclass boosting and the cost of weak learning
N Brukhim, E Hazan, S Moran, I Mukherjee, RE Schapire
Advances in Neural Information Processing Systems 34, 3057-3067, 2021
82021
Improper multiclass boosting
N Brukhim, S Hanneke, S Moran
The Thirty Sixth Annual Conference on Learning Theory, 5433-5452, 2023
32023
Multiclass boosting: simple and intuitive weak learning criteria
N Brukhim, A Daniely, Y Mansour, S Moran
Advances in Neural Information Processing Systems 36, 2024
12024
A unified model and dimension for interactive estimation
N Brukhim, M Dudik, A Pacchiano, RE Schapire
Advances in Neural Information Processing Systems 36, 64589-64617, 2023
2023
系统目前无法执行此操作,请稍后再试。
文章 1–12