ii Although shown to be a very powerful tool in computer vision, existing higher-order models are mostly restricted to computing MAP configuration for specific energy functions. In this thesis, we propose a multi-class model along with a variational marginal inference formulation for capturing higher-order log-supermodular interac-tions. Our modeling technique utilizes set functions by incorporating constraints that each variable is assigned to exactly one class. Marginal inference for our model can be done efficiently by either Frank-Wolfe or a soft-move-making algorithm, both of which are easily parallelized. To simutaneously address the associated MAP problem, we extend marginal inference formulation to a parameterized version as smoothe...
Multicuts enable to conveniently represent discrete graphical models for unsupervised and supervised...
In this paper we present a learning and inference framework, Composite Statis-tical Learning and Inf...
Submodular functions can be exactly minimized in poly-nomial time, and the special case that graph c...
We consider the problem of approximate Bayesian inference in log-supermodular models. These models e...
Submodular extensions of an energy function can be used to efficiently compute approximate marginals...
© 2018 Curran Associates Inc.All rights reserved. Submodular maximization problems appear in several...
Submodular extensions of an energy function can be used to efficiently compute approximate marginals...
Submodular extensions of an energy function can be used to efficiently compute approximate marginals...
Submodular optimization has found many applications in machine learning and beyond. We carry out the...
Variational inference provides a general optimization framework to approximate the posterior distrib...
Many problems of image understanding can be formulated as semantic segmentation, or the assignment o...
Markov Logic Networks (MLNs) use a few weighted first-order logic formulas to represent large probab...
International audienceSeveral supermodular losses have been shown to improve the perceptual quality ...
The overaching goal in this thesis is to develop the representational frameworks, the inference algo...
International audienceWe consider the structured-output prediction problem through probabilistic app...
Multicuts enable to conveniently represent discrete graphical models for unsupervised and supervised...
In this paper we present a learning and inference framework, Composite Statis-tical Learning and Inf...
Submodular functions can be exactly minimized in poly-nomial time, and the special case that graph c...
We consider the problem of approximate Bayesian inference in log-supermodular models. These models e...
Submodular extensions of an energy function can be used to efficiently compute approximate marginals...
© 2018 Curran Associates Inc.All rights reserved. Submodular maximization problems appear in several...
Submodular extensions of an energy function can be used to efficiently compute approximate marginals...
Submodular extensions of an energy function can be used to efficiently compute approximate marginals...
Submodular optimization has found many applications in machine learning and beyond. We carry out the...
Variational inference provides a general optimization framework to approximate the posterior distrib...
Many problems of image understanding can be formulated as semantic segmentation, or the assignment o...
Markov Logic Networks (MLNs) use a few weighted first-order logic formulas to represent large probab...
International audienceSeveral supermodular losses have been shown to improve the perceptual quality ...
The overaching goal in this thesis is to develop the representational frameworks, the inference algo...
International audienceWe consider the structured-output prediction problem through probabilistic app...
Multicuts enable to conveniently represent discrete graphical models for unsupervised and supervised...
In this paper we present a learning and inference framework, Composite Statis-tical Learning and Inf...
Submodular functions can be exactly minimized in poly-nomial time, and the special case that graph c...