Inference-Time Nash Alignment
This work forms the problem as obtaining a Nash equilibrium of a two-player zero-sum game between policies, and proposes two algorithms: Best-of-Nash (BoN) and Nash Mirror Descent (NMD), which are proved to achieve a duality gap that matches the problem lower bound.
Hadi Hosseini, Debmalya Mandal, Duo-Han Zhang
· 0 citations