Score-Based Manifold Projection for Diffusion-Based Inverse Problems
Bibliographic record
Abstract
Inverse problems such as inpainting, deblurring, and super-resolution benefit significantly from generative diffusion models, which serve as powerful learned priors. However, incorporating measurement-consistency gradients naively can push the intermediate solutions off the high-likelihood manifold encoded by the diffusion model, leading to artifacts or suboptimal reconstructions. In this paper, we propose a scorebased manifold projection framework that leverages the internal score function of the diffusion model itself to preserve manifold fidelity. Specifically, we exploit the fact that the diffusion score$\boldsymbol{s}_{\theta}(\boldsymbol{x}, t) \approx \nabla_{\boldsymbol{x}} \log p_{t}(\boldsymbol{x})$is ideally orthogonal to manifolds of constant log-likelihood at time$t$. By removing the component of the measurement gradient parallel to$\boldsymbol{s}_{\theta}$, our method constrains each update to remain (to first order) tangent to the learned data manifold. Theoretically, we prove that our approach preserves proximity to the manifold more effectively than an un-projected update, and empirically, we demonstrate improved robustness and quality on various inverse problems, including deblurring, inpainting, and super-resolution. Our results show that scorebased manifold projection not only reduces artifacts but also maintains the fidelity of the reconstructions, offering a simple yet effective enhancement to measurement-guided diffusion solvers.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".