Sciweavers

218 search results - page 9 / 44
» A Theory of Mean Field Approximation
Sort
View
CORR
2002
Springer
87views Education» more  CORR 2002»
14 years 10 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
ICONIP
2004
14 years 11 months ago
An Auxiliary Variational Method
Variational methods have proved popular and effective for inference and learning in intractable graphical models. An attractive feature of the approaches based on the Kullback-Lei...
Felix V. Agakov, David Barber
CVPR
2009
IEEE
16 years 5 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
ICCV
2011
IEEE
13 years 10 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
JMLR
2010
141views more  JMLR 2010»
14 years 4 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...