Karthik Abinav Sankararaman
15 papers · 2018–2025 · 8 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (23) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Bronze π£ Hot Topic Early Bird
π
Keyword Champion
(2)
π₯
Mega-Team Β· Squad
π
Conference Pioneer
β
The Questioner
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(67)
Top co-authors
Research topics
Machine Learning
(10)
Mathematics & Optimization
(9)
Optimization
(9)
Optimization & Theory Β· Machine Learning
(7)
Learning Types Β· Machine Learning
(5)
Artificial Intelligence
(3)
Core AI
(3)
Deep Learning
(2)
Natural Language Processing
(2)
Resources & Methods
(2)
Data Science & Analytics
(1)
Applications
(1)
Architectures
(1)
Learning Types Β· Deep Learning
(1)
Optimization & Theory Β· Deep Learning
(1)
Keywords
multi-armed bandit
(5)
regret bound
(4)
large language model
(3)
contextual bandit
(3)
lagrangian approach
(2)
online matching
(2)
packing constraint
(2)
decentralized algorithm
(2)
combinatorial optimization
(2)
covering constraint
(2)
online learning
(2)
regression oracle
(2)
knapsack problem
(2)
lagrangian relaxation
(2)
vanishing regret
(2)
resource allocation
(1)
batch normalization
(1)
linear programming
(1)
regret minimization
(1)
game theory
(1)
Papers
Learning Auxiliary Tasks Improves Reference-Free Hallucination Detection in Open-Domain Long-Form Generation
ACL 2025
Think Smarter not Harder: Adaptive Reasoning with Inference Aware Optimization
ICML 2025
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
JMLR 2024
Effective Long-Context Scaling of Foundation Models
NAACL 2024
Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation
ICML 2024
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
COLT 2023
Rethinking Incentives in Recommender Systems: Are Monotone Rewards Always Beneficial?
NeurIPS 2023
Bandits with Knapsacks beyond the Worst Case
NeurIPS 2021
Beyond $log^2(T)$ regret for decentralized bandits in matching markets
ICML 2021
Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship
AISTATS 2021
Multi-Armed Bandits with Cost Subsidy
AISTATS 2021
The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descent
ICML 2020
A Unified Approach to Online Matching with Conflict-Aware Constraints
AAAI 2019
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
AAAI 2019
Combinatorial Semi-Bandits with Knapsacks
AISTATS 2018