| Achieving fairness in the stochastic multi-armed bandit problem V Patil, G Ghalme, V Nair, Y Narahari Journal of Machine Learning Research 22 (174), 1-31, 2021 | 132 | 2021 |
| Strategic classification in the dark G Ghalme, V Nair, I Eilat, I Talgam-Cohen, N Rosenfeld International Conference on Machine Learning, 3672-3681, 2021 | 54 | 2021 |
| Budgeted and Non-budgeted Causal Bandits V Nair, V Patil, G Sinha Proceedings of 24th International Conference on Artificial Intelligence and …, 2021 | 44 | 2021 |
| Separation between read-once oblivious algebraic branching programs (roabps) and multilinear depth-three circuits N Kayal, V Nair, C Saha ACM Transactions on Computation Theory (TOCT) 12 (1), 1-27, 2020 | 39* | 2020 |
| Reconstruction of full rank algebraic branching programs N Kayal, V Nair, C Saha, S Tavenas ACM Transactions on Computation Theory (TOCT) 11 (1), 1-56, 2018 | 27 | 2018 |
| A causal bandit approach to learning good atomic interventions in presence of unobserved confounders A Maiti, V Nair, G Sinha Uncertainty in Artificial Intelligence, 1328-1338, 2022 | 21* | 2022 |
| Sparse linear networks with a fixed butterfly structure: theory and practice N Ailon, O Leibovitch, V Nair Uncertainty in Artificial Intelligence, 1174-1184, 2021 | 19 | 2021 |
| Average-case linear matrix factorization and reconstruction of low width algebraic branching programs N Kayal, V Nair, C Saha computational complexity 28, 749-828, 2019 | 17 | 2019 |
| Long-term resource allocation fairness in average markov decision process (AMDP) environment G Ghalme, V Nair, V Patil, Y Zhou arXiv preprint arXiv:2102.07120, 2021 | 9* | 2021 |
| Robust planning over restless groups: engagement interventions for a large-scale maternal telehealth program JA Killian, A Biswas, L Xu, S Verma, V Nair, A Taneja, A Hegde, ... Proceedings of the AAAI Conference on Artificial Intelligence 37 (12), 14295 …, 2023 | 7 | 2023 |
| ADVISER: AI-Driven vaccination intervention optimiser for increasing vaccine uptake in Nigeria V Nair, K Prakash, M Wilbur, A Taneja, C Namblard, O Adeyemo, A Dubey, ... arXiv preprint arXiv:2204.13663, 2022 | 6 | 2022 |
| Strategic representation V Nair, G Ghalme, I Talgam-Cohen, N Rosenfeld International Conference on Machine Learning, 16331-16352, 2022 | 5 | 2022 |
| Stochastic multi-armed bandits with arm-specific fairness guarantees V Patil, G Ghalme, V Nair, Y Narahari arXiv preprint arXiv:1905.11260, 2019 | 4 | 2019 |
| Randomized polynomial-time equivalence between determinant and trace-imm equivalence tests J Murthy, V Nair, C Saha arXiv preprint arXiv:2006.08272, 2020 | 2 | 2020 |
| Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs C Ganesh, V Nair, A Sharma Cryptology ePrint Archive, 2024 | 1 | 2024 |
| Mitigating disparity while maximizing reward: tight anytime guarantee for improving bandits V Patil, V Nair, G Ghalme, A Khan arXiv preprint arXiv:2208.09254, 2022 | 1 | 2022 |
| An explicit sparse recovery scheme in the L1-norm A Bhattacharyya, V Nair arXiv preprint arXiv:1411.2344, 2014 | 1 | 2014 |
| Achieving Fairness in the Stochastic Multi-Armed Bandit Problem. V Patil, G Ghalme, V Nair, Y Narahari J. Mach. Learn. Res. 22, 174:1-174:31, 2021 | | 2021 |
| On Learning and Lower Bound Problems Related to the Iterated Matrix Multiplication Polynomial V Nair | | 2020 |
| Expanders in arithmetic circuit lower bound: Towards a separation between ROABPs and multilinear depth 3 circuits V Nair | | 2015 |
