paper-with-me

Papers

MPLP: Learning a Message Passing Learning Protocol

2020-07-02 · Ettore Randazzo, Eyvind Niklasson, Alexander Mordvintsev

We present a novel method for learning the weights of an artificial neural network - a Message Passing Learning Protocol (MPLP). In MPLP, we abstract every operations occurring in ANNs as independent agents. Each agent is responsible for ingesting incoming multidimensional messages from other agents, updating its internal state, and generating multidimensional messages to be passed on to neighbouring agents. We demonstrate the viability of MPLP as opposed to traditional gradient-based approaches on simple feed-forward neural networks, and present a framework capable of generalizing to non-traditional neural network architectures. MPLP is meta learned using end-to-end gradient-based meta-optimisation. We further discuss the observed properties of MPLP and hypothesize its applicability on various fields of deep learning.

📄 PDF Abstract BibTeX arXiv:2007.00970

Code (2)

google-research/self-organising-systems 공식 구현 tf
SimonsThijs/MPLP pytorch

Similar Papers 제목 키워드 기반

Pure Message Passing Can Estimate Common Neighbor for Link Prediction

2023-09-02 · Kaiwen Dong, Zhichun Guo, Nitesh V. Chawla

Message Passing Neural Networks (MPNNs) have emerged as the {\em de facto} standard in graph representation learning. However, when it comes to link prediction, they often struggle, surpassed by simple heuristics such as…

Graph Representation LearningLink PredictionPredictionRepresentation Learning

MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models

2020-04-16 · ECCV 2018 9 · Siddharth Tourani, Alexander Shekhovtsov, Carsten Rother, Bogdan Savchynskyy

Dense, discrete Graphical Models with pairwise potentials are a powerful class of models which are employed in state-of-the-art computer vision and bio-imaging applications. This work introduces a new MAP-solver, based o…

6D Pose Estimation using RGBCPUGPUPose Estimation

MAP Estimation for Graphical Models by Likelihood Maximization

2010-12-01 · NeurIPS 2010 12 · Akshat Kumar, Shlomo Zilberstein

Computing a {\em maximum a posteriori} (MAP) assignment in graphical models is a crucial inference problem for many practical applications. Several provably convergent approaches have been successfully developed using li…

Protein Design

On Coordinate Minimization of Convex Piecewise-Affine Functions

2017-09-14 · Tomas Werner

A popular class of algorithms to optimize the dual LP relaxation of the discrete energy minimization problem (a.k.a.\ MAP inference in graphical models or valued constraint satisfaction) are convergent message-passing al…

Beyond Message Passing: A Semantic View of Agent Communication Protocols

2026-03-30 · Dun Yuan, Fuyuan Lyu, Ye Yuan, Weixu Zhang 외 arxiv

Agent communication protocols are becoming critical infrastructure for large language model (LLM) systems that must use tools, coordinate with other agents, and operate across heterogeneous environments. This work presen…