Results 11 to 20 of about 715,782 (191)
Permission-Based Separation Logic for Message-Passing Concurrency [PDF]
We develop local reasoning techniques for message passing concurrent programs based on ideas from separation logics and resource usage analysis. We extend processes with permission- resources and define a reduction semantics for this extended language ...
Adrian Francalanza +2 more
doaj +3 more sources
Reparameterization Gradient Message Passing
In this paper we consider efficient message passing based inference in a factor graph representation of a probabilistic model. Current message passing methods, such as belief propagation, variational message passing or expectation propagation, rely on analytically pre-computed message update rules.
Akbayrak, Semih, de Vries, Bert
openaire +3 more sources
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 ...
J. Robin B. Cockett, Craig A. Pastro
openaire +6 more sources
Backward particle message passing [PDF]
Particle methods are an established way to represent messages and perform message passing in factor graphs. Despite their common use, there are several cases for which messages are hard to compute, even in linear models. Building on results from Gaussian message passing, we demonstrate how backward particle-based messages can be computed and describe a
Henk Wymeersch +4 more
openaire +3 more sources
Graph neural networks (GNNs) are a powerful inductive bias for modelling algorithmic reasoning procedures and data structures. Their prowess was mainly demonstrated on tasks featuring Markovian dynamics, where querying any associated data structure depends only on its latest state.
Heiko Strathmann +3 more
openaire +2 more sources
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.
Velimir M. Ilic +2 more
openaire +2 more sources
Memory Approximate Message Passing [PDF]
Approximate message passing (AMP) is a low-cost iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions. However, AMP only applies to independent identically distributed (IID) transform matrices, but may become unreliable for other matrix ensembles, especially for ill-conditioned ones.
Lei Liu 0005 +2 more
openaire +4 more sources
On convergence of approximate message passing [PDF]
5 pages, 3 ...
Caltagirone, Francesco +2 more
openaire +3 more sources
Vector Approximate Message Passing [PDF]
The standard linear regression (SLR) problem is to recover a vector $\mathbf{x}^0$ from noisy linear observations $\mathbf{y}=\mathbf{Ax}^0+\mathbf{w}$. The approximate message passing (AMP) algorithm recently proposed by Donoho, Maleki, and Montanari is a computationally efficient iterative approach to SLR that has a remarkable property: for large i.i.
Sundeep Rangan +2 more
openaire +3 more sources
A Message-Passing Interpretation of Adjoint Logic [PDF]
We present a system of session types based on adjoint logic which generalize standard binary session types. Our system allows us to uniformly capture several new behaviors in the space of asynchronous message-passing communication, including multicast ...
Klaas Pruiksma, Frank Pfenning
doaj +1 more source

