:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, Shulun, Zhou, Runlong, Zhang, Zihan, Fazel, Maryam, Du, Simon S.
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2512.24818
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extragradient Preference Optimization (EGPO): Beyond Last-Iterate Convergence for Nash Learning from Human Feedback
by: Zhou, Runlong, et al.
Published: (2025)

Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs
by: Chen, Shulun, et al.
Published: (2025)

Understanding the Performance Gap in Preference Learning: A Dichotomy of RLHF and DPO
by: Shi, Ruizhe, et al.
Published: (2025)

Hybrid Preference Optimization for Alignment: Provably Faster Convergence Rates by Combining Offline Preferences with Online Exploration
by: Bose, Avinandan, et al.
Published: (2024)

Global Convergence of Gradient EM for Over-Parameterized Gaussian Mixtures
by: Zhou, Mo, et al.
Published: (2025)

Toward Global Convergence of Gradient EM for Over-Parameterized Gaussian Mixture Models
by: Xu, Weihang, et al.
Published: (2024)

On the Convergence of Policy in Unregularized Policy Mirror Descent
by: Lin, Dachao, et al.
Published: (2022)

Convergence Dynamics of Over-Parameterized Score Matching for a Single Gaussian
by: Zhang, Yiran, et al.
Published: (2025)

Learning Optimal Tax Design in Nonatomic Congestion Games
by: Cui, Qiwen, et al.
Published: (2024)

The Crucial Role of Samplers in Online Direct Preference Optimization
by: Shi, Ruizhe, et al.
Published: (2024)

Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions
by: Hait, Soumita, et al.
Published: (2026)

Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion
by: Ma, Jianhao, et al.
Published: (2024)

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback
by: Fiegel, Côme, et al.
Published: (2026)

Global Convergence of Four-Layer Matrix Factorization under Random Initialization
by: Luo, Minrui, et al.
Published: (2025)

Offline Multi-task Transfer RL with Representational Penalization
by: Bose, Avinandan, et al.
Published: (2024)

Two-Player Zero-Sum Games with Bandit Feedback
by: Yılmaz, Elif, et al.
Published: (2025)

Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity and Last-Iterate Convergence
by: Wu, Jiduan, et al.
Published: (2023)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
by: Chen, Zaiwei, et al.
Published: (2024)

Reflect-RL: Two-Player Online RL Fine-Tuning for LMs
by: Zhou, Runlong, et al.
Published: (2024)

On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
by: Maynard-Zhang, Leo, et al.
Published: (2026)

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
by: Ouhamma, Reda, et al.
Published: (2023)

Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback
by: Narang, Adhyyan, et al.
Published: (2022)

Preference-Based Multi-Agent Reinforcement Learning: Data Coverage and Algorithmic Techniques
by: Zhang, Natalia, et al.
Published: (2024)

Horizon-Free Regret for Linear Markov Decision Processes
by: Zhang, Zihan, et al.
Published: (2024)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

A/B Testing and Best-arm Identification for Linear Bandits with Robustness to Non-stationarity
by: Xiong, Zhihan, et al.
Published: (2023)

Software Fairness Dilemma: Is Bias Mitigation a Zero-Sum Game?
by: Chen, Zhenpeng, et al.
Published: (2025)

High-dimensional Limit of SGD for Diagonal Linear Networks
by: Malaxechebarría, Begoña García, et al.
Published: (2026)

ZeroS: Zero-Sum Linear Attention for Efficient Transformers
by: Lu, Jiecheng, et al.
Published: (2026)

Offline congestion games: How feedback type affects data coverage requirement
by: Jiang, Haozhe, et al.
Published: (2022)

Unregularized limit of stochastic gradient method for Wasserstein distributionally robust optimization
by: Le, Tam
Published: (2025)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

Transformers are Efficient Compilers, Provably
by: Zhai, Xiyu, et al.
Published: (2024)

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
by: Maiti, Arnab, et al.
Published: (2023)

Linear Convergence in Games with Delayed Feedback via Extra Prediction
by: Fujimoto, Yuma, et al.
Published: (2026)

Dual Approximation Policy Optimization
by: Xiong, Zhihan, et al.
Published: (2024)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
by: Choi, Sunmook, et al.
Published: (2025)

A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning
by: Jiang, Haozhe, et al.
Published: (2023)

Understanding Dynamics of Adam in Zero-Sum Games: An ODE Approach
by: Feng, Yi, et al.
Published: (2026)

Bayesian Learning in Episodic Zero-Sum Games
by: Yueh, Chang-Wei, et al.
Published: (2026)