Consistent multiclass algorithms for complex performance measures H Narasimhan, H Ramaswamy, A Saha, S Agarwal International Conference on Machine Learning, 2398-2407, 2015 | 70 | 2015 |
Battle of Bandits. A Saha, A Gopalan UAI, 805-814, 2018 | 46 | 2018 |
Dueling rl: reinforcement learning with trajectory preferences A Pacchiano, A Saha, J Lee arXiv preprint arXiv:2111.04850, 2021 | 41 | 2021 |
Combinatorial bandits with relative feedback A Saha, A Gopalan Advances in Neural Information Processing Systems 32, 2019 | 38 | 2019 |
PAC battling bandits in the plackett-luce model A Saha, A Gopalan Algorithmic Learning Theory, 700-737, 2019 | 35 | 2019 |
Efficient and optimal algorithms for contextual dueling bandits under realizability A Saha, A Krishnamurthy International Conference on Algorithmic Learning Theory, 968-994, 2022 | 29 | 2022 |
Active ranking with subset-wise preferences A Saha, A Gopalan The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 28 | 2019 |
Optimal Algorithms for Stochastic Contextual Preference Bandits A Saha Thirty-Fifth Annual Conference on Neural Information Processing Systems …, 2021 | 26 | 2021 |
Adversarial dueling bandits A Saha, T Koren, Y Mansour International Conference on Machine Learning, 9235-9244, 2021 | 22 | 2021 |
Improved sleeping bandits with stochastic action sets and adversarial rewards A Saha, P Gaillard, M Valko International Conference on Machine Learning, 8357-8366, 2020 | 20 | 2020 |
Dueling rl: Reinforcement learning with trajectory preferences A Saha, A Pacchiano, J Lee International Conference on Artificial Intelligence and Statistics, 6263-6289, 2023 | 19 | 2023 |
From PAC to instance-optimal sample complexity in the Plackett-Luce model A Saha, A Gopalan International Conference on Machine Learning, 8367-8376, 2020 | 19 | 2020 |
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 | 16 | 2022 |
Stochastic contextual dueling bandits under linear stochastic transitivity models V Bengs, A Saha, E Hüllermeier International Conference on Machine Learning, 1764-1786, 2022 | 15 | 2022 |
Best-item learning in random utility models with subset choices A Saha, A Gopalan International Conference on Artificial Intelligence and Statistics, 4281-4291, 2020 | 12 | 2020 |
Exploiting correlation to achieve faster learning rates in low-rank preference bandits A Saha, S Ghoshal International Conference on Artificial Intelligence and Statistics, 456-482, 2022 | 10 | 2022 |
Dueling convex optimization A Saha, T Koren, Y Mansour International Conference on Machine Learning, 9245-9254, 2021 | 9 | 2021 |
Confidence-budget matching for sequential budgeted learning Y Efroni, N Merlis, A Saha, S Mannor International Conference on Machine Learning, 2937-2947, 2021 | 9 | 2021 |
Energy-balancing and lifetime enhancement of wireless sensor network with Archimedes spiral S Halder, A Ghosal, A Saha, S DasBit Ubiquitous Intelligence and Computing: 8th International Conference, UIC …, 2011 | 9 | 2011 |
Distributed online and bandit convex optimization KK Patel, A Saha, L Wang, N Srebro OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop), 2022 | 7 | 2022 |