Yuantao Gu
14 papers · 2020–2026 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (26) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver β‘ Prolific Year Β· Productive
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(76)
Top co-authors
Research topics
Keywords
sample complexity
(4)
reinforcement learning
(3)
markov decision process
(3)
generative model
(3)
variance reduction
(2)
gradient descent
(2)
diffusion model
(2)
policy optimization
(1)
image generation
(1)
multi-agent reinforcement learning
(1)
graph theory
(1)
function approximation
(1)
sampling strategy
(1)
text-to-image synthesis
(1)
policy gradient
(1)
principal component analysis
(1)
temporal difference learning
(1)
communication complexity
(1)
distributed learning
(1)
minimax optimality
(1)
Papers
A-FloPS: Accelerating Diffusion Models via Adaptive Flow Path Sampler
AAAI 2026
Angle Domain Guidance: Latent Diffusion Requires Rotation Rather Than Extrapolation
ICML 2025
Unleashing the Denoising Capability of Diffusion Prior for Solving Inverse Problems
NeurIPS 2024
Benign overfitting of non-smooth neural networks beyond lazy training
AISTATS 2023
Incremental Aggregated Riemannian Gradient Method for Distributed PCA
AISTATS 2023
Multi-Agent Reinforcement Learning with Reward Delays
L4DC 2023
Oblivious near-optimal sampling for multidimensional signals with Fourier constraints
AISTATS 2023
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