Karthik Abinav Sankararaman

Orcid: 0000-0002-8569-5694

According to our database1, Karthik Abinav Sankararaman authored at least 38 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Matching algorithms for blood donation.
Nat. Mac. Intell., October, 2023

On the Equivalence of Graph Convolution and Mixup.
CoRR, 2023

Effective Long-Context Scaling of Foundation Models.
CoRR, 2023

Rethinking Incentives in Recommender Systems: Are Monotone Rewards Always Beneficial?
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Allocation Problem in Remote Teleoperation: Online Matching with Offline Reusable Resources and Delayed Assignments.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
Online minimum matching with uniform metric and random arrivals.
Oper. Res. Lett., 2022

Adversarial Bandits with Knapsacks.
J. ACM, 2022

Improved Adaptive Algorithm for Scalable Active Learning with Weak Labeler.
CoRR, 2022

BayesFormer: Transformer with Uncertainty Estimation.
CoRR, 2022

Robust identifiability in linear structural equation models of causal inference.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

2021
Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources.
ACM Trans. Economics and Comput., 2021

Stochastic bandits for multi-platform budget optimization in online advertising.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Bandits with Knapsacks beyond the Worst Case.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Beyond log<sup>2</sup>(T) regret for decentralized bandits in matching markets.
Proceedings of the 38th International Conference on Machine Learning, 2021

Multi-Armed Bandits with Cost Subsidy.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Algorithms to Approximate Column-sparse Packing Problems.
ACM Trans. Algorithms, 2020

Improved Approximation Algorithms for Stochastic-Matching Problems.
CoRR, 2020

Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation.
CoRR, 2020

Advances in Bandits with Knapsacks.
CoRR, 2020

Online Stochastic Matching: New Algorithms and Bounds.
Algorithmica, 2020

Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts.
Algorithmica, 2020

The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descent.
Proceedings of the 37th International Conference on Machine Learning, 2020

Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Sequential Decision Making with Limited Resources.
PhD thesis, 2019

Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare.
CoRR, 2019

Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Stability of Linear Structural Equation Models of Causal Inference.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Online Resource Allocation with Matching Constraints.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

A Unified Approach to Online Matching with Conflict-Aware Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Combinatorial Semi-Bandits with Knapsacks.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Semi-Bandits with Knapsacks.
CoRR, 2017

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2014
Ensuring Privacy in Location-Based Services: An Approach Based on Opacity Enforcement.
Proceedings of the 12th International Workshop on Discrete Event Systems, 2014


  Loading...