Results 1  10
of
307,855
Lifted Message Passing for Satisfiability
"... Unifying logical and probabilistic reasoning is a longstanding goal of AI. While recent work in lifted belief propagation, handling whole sets of indistinguishable objects together, are promising steps towards achieving this goal that even scale to realistic domains, they are not tailored towards so ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
solving combinatorial problems such as determining the satisfiability of Boolean formulas. Recent results, however, show that certain other message passing algorithms, namely, survey propagation, are remarkably successful at solving such problems. In this paper, we propose the first lifted variants
Efficient Sequential Clamping for Lifted Message Passing
"... Abstract. Lifted message passing approaches can be extremely fast at computing approximate marginal probability distributions over single variables and neighboring ones in the underlying graphical model. They do, however, not prescribe a way to solve more complex inference tasks such as computing jo ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
joint marginals for ktuples of distant random variables or satisfying assignments of CNFs. A popular solution in these cases is the idea of turning the complex inference task into a sequence of simpler ones by selecting and clamping variables one at a time and running lifted message passing again after
Informed Lifting for MessagePassing
"... Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world tasks. Recently, lifted belief propagation (LBP) has been proposed as an efficient approximate solution of this inference p ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
lifting and modified BP iterations. In turn, we can efficiently monitor the true BP messages sent and received in each iteration and group nodes accordingly. As our experiments show, iLBP can yield significantly faster more lifted network while not degrading performance. Above all, we show that i
Message passing in random satisfiability problems
"... This talk surveys the recent development of message passing procedures for solving constraint satisfaction problems. The cavity method from statistical physics provides a generalization of the belief propagation strategy that is able to deal with the clustering of solutions in these problems. It all ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This talk surveys the recent development of message passing procedures for solving constraint satisfaction problems. The cavity method from statistical physics provides a generalization of the belief propagation strategy that is able to deal with the clustering of solutions in these problems
MultiEvidence Lifted Message Passing, with Application to PageRank and the Kalman Filter
 Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI–11). (accepted
, 2011
"... Lifted message passing algorithms exploit repeated structure within a given graphical model to answer queries efficiently. Given evidence, they construct a lifted network of supernodes and superpotentials corresponding to sets of nodes and potentials that are indistinguishable given the evidence. Re ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
Lifted message passing algorithms exploit repeated structure within a given graphical model to answer queries efficiently. Given evidence, they construct a lifted network of supernodes and superpotentials corresponding to sets of nodes and potentials that are indistinguishable given the evidence
Lifted Search Engines for Satisfiability
, 1999
"... There are several powerful solvers for satisfiability (SAT), such as wsat, DavisPutnam, and relsat. However, in practice, the SAT encodings often have so many clauses that we exceed physical memory resources on attempting to solve them. This excessive size often arises because conversion to SAT, ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
There are several powerful solvers for satisfiability (SAT), such as wsat, DavisPutnam, and relsat. However, in practice, the SAT encodings often have so many clauses that we exceed physical memory resources on attempting to solve them. This excessive size often arises because conversion to SAT
On the Semantics of Message Passing Processes
, 1999
"... Let J be a shape in some category Shp for which there is a functor : Shp Cat. A categorical transition system (or system) is a pair (J; (J) C) consisting of a shape labelled by a functor in a category in C. Systems generalize conventional labelled transition systems. By choosing a suitable univer ..."
Abstract
 Add to MetaCart
Let J be a shape in some category Shp for which there is a functor : Shp Cat. A categorical transition system (or system) is a pair (J; (J) C) consisting of a shape labelled by a functor in a category in C. Systems generalize conventional labelled transition systems. By choosing a suitable universe of shapes, systems can model concurrent and asynchronous computation. By labelling in a category, rather than an alphabet or term algebra, the actions of an algorithm or process can have structure. We study a class of systems called twisted systems having the form S = (J; F e J C) where J is a reflexive graph and g (\Gamma) : RGrph RGrph is the twisted graph construction. The relevance of twisted systems lies in the relationship between twists and spans. A functor FJ Sp(C) into a bicategory of spans is equivalent to a functor F e J C. The connection with spans means that when the target category C = Set, then following Burstall, a twisted system can be viewed as a generalized flowchart...
MessagePassing and Local Heuristics as Decimation Strategies for Satisfiability
"... Decimation is a simple process for solving constraint satisfaction problems, by repeatedly fixing variable values and simplifying without reconsidering earlier decisions. We investigate different decimation strategies, contrasting those based on local, syntactic information from those based on messa ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
on message passing, such as statistical physics based Survey Propagation (SP) and the related and more wellknown Belief Propagation (BP). Our results reveal that once we resolve convergence issues, BP itself can solve fairly hard random kSAT formulas through decimation; the gap between BP and SP narrows
Results 1  10
of
307,855