Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jianhai Shu

dblp:400/6560 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Generative modeling · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
langevin dynamics
0.912025
PID-controlled Langevin Dynamics for Faster Sampling of Generative Models · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning
sampling
0.912025
PID-controlled Langevin Dynamics for Faster Sampling of Generative Models · NeurIPS 2025
Machine learning › Generative modeling › diffusion model › diffusion model acceleration
sampling acceleration
0.912025
PID-controlled Langevin Dynamics for Faster Sampling of Generative Models · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

langevin dynamics · 0.9PID control · 0.9
YearPublicationVenuePosition
2025 PID-controlled Langevin Dynamics for Faster Sampling of Generative Models
abstract
Langevin dynamics sampling suffers from extremely low generation speed, fundamentally limited by numerous fine-grained iterations to converge to the target distribution. We introduce PID-controlled Langevin Dynamics (PIDLD), a novel sampling acceleration algorithm that reinterprets the sampling process using control-theoretic principles. By treating energy gradients as feedback signals, PIDLD combines historical gradients (the integral term) and gradient trends (the derivative term) to efficiently traverse energy landscapes and adaptively stabilize, thereby significantly reducing the number of iterations required to produce high-quality samples. Our approach requires no additional training, datasets, or prior information, making it immediately integrable with any Langevin-based method. Extensive experiments across image generation and reasoning tasks demonstrate that PIDLD achieves higher quality with fewer steps, making Langevin-based generative models more practical for efficiency-critical applications. The implementation can be found at \href{https://github.com/tsinghua-fib-lab/PIDLD}{https://github.com/tsinghua-fib-lab/PIDLD}.
Jianhai Shu, Jingtao Ding, Xiao-Ping Zhang 0002
NeurIPS2