Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Decoding Network Codes by Message Passing  [PDF]
Daniel Salmond,Alex Grant,Terence Chan,Ian Grivell
Mathematics , 2009,
Abstract: In this paper, we show how to construct a factor graph from a network code. This provides a systematic framework for decoding using message passing algorithms. The proposed message passing decoder exploits knowledge of the underlying communications network topology to simplify decoding. For uniquely decodeable linear network codes on networks with error-free links, only the message supports (rather than the message values themselves) are required to be passed. This proposed simplified support message algorithm is an instance of the sum-product algorithm. Our message-passing framework provides a basis for the design of network codes and control of network topology with a view toward quantifiable complexity reduction in the sink terminals.
Expectation maximization as message passing  [PDF]
J. Dauwels,S. Korl,H. -A. Loeliger
Mathematics , 2005,
Abstract: Based on prior work by Eckford, it is shown how expectation maximization (EM) may be viewed, and used, as a message passing algorithm in factor graphs.
Entropy Message Passing  [PDF]
Velimir M. Ilic,Miomir S. Stankovic,Branimir T. Todorovic
Mathematics , 2009,
Abstract: The paper proposes a new message passing algorithm for cycle-free factor graphs. The proposed "entropy message passing" (EMP) algorithm may be viewed as sum-product message passing over the entropy semiring, which has previously appeared in automata theory. The primary use of EMP is to compute the entropy of a model. However, EMP can also be used to compute expressions that appear in expectation maximization and in gradient descent algorithms.
Reweighted message passing revisited  [PDF]
Vladimir Kolmogorov
Computer Science , 2013,
Abstract: We propose a new family of message passing techniques for MAP estimation in graphical models which we call {\em Sequential Reweighted Message Passing} (SRMP). Special cases include well-known techniques such as {\em Min-Sum Diffusion} (MSD) and a faster {\em Sequential Tree-Reweighted Message Passing} (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. We present such a generalization for the case of higher-order graphical models, and test it on several real-world problems with promising results.
The logic of message passing  [PDF]
J. R. B. Cockett,Craig Pastro
Mathematics , 2007,
Abstract: Message passing is a key ingredient of concurrent programming. The purpose of this paper is to describe the equivalence between the proof theory, the categorical semantics, and term calculus of message passing. In order to achieve this we introduce the categorical notion of a linear actegory and the related polycategorical notion of a poly-actegory. Not surprisingly the notation used for the term calculus borrows heavily from the (synchronous) pi-calculus. The cut elimination procedure for the system provides an operational semantics.
Message passing for vertex covers  [PDF]
Martin Weigt,Haijun Zhou
Computer Science , 2006, DOI: 10.1103/PhysRevE.74.046110
Abstract: Constructing a minimal vertex cover of a graph can be seen as a prototype for a combinatorial optimization problem under hard constraints. In this paper, we develop and analyze message passing techniques, namely warning and survey propagation, which serve as efficient heuristic algorithms for solving these computational hard problems. We show also, how previously obtained results on the typical-case behavior of vertex covers of random graphs can be recovered starting from the message passing equations, and how they can be extended.
Message Passing and Combinatorial Optimization  [PDF]
Siamak Ravanbakhsh
Computer Science , 2015,
Abstract: Graphical models use the intuitive and well-studied methods of graph theory to implicitly represent dependencies between variables in large systems. They can model the global behaviour of a complex system by specifying only local factors. This thesis studies inference in discrete graphical models from an algebraic perspective and the ways inference can be used to express and approximate NP-hard combinatorial problems. We investigate the complexity and reducibility of various inference problems, in part by organizing them in an inference hierarchy. We then investigate tractable approximations for a subset of these problems using distributive law in the form of message passing. The quality of the resulting message passing procedure, called Belief Propagation (BP), depends on the influence of loops in the graphical model. We contribute to three classes of approximations that improve BP for loopy graphs A) loop correction techniques; B) survey propagation, another message passing technique that surpasses BP in some settings; and C) hybrid methods that interpolate between deterministic message passing and Markov Chain Monte Carlo inference. We then review the existing message passing solutions and provide novel graphical models and inference techniques for combinatorial problems under three broad classes: A) constraint satisfaction problems such as satisfiability, coloring, packing, set / clique-cover and dominating / independent set and their optimization counterparts; B) clustering problems such as hierarchical clustering, K-median, K-clustering, K-center and modularity optimization; C) problems over permutations including assignment, graph morphisms and alignment, finding symmetries and traveling salesman problem. In many cases we show that message passing is able to find solutions that are either near optimal or favourably compare with today's state-of-the-art approaches.
Message passing on the QCDSP supercomputer  [PDF]
Michael Creutz
Physics , 1999, DOI: 10.1016/S0920-5632(00)91805-X
Abstract: The QCDSP machines were designed for lattice gauge calculations. For planning it is crucial to explore this architecture for other computationally intensive tasks. Here I describe an implementation of a simple message passing scheme. With the objective being simplicity, I introduce a small number of generic functions for manipulating a large data set spread over the machine. I test the scheme on three applications: a fast Fourier transform, arbitrary dimension SU(N) pure lattice gauge theory, and the manipulation of Fermionic Fock states through a distributed hash table. These routines compile both on QCDSP and a Unix workstation.
Typing Copyless Message Passing  [PDF]
Viviana Bono,Luca Padovani
Computer Science , 2012, DOI: 10.2168/LMCS-8(1:17)2012
Abstract: We present a calculus that models a form of process interaction based on copyless message passing, in the style of Singularity OS. The calculus is equipped with a type system ensuring that well-typed processes are free from memory faults, memory leaks, and communication errors. The type system is essentially linear, but we show that linearity alone is inadequate, because it leaves room for scenarios where well-typed processes leak significant amounts of memory. We address these problems basing the type system upon an original variant of session types.
On Convergence of Approximate Message Passing  [PDF]
Francesco Caltagirone,Florent Krzakala,Lenka Zdeborová
Computer Science , 2014, DOI: 10.1109/ISIT.2014.6875146
Abstract: Approximate message passing is an iterative algorithm for compressed sensing and related applications. A solid theory about the performance and convergence of the algorithm exists for measurement matrices having iid entries of zero mean. However, it was observed by several authors that for more general matrices the algorithm often encounters convergence problems. In this paper we identify the reason of the non-convergence for measurement matrices with iid entries and non-zero mean in the context of Bayes optimal inference. Finally we demonstrate numerically that when the iterative update is changed from parallel to sequential the convergence is restored.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.