Zike Chen

dblp:294/5056 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—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 · 50% Optimization for machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
constrained optimization
1.012026
Constrained Particle Seeking: Solving Diffusion Inverse Problems with Just Forward Passes · AAAI 2026
Machine learning › Generative modeling
diffusion model
1.012026
Constrained Particle Seeking: Solving Diffusion Inverse Problems with Just Forward Passes · AAAI 2026
Machine learning › Generative modeling › diffusion model
inverse problem solving
1.012026
Constrained Particle Seeking: Solving Diffusion Inverse Problems with Just Forward Passes · AAAI 2026
Machine learning › Optimization for machine learning › black-box optimization
zeroth-order optimization
1.012026
Constrained Particle Seeking: Solving Diffusion Inverse Problems with Just Forward Passes · AAAI 2026

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

particle seeking · 1.0constrained optimization · 1.0
YearPublicationVenuePosition
2026 Constrained Particle Seeking: Solving Diffusion Inverse Problems with Just Forward Passes
abstract
Diffusion models have gained prominence as powerful generative tools for solving inverse problems due to their ability to model complex data distributions. However, existing methods typically rely on complete knowledge of the forward observation process to compute gradients for guided sampling, limiting their applicability in scenarios where such information is unavailable. In this work, we introduce *Constrained Particle Seeking (CPS)*, a novel gradient-free approach that leverages all candidate particle information to actively search for the optimal particle while incorporating constraints aligned with high-density regions of the unconditional prior. Unlike previous methods that passively select promising candidates, CPS reformulates the inverse problem as a constrained optimization task, enabling more flexible and efficient particle seeking. We demonstrate that CPS can effectively solve both image and scientific inverse problems, achieving results comparable to gradient-based methods while significantly outperforming gradient-free alternatives.
Hongkun Dou, Zike Chen, Hongjue Li, Yue Deng 0001
AAAI2