5 papers · 1 filter
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…
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…
Asymptotic Universal Alignment: A New Alignment Framework via Test-Time Scaling
Yang Cai, Weiqiang Zheng
Aligning large language models (LLMs) to serve users with heterogeneous and potentially conflicting preferences is a central challenge for personalized and trustworthy AI. We forma…
On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
Yang Cai, Gabriele Farina, Julien Grand-Clément +4
Non-ergodic convergence of learning dynamics in games is widely studied recently because of its importance in both theory and practice. Recent work (Cai et al., 2024) showed that a…
Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
Yang Cai, Haipeng Luo, Chen-Yu Wei +1
We study policy optimization algorithms for computing correlated equilibria in multi-player general-sum Markov Games. Previous results achieve convergence rate to a c…