96 citations · 396 across the 27 of their papers we have counts for
30 papers
Replicable Dueling Bandits
Rohan Deb, Aadirupa Saha, Udaya Ghai +2
Dueling bandits choose each comparison based on earlier noisy outcomes, so two runs on the same preferences can compare different pairs. We study replicable dueling bandits, where…
Learning to Price with Persuasion
Maria-Florina Balcan, Tejas Pagare, Karan Singh
Motivated by modern marketplaces, where the platform or the seller routinely gathers detailed user profiles, we study a novel learning theoretic model that simultaneously involves…
Replicable Bandits with UCB based Exploration
Rohan Deb, Udaya Ghai, Karan Singh +1
We study replicable algorithms for stochastic multi-armed bandits (MAB) and linear bandits with UCB (Upper Confidence Bound) based exploration. A bandit algorithm is -replicable…
Inverse Optimization Without Inverse Optimization: Direct Solution Prediction with Transformer Models
Macarena Navarro, Willem-Jan van Hoeve, Karan Singh
We present an end-to-end framework for generating solutions to combinatorial optimization problems with unknown components using transformer-based sequence-to-sequence neural netwo…
How to Sell High-Dimensional Data Optimally
Andrew Li, R. Ravi, Karan Singh +2
Motivated by the problem of selling large, proprietary data, we consider an information pricing problem proposed by Bergemann et al. that involves a decision-making buyer and a mon…
Faster Global Minimum Cut with Predictions
Benjamin Moseley, Helia Niaparast, Karan Singh
Global minimum cut is a fundamental combinatorial optimization problem with wide-ranging applications. Often in practice, these problems are solved repeatedly on families of simila…