1 citations · 1 across the 2 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2026
Efficient Online Inverse Optimization with Regret
Yang Cai, Anupam Gupta, Vineet Gupta +7
We give a deterministic algorithm for online inverse linear optimization with regret , uniform in the horizon and time per round. A bound of this order was obtaine…
cs.LG2026
A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using AI-Guided Evolutionary Search
Yang Cai, Vineet Gupta, Zun Li +1
The celebrated Myerson--Satterthwaite theorem shows that in bilateral trade, no mechanism can be simultaneously fully efficient, Bayesian incentive compatible (BIC), and budget bal…
cs.LG2023★ 1 cited
A Computationally Efficient Sparsified Online Newton Method
Fnu Devvrit, Sai Surya Duvvuri, Rohan Anil +3
Second-order methods hold significant promise for enhancing the convergence of deep neural network training; however, their large memory and computational demands have limited thei…