Подписаться
Aadirupa Saha
Aadirupa Saha
Research Scientist, Apple ML Research, Cupertino
Подтвержден адрес электронной почты в домене ttic.edu - Главная страница
Название
Процитировано
Процитировано
Год
Consistent multiclass algorithms for complex performance measures
H Narasimhan, H Ramaswamy, A Saha, S Agarwal
International Conference on Machine Learning, 2398-2407, 2015
762015
Dueling rl: reinforcement learning with trajectory preferences
A Pacchiano, A Saha, J Lee
arXiv preprint arXiv:2111.04850, 2021
562021
Battle of Bandits.
A Saha, A Gopalan
UAI, 805-814, 2018
502018
Optimal Algorithms for Stochastic Contextual Preference Bandits
A Saha
Thirty-Fifth Annual Conference on Neural Information Processing Systems …, 2021
432021
Combinatorial bandits with relative feedback
A Saha, A Gopalan
Advances in Neural Information Processing Systems 32, 2019
432019
Efficient and optimal algorithms for contextual dueling bandits under realizability
A Saha, A Krishnamurthy
International Conference on Algorithmic Learning Theory, 968-994, 2022
412022
PAC battling bandits in the plackett-luce model
A Saha, A Gopalan
Algorithmic Learning Theory, 700-737, 2019
412019
Dueling rl: Reinforcement learning with trajectory preferences
A Saha, A Pacchiano, J Lee
International Conference on Artificial Intelligence and Statistics, 6263-6289, 2023
362023
Active ranking with subset-wise preferences
A Saha, A Gopalan
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
332019
Stochastic contextual dueling bandits under linear stochastic transitivity models
V Bengs, A Saha, E Hüllermeier
International Conference on Machine Learning, 1764-1786, 2022
272022
Adversarial dueling bandits
A Saha, T Koren, Y Mansour
International Conference on Machine Learning, 9235-9244, 2021
272021
Improved sleeping bandits with stochastic action sets and adversarial rewards
A Saha, P Gaillard, M Valko
International Conference on Machine Learning, 8357-8366, 2020
252020
Versatile dueling bandits: Best-of-both world analyses for learning from relative preferences
A Saha, P Gaillard
International Conference on Machine Learning, 19011-19026, 2022
232022
From PAC to instance-optimal sample complexity in the Plackett-Luce model
A Saha, A Gopalan
International Conference on Machine Learning, 8367-8376, 2020
202020
Dueling convex optimization
A Saha, T Koren, Y Mansour
International Conference on Machine Learning, 9245-9254, 2021
172021
Best-item learning in random utility models with subset choices
A Saha, A Gopalan
International Conference on Artificial Intelligence and Statistics, 4281-4291, 2020
142020
Distributed online and bandit convex optimization
KK Patel, A Saha, L Wang, N Srebro
OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop), 2022
122022
Federated online and bandit convex optimization
KK Patel, L Wang, A Saha, N Srebro
International Conference on Machine Learning, 27439-27460, 2023
102023
Exploiting correlation to achieve faster learning rates in low-rank preference bandits
S Ghoshal, A Saha
arXiv preprint arXiv:2202.11795, 2022
102022
Confidence-budget matching for sequential budgeted learning
Y Efroni, N Merlis, A Saha, S Mannor
International Conference on Machine Learning, 2937-2947, 2021
102021
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20