Karthik Abinav Sankararaman

ORCID

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 58

Top Venues

University of Maryland, College Park, MD, USA (PHD)

Education History

University of Maryland, College Park, MD, USA

PHD

Publications

Wenhan Xiong, Jingyu Liu, Igor Molybog, Hejia Zhang, Prajjwal Bhargava, Rui Hou, Louis Martin, Rashi Rungta, Karthik Abinav Sankararaman, Barlas Oguz, Madian Khabsa, Han Fang, Yashar Mehdad, Sharan Narang, Kshitiz Malik, Angela Fan, Shruti Bhosale, Sergey Edunov, Mike Lewis, Sinong Wang, Hao Ma
Effective Long-Context Scaling of Foundation Models. NAACL-HLT (2024)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu, Yifan Xu
Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals. ACM Trans. Economics and Comput. 12 (2) (2024)
Wenhan Xiong, Jingyu Liu, Igor Molybog, Hejia Zhang, Prajjwal Bhargava, Rui Hou, Louis Martin, Rashi Rungta, Karthik Abinav Sankararaman, Barlas Oguz, Madian Khabsa, Han Fang, Yashar Mehdad, Sharan Narang, Kshitiz Malik, Angela Fan, Shruti Bhosale, Sergey Edunov, Mike Lewis, Sinong Wang, Hao Ma
Effective Long-Context Scaling of Foundation Models. CoRR (2023)
Duncan C. McElfresh, Christian Kroer, Sergey Pupyrev, Eric Sodomka, Karthik Abinav Sankararaman, Zack Chauvin, Neil Dexter, John P. Dickerson
Matching algorithms for blood donation. Nat. Mac. Intell. 5 (10) (2023)
Aleksandrs Slivkins, Karthik Abinav Sankararaman, Dylan J. Foster
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression. COLT (2023)
Fan Yao, Chuanhao Li, Karthik Abinav Sankararaman, Yiming Liao, Yan Zhu, Qifan Wang, Hongning Wang, Haifeng Xu
Rethinking Incentives in Recommender Systems: Are Monotone Rewards Always Beneficial? CoRR (2023)
Osnat Ackerman Viden, Yohai Trabelsi, Pan Xu, Karthik Abinav Sankararaman, Oleg Maksimov, Sarit Kraus
Allocation Problem in Remote Teleoperation: Online Matching with Offline Reusable Resources and Delayed Assignments. AAMAS (2023)
Xiaotian Han, Hanqing Zeng, Yu Chen, Shaoliang Nie, Jingzhou Liu, Kanika Narang, Zahra Shakeri, Karthik Abinav Sankararaman, Song Jiang, Madian Khabsa, Qifan Wang, Xia Hu
On the Equivalence of Graph Convolution and Mixup. CoRR (2023)
Fan Yao, Chuanhao Li, Karthik Abinav Sankararaman, Yiming Liao, Yan Zhu, Qifan Wang, Hongning Wang, Haifeng Xu
Rethinking Incentives in Recommender Systems: Are Monotone Rewards Always Beneficial? NeurIPS (2023)
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
Robust identifiability in linear structural equation models of causal inference. UAI (2022)
Sharmila V. S. Duppala, Karthik Abinav Sankararaman, Pan Xu
Online minimum matching with uniform metric and random arrivals. Oper. Res. Lett. 50 (1) (2022)
Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins
Adversarial Bandits with Knapsacks. J. ACM 69 (6) (2022)
Yifang Chen, Karthik Abinav Sankararaman, Alessandro Lazaric, Matteo Pirotta, Dmytro Karamshuk, Qifan Wang, Karishma Mandyam, Sinong Wang, Han Fang
Improved Adaptive Algorithm for Scalable Active Learning with Weak Labeler. CoRR (2022)
Karthik Abinav Sankararaman, Sinong Wang, Han Fang
BayesFormer: Transformer with Uncertainty Estimation. CoRR (2022)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources. ACM Trans. Economics and Comput. 9 (3) (2021)
Duncan C. McElfresh, Christian Kroer, Sergey Pupyrev, Eric Sodomka, Karthik Abinav Sankararaman, Zack Chauvin, Neil Dexter, John P. Dickerson
Matching Algorithms for Blood Donation. CoRR (2021)
Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman
(T) regret for decentralized bandits in matching markets. ICML (2021)
Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers
Stochastic bandits for multi-platform budget optimization in online advertising. WWW (2021)
Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman
Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship. AISTATS (2021)
Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising. CoRR (2021)
Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman
(T) Regret for Decentralized Bandits in Matching Markets. CoRR (2021)
Deeksha Sinha, Karthik Abinav Sankararaman, Abbas Kazerouni, Vashist Avadhanula
Multi-Armed Bandits with Cost Subsidy. AISTATS (2021)
Karthik Abinav Sankararaman, Aleksandrs Slivkins
Bandits with Knapsacks beyond the Worst Case. NeurIPS (2021)
Sharmila Duppala, Karthik Abinav Sankararaman, Pan Xu
Online minimum matching with uniform metric and random arrivals. CoRR (2021)
Karthik Abinav Sankararaman, Aleksandrs Slivkins
Advances in Bandits with Knapsacks. CoRR (2020)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts. Algorithmica 82 (1) (2020)
Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR (2020)
Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AAAI (2020)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Algorithms to Approximate Column-sparse Packing Problems. ACM Trans. Algorithms 16 (1) (2020)
Karthik Abinav Sankararaman, Soham De, Zheng Xu, W. Ronny Huang, Tom Goldstein
The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descent. ICML (2020)
Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman
Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation. CoRR (2020)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Online Stochastic Matching: New Algorithms and Bounds. Algorithmica 82 (10) (2020)
Duncan C. McElfresh, Christian Kroer, Sergey Pupyrev, Eric Sodomka, Karthik Abinav Sankararaman, Zack Chauvin, Neil Dexter, John P. Dickerson
Matching Algorithms for Blood Donation. EC (2020)
Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours. AIES (2020)
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
Robust Identifiability in Linear Structural Equation Models of Causal Inference. CoRR (2020)
John P. Dickerson, Karthik Abinav Sankararaman, Kanthi Kiran Sarpatwar, Aravind Srinivasan, Kun-Lung Wu, Pan Xu
Online Resource Allocation with Matching Constraints. AAMAS (2019)
Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins
Adversarial Bandits with Knapsacks. FOCS (2019)
Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu
Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare. WINE (2019)
Michael J. Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, Pan Xu
Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare. CoRR (2019)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. AAAI (2019)
Pan Xu, Yexuan Shi, Hao Cheng, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yongxin Tong, Leonidas Tsepenekas
A Unified Approach to Online Matching with Conflict-Aware Constraints. AAAI (2019)
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
Stability of Linear Structural Equation Models of Causal Inference. CoRR (2019)
Vedant Nanda, Pan Xu, Karthik Abinav Sankararaman, John P. Dickerson, Aravind Srinivasan
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours. CoRR (2019)
Karthik Abinav Sankararaman, Soham De, Zheng Xu, W. Ronny Huang, Tom Goldstein
The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descent. CoRR (2019)
Karthik Abinav Sankararaman, Anand Louis, Navin Goyal
Stability of Linear Structural Equation Models of Causal Inference. UAI (2019)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Algorithms to Approximate Column-Sparse Packing Problems. SODA (2018)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. AAMAS (2018)
Karthik Abinav Sankararaman, Aleksandrs Slivkins
Combinatorial Semi-Bandits with Knapsacks. AISTATS (2018)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources. AAAI (2018)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. CoRR (2018)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. CoRR (2018)
Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins
Adversarial Bandits with Knapsacks. CoRR (2018)
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources. CoRR (2017)
Karthik Abinav Sankararaman, Aleksandrs Slivkins
Semi-Bandits with Knapsacks. CoRR (2017)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. AAMAS (2017)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
Algorithms to Approximate Column-Sparse Packing Problems. CoRR (2017)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. ESA (2016)
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. CoRR (2016)
Yi-Chin Wu, Karthik Abinav Sankararaman, Stéphane Lafortune
Ensuring Privacy in Location-Based Services: An Approach Based on Opacity Enforcement. WODES (2014)

Karthik Abinav Sankararaman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Karthik Abinav Sankararaman