Parameter Learning for Log-supermodular Distributions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Parameter Learning for Log-supermodular Distributions


We consider log-supermodular models on binary variables, which are probabilistic models with negative log-densities which are submodular. These models provide probabilistic interpretations of common combinatorial optimization tasks such as image segmentation. In this paper, we focus primarily on parameter estimation in the models from known upper-bounds on the intractable log-partition function. We show that the bound based on separable optimization on the base polytope of the submodular function is always inferior to a bound based on " perturb-and-MAP " ideas. Then, to learn parameters, given that our approximation of the log-partition function is an expectation (over our own randomization), we use a stochastic subgradient technique to maximize a lower-bound on the log-likelihood. This can also be extended to conditional maximum likelihood. We illustrate our new results in a set of experiments in binary image denoising, where we highlight the flexibility of a probabilistic model to learn with missing data.
Fichier principal
Vignette du fichier
nips_2016.pdf (282.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01354789 , version 1 (19-08-2016)
hal-01354789 , version 2 (03-11-2016)



Tatiana Shpakova, Francis Bach. Parameter Learning for Log-supermodular Distributions. NIPS 2016 - Thirtieth Annual Conference on Neural Information Processing System, Dec 2016, Barcelona, Spain. ⟨hal-01354789v2⟩
307 View
426 Download



Gmail Facebook Twitter LinkedIn More