Aadirupa Saha
Aadirupa Saha
PhD student, Indian Institute of Science (IISc), Bangalore
Verified email at iisc.ac.in - Homepage
Title
Cited by
Cited by
Year
Consistent multiclass algorithms for complex performance measures
H Narasimhan, H Ramaswamy, A Saha, S Agarwal
International Conference on Machine Learning, 2398-2407, 2015
432015
Battle of Bandits.
A Saha, A Gopalan
UAI, 805-814, 2018
162018
PAC battling bandits in the plackett-luce model
A Saha, A Gopalan
Algorithmic Learning Theory, 700-737, 2019
112019
Combinatorial bandits with relative feedback
A Saha, A Gopalan
arXiv preprint arXiv:1903.00543, 2019
112019
Energy-balancing and lifetime enhancement of wireless sensor network with Archimedes spiral
S Halder, A Ghosal, A Saha, S DasBit
International conference on ubiquitous intelligence and computing, 420-434, 2011
92011
Active ranking with subset-wise preferences
A Saha, A Gopalan
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
62019
Ranking with features: Algorithm and a graph theoretic analysis
A Saha, A Rajkumar
arXiv preprint arXiv:1808.03857, 2018
62018
From PAC to instance-optimal sample complexity in the Plackett-Luce model
A Saha, A Gopalan
International Conference on Machine Learning, 8367-8376, 2020
42020
Regret minimisation in multinomial logit bandits
A Saha, A Gopalan
arXiv preprint arXiv:1903.00543, 2019
42019
Improved sleeping bandits with stochastic action sets and adversarial rewards
A Saha, P Gaillard, M Valko
International Conference on Machine Learning, 8357-8366, 2020
32020
Learning score systems for patient mortality prediction in intensive care units via orthogonal matching pursuit
A Saha, C Dewangan, H Narasimhan, S Sampath, S Agarwal
2014 13th International Conference on Machine Learning and Applications, 93-98, 2014
32014
Confidence-budget matching for sequential budgeted learning
Y Efroni, N Merlis, A Saha, S Mannor
arXiv preprint arXiv:2102.03400, 2021
22021
Best-item learning in random utility models with subset choices
A Saha, A Gopalan
International Conference on Artificial Intelligence and Statistics, 4281-4291, 2020
22020
Regret Minimization in Stochastic Contextual Dueling Bandits
A Saha, A Gopalan
arXiv preprint arXiv:2002.08583, 2020
22020
Online learning for structured loss spaces
S Barman, A Gopalan, A Saha
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
22018
Optimal Regret Algorithm for Pseudo-1d Bandit Convex Optimization
A Saha, N Natarajan, P Netrapalli, P Jain
arXiv preprint arXiv:2102.07387, 2021
12021
How many pairwise preferences do we need to rank a graph consistently?
A Saha, R Shivanna, C Bhattacharyya
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 4830-4837, 2019
12019
Energy Saving Replay Attack Prevention in Clustered Wireless Sensor Networks
A Ghosal, A Saha, SD Bit
Pacific-Asia Workshop on Intelligence and Security Informatics, 82-96, 2013
12013
Battle of Bandits: Online Learning from Subsetwise Preferences and Other Structured Feedback
A Saha
2021
Dueling Bandits with Adversarial Sleeping
A Saha, P Gaillard
arXiv preprint arXiv:2107.02274, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20