Skip to content
conftrace_

Yuxin Chen

99 papers · 2013–2026 · 15 venues · across top CS/AI venues

This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 20 separate collaboration groups - the largest holds only 37% of them. Pick the group below that matches the researcher you mean. How a shared name is split.

Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.

Which Yuxin Chen?

8 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.

with Yuejie Chi, Gen Li, Yuting Wei 26 papers · 2013–2025 · NeurIPS, ICML, COLT Hide ▲
Anytime Acceleration of Gradient Descent COLT 2025 Minimax Optimal Regret Bound for Reinforcement Learning with Trajectory Feedback ICML 2025 Accelerating Convergence of Score-Based Diffusion Models, Provably ICML 2024 Federated Natural Policy Gradient and Actor Critic Methods for Multi-task Reinforcement Learning NeurIPS 2024 Horizon-Free Regret for Linear Markov Decision Processes ICLR 2024 Minimax-optimal reward-agnostic exploration in reinforcement learning COLT 2024 Optimal Multi-Distribution Learning COLT 2024 Settling the sample complexity of online reinforcement learning COLT 2024 Towards Non-Asymptotic Convergence for Diffusion-Based Generative Models ICLR 2024 Reward-agnostic Fine-tuning: Provable Statistical Benefits of Hybrid Reinforcement Learning NeurIPS 2023 The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model NeurIPS 2023 Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model NeurIPS 2022 Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity ICML 2022 Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning NeurIPS 2021 Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting NeurIPS 2021 Softmax Policy Gradient Methods Can Take Exponential Time to Converge COLT 2021 Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning ICML 2021 Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model NeurIPS 2020 Communication-Efficient Distributed Optimization in Networks with Gradient Tracking and Variance Reduction AISTATS 2020 Communication-Efficient Distributed Optimization in Networks with Gradient Tracking and Variance Reduction JMLR 2020 Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction NeurIPS 2020 Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality ICML 2020 Nonconvex Low-Rank Tensor Completion from Noisy Data NeurIPS 2019 Nonconvex Matrix Factorization from Rank-One Measurements AISTATS 2019 Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion ICML 2018 Spectral Compressed Sensing via Structured Matrix Completion ICML 2013
12 papers whose co-authors appear nowhere else under this name