Skip to content
conftrace_

Gen Li

64 papers · 2017–2026 · 13 venues · across top CS/AI venues

This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 21 separate collaboration groups - the largest holds only 31% 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 Gen Li?

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 Yuxin Chen, Yuejie Chi, Yuting Wei 20 papers · 2019–2025 · NeurIPS, ICML, ICLR Hide ▲
O(d/T) Convergence Theory for Diffusion Probabilistic Models under Minimal Assumptions ICLR 2025 O(d/T) Convergence Theory for Diffusion Probabilistic Models under Minimal Assumptions JMLR 2025 Towards a mathematical theory for consistency training in diffusion models AISTATS 2025 Accelerating Convergence of Score-Based Diffusion Models, Provably ICML 2024 Adapting to Unknown Low-Dimensional Structures in Score-Based Diffusion Models NeurIPS 2024 Minimax-optimal reward-agnostic exploration in reinforcement learning COLT 2024 Towards Non-Asymptotic Convergence for Diffusion-Based Generative Models ICLR 2024 Unleashing the Denoising Capability of Diffusion Prior for Solving Inverse Problems NeurIPS 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 Theory of Spectral Method for Union of Subspaces-Based Random Geometry Graph ICML 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 Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction NeurIPS 2020 Nonconvex Low-Rank Tensor Completion from Noisy Data NeurIPS 2019
13 papers whose co-authors appear nowhere else under this name