Yanxi Chen

Orcid: 0000-0003-0610-8103

Affiliations:
  • Alibaba Group (since 2023)
  • Princeton University, Department of Electrical and Computer Engineering, Princeton, NJ, USA (2018-2023)
  • Tsinghua University, Beijing, China (2014-2018)


According to our database1, Yanxi Chen authored at least 24 papers between 2018 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
SeeUPO: Sequence-Level Agentic-RL with Convergence Guarantees.
CoRR, February, 2026

On the Entropy Dynamics in Reinforcement Fine-Tuning of Large Language Models.
CoRR, February, 2026

R<sup>3</sup>L: Reflect-then-Retry Reinforcement Learning with Language-Guided Exploration, Pivotal Credit, and Positive Amplification.
CoRR, January, 2026

2025
Group-Relative REINFORCE Is Secretly an Off-Policy Algorithm: Demystifying Some Myths About GRPO and Its Friends.
CoRR, September, 2025

On-Policy RL Meets Off-Policy Experts: Harmonizing Supervised Fine-Tuning and Reinforcement Learning via Dynamic Weighting.
CoRR, August, 2025

Trinity-RFT: A General-Purpose and Unified Framework for Reinforcement Fine-Tuning of Large Language Models.
CoRR, May, 2025

Enhancing Latent Computation in Transformers with Latent Tokens.
CoRR, May, 2025

Designing Algorithms Empowered by Language Models: An Analytical Framework, Case Studies, and Insights.
Trans. Mach. Learn. Res., 2025

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods.
SIAM J. Optim., 2025

Provable Scaling Laws for the Test-Time Compute of Large Language Models.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

2024
Differentially Private Sketch-and-Solve for Community Detection via Semidefinite Programming.
IEEE J. Sel. Areas Inf. Theory, 2024

A Simple and Provable Scaling Law for the Test-Time Compute of Large Language Models.
CoRR, 2024

On the Design and Analysis of LLM-Based Algorithms.
CoRR, 2024

Clustering Mixtures of Discrete Distributions: A Note on Mitra's Algorithm.
CoRR, 2024

EE-Tuning: An Economical yet Scalable Solution for Tuning Early-Exit Large Language Models.
CoRR, 2024

EE-LLM: Large-Scale Training and Inference of Early-Exit Large Language Models with 3D Parallelism.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Machine Learning and Optimization with Latent Variables.
PhD thesis, 2023

Ranking from Pairwise Comparisons in General Graphs and Graphs with Locality.
CoRR, 2023

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods.
CoRR, 2023

2022
Learning Mixtures of Linear Dynamical Systems.
Proceedings of the International Conference on Machine Learning, 2022

2021
Learning Mixtures of Low-Rank Models.
IEEE Trans. Inf. Theory, 2021

2018
Active Orthogonal Matching Pursuit for Sparse Subspace Clustering.
IEEE Signal Process. Lett., 2018

Subspace Change-Point Detection: A New Model and Solution.
IEEE J. Sel. Top. Signal Process., 2018

Change-Point Detection of Gaussian Graph Signals with Partial Information.
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018


  Loading...