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

Chaeyeon Jang

dblp:402/4236 · 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 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Generative modeling · 67% Reinforcement learning · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
0.912025
PCM : Picard Consistency Model for Fast Parallel Sampling of Diffusion Models · CVPR 2025
Machine learning › Generative modeling › diffusion model
parallel sampling
0.912025
PCM : Picard Consistency Model for Fast Parallel Sampling of Diffusion Models · CVPR 2025
Machine learning › Reinforcement learning
sample efficiency
0.912025
PCM : Picard Consistency Model for Fast Parallel Sampling of Diffusion Models · CVPR 2025

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

picard iteration · 0.9model switching · 0.9consistency model · 0.9
YearPublicationVenuePosition
2025 PCM : Picard Consistency Model for Fast Parallel Sampling of Diffusion Models
abstract
Recently, diffusion models have achieved significant advances in vision, text, and robotics. However, they still face slow generation speeds due to sequential denoising processes. To address this, a parallel sampling method based on Picard iteration was introduced, effectively reducing sequential steps while ensuring exact convergence to the original output. Nonetheless, Picard iteration does not guarantee faster convergence, which can still result in slow generation in practice. In this work, we propose a new parallelization scheme, the Picard Consistency Model (PCM), which significantly reduces the number of generation steps in Picard iteration. Inspired by the consistency model, PCM is directly trained to predict the fixed-point solution, or the final output, at any stage of the convergence trajectory. Additionally, we introduce a new concept called model switching, which addresses PCM’s limitations and ensures exact convergence. Extensive experiments demonstrate that PCM achieves up to a 2.71x speedup over sequential sampling and a 1.77x speedup over Picard iteration across various tasks, including image generation and robotic control.
Junhyuk So, Jiwoong Shin, Chaeyeon Jang, Eunhyeok Park
CVPR3