对数超模分布的参数学习
Parameter Learning for Log-supermodular Distributions
摘要:
我们考虑二进制变量的对数超模模型,这是概率模型的负对数密度是次模。这些模型提供了常见的组合优化任务,如图像分割的概率解释。在本文中,我们主要集中在参数估计的模型,从已知的上界的棘手的对数分割函数。我们表明,可分离优化的基础上的子模函数的多面体的基础上的界总是劣于一个界的基础上的“扰动和MAP”的想法。然后,为了学习参数,考虑到我们对对数配分函数的近似是一个期望(在我们自己的随机化之上),我们使用随机次梯度技术来最大化对数似然的下限。这也可以扩展到条件极大似然。我们在一组二值图像去噪实验中说明了我们的新结果,其中我们强调了概率模型在缺失数据学习中的灵活性。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。