Zhenxing Ge

PhD student, Nanjing University

3 papers at NeurIPS 2025

Homepage· OpenReview· Semantic Scholar· Google Scholar

Poster Session 4

Thursday, December 4, 2025 · 4:30 PM → 7:30 PM

Last-Iterate Convergence of Smooth Regret Matching

^{+}

Variants in Learning Nash Equilibria

#3202 · Linjian Meng, Youzhi Zhang, Zhenxing Ge, Tianyu Ding, Shangdong Yang, Zheng Xu, Wenbin Li, Yang Gao

We investigate last-iterate convergence of Regret Matching$^+$ variants in games satisfying the weak Minty variation inequality.

Improving Reward Models with Proximal Policy Exploration for Preference-Based Reinforcement Learning

#409 · Yiwen Zhu, Jinyi Liu, Pengjie Gu, Yifu Yuan, Zhenxing Ge, Wenya Wei, Zhou Fang, Yujing Hu, Bo An

To enhance the reliability of the reward model for current policy improvement, we have developed the Proximal Policy Exploration (PPE) algorithm to increase the coverage of the preference buffer in areas close to the near-policy distribution.

Poster Session 5

1 paper

Friday, December 5, 2025 · 11:00 AM → 2:00 PM

Exhibit Hall C,D,E

Efficient Last-Iterate Convergence in Solving Extensive-Form Games

#2912 · Linjian Meng, Tianpei Yang, Youzhi Zhang, Zhenxing Ge, Shangdong Yang, Tianyu Ding, Wenbin Li, Bo An, Yang Gao

We present the first parameter-free last-iterate convergence of Counterfactual Regret Minimization algorithms.