Preference-based alignment methods typically optimize against a single preference model, and can therefore be brittle when pairwise preferences are uncertain: noisy, heterogeneous, or shift after deployment. To address these issues, we propose Robust Nash Alignment, a game-theoretic framework for alignment to uncertain...
Shihab Ahmed, Debamita Ghosh, David Tang et al.· 0 citations
This work introduces the robust Multi-Agent Decoupling Coefficient (robust MADC) to characterize the intrinsic exploration complexity arising from strategic interactions and adversarial transition uncertainty, and establishes sublinear robust regret guarantees governed by the robust MADC rather than explicitly by the s...
Debamita Ghosh, George Atia, Yue Wang· 0 citations
Finite Bellman certificates are connected to undiscounted planning for state-dependent robust average rewards, providing theoretical understandings of finite Bellman solvability.
A constrained multi-objective post-training method for this setting was developed and validated, and it was verified that the method’s internal constraint-enforcement mechanism behaves as intended, applying negligible pressure while the requirement is easy to satisfy and increasing sharply as it becomes difficult to me...
C. Hill, Zain Ulabedeen Farhat, Yue Wang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.