Pith. sign in

REVIEW 2 cited by

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

Solving Inverse Problems by Joint Posterior Maximization with a VAE Prior

classification stat.ML cs.CVcs.LGeess.IVmath.OC
keywords priorjointoptimizationalgorithmsapproachapproachesexperimentalinverse
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
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)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FlowADMM: Plug-and-play ADMM with Flow-based Renoise-Denoise Priors

    cs.CV 2026-05 unverdicted novelty 7.0

    FlowADMM replaces stochastic renoise-denoise steps in flow-based plug-and-play methods with a deterministic expectation operator inside ADMM, yielding convergence guarantees under weak Lipschitz conditions and state-o...

  2. Tessellations of Semi-Discrete Flow Matching

    cs.LG 2026-05 unverdicted novelty 7.0

    Semi-discrete Flow Matching produces terminal assignment regions that are topologically simple (open, simply connected, homeomorphic to the ball under assumption) yet geometrically distinct from optimal transport Lagu...