Results 1 - 10 of 182

Efficient Sequential Clamping for Lifted Message Passing

by Fabian Hadiji, Babak Ahmadi, Kristian Kersting
"... 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 k-tuples 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 Message-Passing

by Kristian Kersting, Youssef El Massaoudi, Babak Ahmadi, Fabian Hadiji
"... 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

Generalized sequential treereweighted message passing

by Vladimir Kolmogorov, Thomas Schoenemann - arXiv:1205.6352
"... This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs t ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way

PYRROS: Static Task Scheduling and Code Generation for Message Passing Multiprocessors

by Tao Yang, Apostolos Gerasoulis - The 6th ACM Int'l Conf. on Supercomputing , 1992
"... We describe a parallel programming tool for scheduling static task graphs and generating the appropriate target code for message passing MIMD architectures. The computational complexity of the system is almost linear to the size of the task graph and preliminary experiments show performance comparab ..."
Abstract - Cited by 91 (21 self) - Add to MetaCart
approach considers the problem of automatic parallelization and scheduling from sequential programs. The emphasis has been in the development of compilers or software tools that will assist in programming parallel architectures [2, 16, 18, 19]. Since message passing architectures require coarse grain

MultiEvidence Lifted Message Passing, with Application to PageRank and the Kalman Filter

by Babak Ahmadi, Kristian Kersting, Scott Sanner - 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

Agha, “Inferring ownership transfer for efficient message passing

by Stas Negara, Rajesh K. Karmani, Gul Agha - in In Proc. PPOPP. ACM , 2011
"... One of the more popular paradigms for concurrent programming is the Actor model of message passing; it has been adopted in one form or another by a number of languages and frameworks. By avoiding a shared local state and instead relying on message passing, the Actor model facilitates modular program ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
programming. An important challenge for message passing languages is to transmit messages efficiently. This requires retaining the pass-by-value semantics of messages while avoiding making a deep copy on sequential or shared memory multicore processors. A key observation is that many messages have

An efficient universal construction for message-passing systems

by Partha Dutta, Rachid Guerraoui, Bastian Pochon - In Proceedings of the 16th International Symposium on Distributed Computing (DISC16 , 2002
"... Abstract A universal construction is an algorithm that transforms any object with a sequential specification into a wait-free and linearizable implementation of that object. This paper presents a novel universal construction algorithm for a message-passing system with process crash failures. Our alg ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
Abstract A universal construction is an algorithm that transforms any object with a sequential specification into a wait-free and linearizable implementation of that object. This paper presents a novel universal construction algorithm for a message-passing system with process crash failures. Our

An Efficient Message Passing Election Algorithm based on Mazurkiewicz’s Algorithm

by Jérémie Chalopin, Yves Métivier , 2006
"... We study the election and the naming problems in the asynchronous message passing model. We present a necessary condition based on Angluin’s lifting lemma [Ang80] that must be satisfied by any network that admits a naming (or an election) algorithm. We then show that this necessary condition is also ..."
Abstract - Cited by 10 (6 self) - Add to MetaCart
We study the election and the naming problems in the asynchronous message passing model. We present a necessary condition based on Angluin’s lifting lemma [Ang80] that must be satisfied by any network that admits a naming (or an election) algorithm. We then show that this necessary condition

Bounded phase analysis of message-passing programs

by Ahmed Bouajjani, Michael Emmi , 2012
"... We describe a novel technique for bounded analysis of asynchronous message-passing programs with ordered message queues. Our bounding parameter does not limit the number of pending messages, nor the number of “contexts-switches” between processes. Instead, we limit the number of process communicat ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
We describe a novel technique for bounded analysis of asynchronous message-passing programs with ordered message queues. Our bounding parameter does not limit the number of pending messages, nor the number of “contexts-switches” between processes. Instead, we limit the number of process

A Fast Distributed Algorithm for Mining Association Rules

by David Cheung, Jiawei Han, Vincent T. Ng, Ada W. Fu, Yongjian Fu, Ada W. Yongjian , 1996
"... With the existence of many large transaction databases, the huge amounts of data, the high scalability of distributed systems, and the easy partition and distribution of a centralized database, it is important to investigate efficient methods for distributed mining of association rules. This study d ..."
Abstract - Cited by 138 (11 self) - Add to MetaCart
of messages to be passed at mining association rules. Our performance study shows that FDM has a superior performance over the direct application of a typical sequential algorithm. Further performance enhancement leads to a few variations of the algorithm.
Results 1 - 10 of 182