default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarthik Abinav Sankararaman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Karthik Abinav Sankararaman:
Sequential Decision Making with Limited Resources. University of Maryland, College Park, MD, USA, 2019
Journal Articles
- 2024
- [j8]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): 6 (2024) - 2023
- [j7]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): 1108-1118 (2023) - 2022
- [j6]Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins:
Adversarial Bandits with Knapsacks. J. ACM 69(6): 40:1-40:47 (2022) - [j5]Sharmila V. S. Duppala, Karthik Abinav Sankararaman, Pan Xu:
Online minimum matching with uniform metric and random arrivals. Oper. Res. Lett. 50(1): 45-49 (2022) - 2021
- [j4]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): 13:1-13:17 (2021) - 2020
- [j3]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): 64-87 (2020) - [j2]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Online Stochastic Matching: New Algorithms and Bounds. Algorithmica 82(10): 2737-2783 (2020) - [j1]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-sparse Packing Problems. ACM Trans. Algorithms 16(1): 10:1-10:32 (2020)
Conference and Workshop Papers
- 2024
- [c28]Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation. ICML 2024 - [c27]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: 4643-4663 - 2023
- [c26]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: 513-521 - [c25]Aleksandrs Slivkins, Karthik Abinav Sankararaman, Dylan J. Foster:
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression. COLT 2023: 4633-4656 - [c24]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 - 2022
- [c23]Karthik Abinav Sankararaman, Anand Louis, Navin Goyal:
Robust identifiability in linear structural equation models of causal inference. UAI 2022: 1728-1737 - 2021
- [c22]Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman:
Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship. AISTATS 2021: 1252-1260 - [c21]Deeksha Sinha, Karthik Abinav Sankararaman, Abbas Kazerouni, Vashist Avadhanula:
Multi-Armed Bandits with Cost Subsidy. AISTATS 2021: 3016-3024 - [c20]Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman:
Beyond log2(T) regret for decentralized bandits in matching markets. ICML 2021: 705-715 - [c19]Karthik Abinav Sankararaman, Aleksandrs Slivkins:
Bandits with Knapsacks beyond the Worst Case. NeurIPS 2021: 23191-23204 - [c18]Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers:
Stochastic bandits for multi-platform budget optimization in online advertising. WWW 2021: 2805-2817 - 2020
- [c17]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: 2210-2217 - [c16]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: 131 - [c15]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: 8469-8479 - [c14]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: 463-464 - 2019
- [c13]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. AAAI 2019: 1877-1884 - [c12]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: 2221-2228 - [c11]John P. Dickerson, Karthik Abinav Sankararaman, Kanthi Kiran Sarpatwar, Aravind Srinivasan, Kun-Lung Wu, Pan Xu:
Online Resource Allocation with Matching Constraints. AAMAS 2019: 1681-1689 - [c10]Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins:
Adversarial Bandits with Knapsacks. FOCS 2019: 202-219 - [c9]Karthik Abinav Sankararaman, Anand Louis, Navin Goyal:
Stability of Linear Structural Equation Models of Causal Inference. UAI 2019: 323-333 - [c8]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: 129-141 - 2018
- [c7]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources. AAAI 2018: 1007-1014 - [c6]Karthik Abinav Sankararaman, Aleksandrs Slivkins:
Combinatorial Semi-Bandits with Knapsacks. AISTATS 2018: 1760-1770 - [c5]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: 318-326 - [c4]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-Sparse Packing Problems. SODA 2018: 311-330 - 2017
- [c3]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: 1223-1231 - 2016
- [c2]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. ESA 2016: 24:1-24:16 - 2014
- [c1]Yi-Chin Wu, Karthik Abinav Sankararaman, Stéphane Lafortune:
Ensuring Privacy in Location-Based Services: An Approach Based on Opacity Enforcement. WODES 2014: 33-38
Informal and Other Publications
- 2024
- [i25]Tengyu Xu, Eryk Helenowski, Karthik Abinav Sankararaman, Di Jin, Kaiyan Peng, Eric Han, Shaoliang Nie, Chen Zhu, Hejia Zhang, Wenxuan Zhou, Zhouhao Zeng, Yun He, Karishma Mandyam, Arya Talabzadeh, Madian Khabsa, Gabriel Cohen, Yuandong Tian, Hao Ma, Sinong Wang, Han Fang:
The Perfect Blend: Redefining RLHF with Mixture of Judges. CoRR abs/2409.20370 (2024) - 2023
- [i24]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 abs/2306.07893 (2023) - [i23]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 abs/2309.16039 (2023) - [i22]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 abs/2310.00183 (2023) - 2022
- [i21]Karthik Abinav Sankararaman, Sinong Wang, Han Fang:
BayesFormer: Transformer with Uncertainty Estimation. CoRR abs/2206.00826 (2022) - [i20]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 abs/2211.02233 (2022) - 2021
- [i19]Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman:
Beyond log2(T) Regret for Decentralized Bandits in Matching Markets. CoRR abs/2103.07501 (2021) - [i18]Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers:
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising. CoRR abs/2103.10246 (2021) - [i17]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 abs/2108.04862 (2021) - [i16]Sharmila Duppala, Karthik Abinav Sankararaman, Pan Xu:
Online minimum matching with uniform metric and random arrivals. CoRR abs/2112.05247 (2021) - 2020
- [i15]Karthik Abinav Sankararaman, Aleksandrs Slivkins:
Advances in Bandits with Knapsacks. CoRR abs/2002.00253 (2020) - [i14]Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman:
Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation. CoRR abs/2006.15166 (2020) - [i13]Karthik Abinav Sankararaman, Anand Louis, Navin Goyal:
Robust Identifiability in Linear Structural Equation Models of Causal Inference. CoRR abs/2007.06869 (2020) - [i12]Marek Adamczyk, Brian Brubach, Fabrizio Grandoni, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Improved Approximation Algorithms for Stochastic-Matching Problems. CoRR abs/2010.08142 (2020) - 2019
- [i11]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 abs/1904.06963 (2019) - [i10]Karthik Abinav Sankararaman, Anand Louis, Navin Goyal:
Stability of Linear Structural Equation Models of Causal Inference. CoRR abs/1905.06836 (2019) - [i9]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 abs/1912.00225 (2019) - [i8]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 abs/1912.08388 (2019) - 2018
- [i7]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts. CoRR abs/1804.08062 (2018) - [i6]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity. CoRR abs/1811.05100 (2018) - [i5]Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins:
Adversarial Bandits with Knapsacks. CoRR abs/1811.11881 (2018) - 2017
- [i4]Karthik Abinav Sankararaman, Aleksandrs Slivkins:
Semi-Bandits with Knapsacks. CoRR abs/1705.08110 (2017) - [i3]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-Sparse Packing Problems. CoRR abs/1711.02724 (2017) - [i2]John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources. CoRR abs/1711.08345 (2017) - 2016
- [i1]Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching. CoRR abs/1606.06395 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
