Pith. sign in

REVIEW

Convergence Properties of Score-Based Models for Linear Inverse Problems Using Graduated Optimisation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.18699 v2 pith:EM5W5P4B submitted 2024-04-29 cs.LG cs.CVeess.IV

classification cs.LGcs.CVeess.IV
keywords graduatedoptimisationinversemodelsproblemsconvergenceexperimentsframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The incorporation of generative models as regularisers within variational formulations for inverse problems has proven effective across numerous image reconstruction tasks. However, the resulting optimisation problem is often non-convex and challenging to solve. In this work, we show that score-based generative models (SGMs) can be used in a graduated optimisation framework to solve inverse problems. We show that the resulting graduated non-convexity flow converge to stationary points of the original problem and provide a numerical convergence analysis of a 2D toy example. We further provide experiments on computed tomography image reconstruction, where we show that this framework is able to recover high-quality images, independent of the initial value. The experiments highlight the potential of using SGMs in graduated optimisation frameworks. The source code is publicly available on GitHub.

Discussion (0). Sign in to comment.

Pith tools