Approximate message-passing for convex optimization with non-separable penalties.
Andre ManoelFlorent KrzakalaGaël VaroquauxBertrand ThirionLenka ZdeborováPublished in: CoRR (2018)
Keyphrases
- convex optimization
- message passing
- inference in graphical models
- belief propagation
- distributed systems
- interior point methods
- convex programming
- junction tree
- total variation
- probabilistic inference
- convex optimization problems
- markov random field
- convex relaxation
- approximate inference
- denoising
- primal dual
- graph cuts
- structured prediction
- lower bound
- image restoration
- higher order
- alternating direction method of multipliers
- sum product algorithm
- optimal solution
- pairwise
- sum product
- learning algorithm