96 citations · 396 across the 27 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.GT2025
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…
cs.DS2025
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…
cs.LG2025
Sample-Optimal Agnostic Boosting with Unlabeled Data
Udaya Ghai, Karan Singh
Boosting provides a practical and provably effective framework for constructing accurate learning algorithms from inaccurate rules of thumb. It extends the promise of sample-effici…