DeepAI AI Chat
Log In Sign Up

Detection under One-Bit Messaging over Adaptive Networks

by   Stefano Marano, et al.
University of Salerno

This work studies the operation of multi-agent networks engaged in binary decision tasks, and derives performance expressions and performance operating curves under challenging conditions with some revealing insights. One of the main challenges in the analysis is that agents are only allowed to exchange one-bit messages, and the information at each agent therefore consists of both continuous and discrete components. Due to this mixed nature, the steady-state distribution of the state of each agent cannot be inferred from direct application of central limit arguments. Instead, the behavior of the continuous component is characterized in integral form by using a log-characteristic function, while the behavior of the discrete component is characterized by means of an asymmetric Bernoulli convolution. By exploiting these results, the article derives reliable approximate performance expressions for the network nodes that match well with the simulated results for a wide range of system parameters. The results also reveal an important interplay between continuous adaptation under constant step-size learning and the binary nature of the messages exchanged with neighbors.


page 1

page 2

page 3

page 4


Continuous Strategy Replicator Dynamics for Multi--Agent Learning

The problem of multi-agent learning and adaptation has attracted a great...

Emergent Quantized Communication

The field of emergent communication aims to understand the characteristi...

Adaptive Social Learning

This work proposes a novel strategy for social learning by introducing t...

Efficient Communication in Multi-Agent Reinforcement Learning via Variance Based Control

Multi-agent reinforcement learning (MARL) has recently received consider...

Zeroth Order Nonconvex Multi-Agent Optimization over Networks

In this paper we consider distributed optimization problems over a multi...

Revisiting the Gumbel-Softmax in MADDPG

MADDPG is an algorithm in multi-agent reinforcement learning (MARL) that...