Pith. sign in

REVIEW

Solving Inverse Problems by Joint Posterior Maximization with a VAE Prior

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 1911.06379 v1 pith:IZ6VNLVO submitted 2019-11-14 stat.ML cs.CVcs.LGeess.IVmath.OC

classification stat.MLcs.CVcs.LGeess.IVmath.OC
keywords priorjointoptimizationalgorithmsapproachapproachesexperimentalinverse
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper we address the problem of solving ill-posed inverse problems in imaging where the prior is a neural generative model. Specifically we consider the decoupled case where the prior is trained once and can be reused for many different log-concave degradation models without retraining. Whereas previous MAP-based approaches to this problem lead to highly non-convex optimization algorithms, our approach computes the joint (space-latent) MAP that naturally leads to alternate optimization algorithms and to the use of a stochastic encoder to accelerate computations. The resulting technique is called JPMAP because it performs Joint Posterior Maximization using an Autoencoding Prior. We show theoretical and experimental evidence that the proposed objective function is quite close to bi-convex. Indeed it satisfies a weak bi-convexity property which is sufficient to guarantee that our optimization scheme converges to a stationary point. Experimental results also show the higher quality of the solutions obtained by our JPMAP approach with respect to other non-convex MAP approaches which more often get stuck in spurious local optima.

Discussion (0). Continue with ORCID to comment.

Pith tools