Effective long-context scaling of foundation models W Xiong, J Liu, I Molybog, H Zhang, P Bhargava, R Hou, L Martin, ...
arXiv preprint arXiv:2309.16039, 2023
191 2023 Allocation problems in ride-sharing platforms: Online matching with offline reusable resources JP Dickerson, KA Sankararaman, A Srinivasan, P Xu
ACM Transactions on Economics and Computation (TEAC) 9 (3), 1-17, 2021
167 2021 Adversarial bandits with knapsacks N Immorlica, K Sankararaman, R Schapire, A Slivkins
Journal of the ACM 69 (6), 1-47, 2022
139 2022 The impact of neural network overparameterization on gradient confusion and stochastic gradient descent KA Sankararaman, S De, Z Xu, WR Huang, T Goldstein
Thirty-seventh International Conference on Machine Learning (ICML), 2020
124 2020 New algorithms, better bounds, and a novel model for online stochastic matching B Brubach, KA Sankararaman, A Srinivasan, P Xu
24th Annual European Symposium on Algorithms (ESA 2016), 24: 1-24: 16, 2016
100 * 2016 Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours V Nanda, P Xu, KA Sankararaman, JP Dickerson, A Srinivasan
Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society, 2020
86 2020 Combinatorial semi-bandits with knapsacks KA Sankararaman, A Slivkins
International Conference on Artificial Intelligence and Statistics, 1760--1770, 2018
62 2018 Matching tasks and workers under known arrival distributions: Online task assignment with two-sided arrivals JP Dickerson, K Sankararaman, A Srinivasan, P Xu, Y Xu
ACM Transactions on Economics and Computation 12 (2), 1-28, 2024
59 * 2024 Dominate or delete: Decentralized competing bandits in serial dictatorship A Sankararaman, S Basu, KA Sankararaman
International Conference on Artificial Intelligence and Statistics, 1252-1260, 2021
56 * 2021 Beyond S Basu, KA Sankararaman, A Sankararaman
International Conference on Machine Learning, 705-715, 2021
52 2021 Stochastic bandits for multi-platform budget optimization in online advertising V Avadhanula, R Colini Baldeschi, S Leonardi, KA Sankararaman, ...
Proceedings of the Web Conference 2021, 2805-2817, 2021
48 2021 Ensuring privacy in location-based services: An approach based on opacity enforcement YC Wu, KA Sankararaman, S Lafortune
IFAC Proceedings Volumes 47 (2), 33-38, 2014
45 2014 Balancing relevance and diversity in online bipartite matching via submodularity JP Dickerson, KA Sankararaman, A Srinivasan, P Xu
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1877-1884, 2019
42 2019 Attenuate locally, win globally: Attenuation-based frameworks for online stochastic matching with timeouts B Brubach, KA Sankararaman, A Srinivasan, P Xu
Algorithmica 82, 64-87, 2020
33 2020 Online resource allocation with matching constraints J Dickerson, K Sankararaman, K Sarpatwar, A Srinivasan, KL Wu, P Xu
International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2019
32 2019 Contextual bandits with packing and covering constraints: A modular lagrangian approach via regression A Slivkins, KA Sankararaman, DJ Foster
The Thirty Sixth Annual Conference on Learning Theory, 4633-4656, 2023
28 * 2023 Matching algorithms for blood donation DC McElfresh, C Kroer, S Pupyrev, E Sodomka, KA Sankararaman, ...
Proceedings of the 21st ACM Conference on Economics and Computation, 463-464, 2020
25 2020 Bandits with knapsacks beyond the worst case KA Sankararaman, A Slivkins
Advances in Neural Information Processing Systems 34, 23191-23204, 2021
24 * 2021 Multi-armed bandits with cost subsidy D Sinha, KA Sankararaman, A Kazerouni, V Avadhanula
International Conference on Artificial Intelligence and Statistics, 3016-3024, 2021
22 2021 Bayesformer: Transformer with uncertainty estimation KA Sankararaman, S Wang, H Fang
arXiv preprint arXiv:2206.00826, 2022
19 2022 
Pan XuDepartment of Computer Science, New Jersey Institute of TechnologyEmail được xác minh tại njit.edu