Distributed Maximum Consensus over Noisy Links

• URL: http://arxiv.org/abs/2403.18509v2
• Date: Mon, 17 Jun 2024 10:38:59 GMT
• Title: Distributed Maximum Consensus over Noisy Links
• Authors: Ehsan Lari, Reza Arablouei, Naveen K. D. Venkategowda, Stefan Werner,
• Abstract summary: We introduce a distributed algorithm, termed noise-robust distributed maximum consensus (RD-MC) Our approach entails redefining the maximum consensus problem as a distributed optimization problem. We demonstrate that RD-MC is significantly more robust to communication link noise compared to existing maximum-consensus algorithms.
• Score: 8.317370564091531
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a distributed algorithm, termed noise-robust distributed maximum consensus (RD-MC), for estimating the maximum value within a multi-agent network in the presence of noisy communication links. Our approach entails redefining the maximum consensus problem as a distributed optimization problem, allowing a solution using the alternating direction method of multipliers. Unlike existing algorithms that rely on multiple sets of noise-corrupted estimates, RD-MC employs a single set, enhancing both robustness and efficiency. To further mitigate the effects of link noise and improve robustness, we apply moving averaging to the local estimates. Through extensive simulations, we demonstrate that RD-MC is significantly more robust to communication link noise compared to existing maximum-consensus algorithms.

Related papers

• Design Optimization of NOMA Aided Multi-STAR-RIS for Indoor Environments: A Convex Approximation Imitated Reinforcement Learning Approach [51.63921041249406]
  Non-orthogonal multiple access (NOMA) enables multiple users to share the same frequency band, and simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) deploying STAR-RIS indoors presents challenges in interference mitigation, power consumption, and real-time configuration. A novel network architecture utilizing multiple access points (APs), STAR-RISs, and NOMA is proposed for indoor communication.
  arXiv  Detail & Related papers  (2024-06-19T07:17:04Z)
• CMA-ES with Adaptive Reevaluation for Multiplicative Noise [1.3108652488669732]
  We develop the reevaluation adaptation CMA-ES (RA-CMA-ES), which computes two update directions using half of the evaluations and adapts the number of reevaluations on the estimated correlation of those two update directions. The numerical simulation shows that the RA-CMA-ES outperforms the comparative method under multiplicative noise.
  arXiv  Detail & Related papers  (2024-05-19T07:42:10Z)
• FedNMUT -- Federated Noisy Model Update Tracking Convergence Analysis [3.665841843512992]
  A novel Decentralized Noisy Model Update Tracking Federated Learning algorithm (FedNMUT) is proposed. It is tailored to function efficiently in the presence noisy communication channels. FedNMUT incorporates noise into its parameters to mimic the conditions of noisy communication channels.
  arXiv  Detail & Related papers  (2024-03-20T02:17:47Z)
• High Efficiency Inference Accelerating Algorithm for NOMA-based Mobile Edge Computing [23.88527790721402]
  Splitting the inference model between device, edge server, and cloud can improve the performance of EI greatly. NOMA, which is the key supporting technologies of B5G/6G, can achieve massive connections and high spectrum efficiency. We propose the effective communication and computing resource allocation algorithm to accelerate the model inference at edge.
  arXiv  Detail & Related papers  (2023-12-26T02:05:52Z)
• A State-Augmented Approach for Learning Optimal Resource Management Decisions in Wireless Networks [58.720142291102135]
  We consider a radio resource management (RRM) problem in a multi-user wireless network. The goal is to optimize a network-wide utility function subject to constraints on the ergodic average performance of users. We propose a state-augmented parameterization for the RRM policy, where alongside the instantaneous network states, the RRM policy takes as input the set of dual variables corresponding to the constraints.
  arXiv  Detail & Related papers  (2022-10-28T21:24:13Z)
• Multiple Kernel Clustering with Dual Noise Minimization [56.009011016367744]
  Multiple kernel clustering (MKC) aims to group data by integrating complementary information from base kernels. In this paper, we rigorously define dual noise and propose a novel parameter-free MKC algorithm by minimizing them. We observe that dual noise will pollute the block diagonal structures and incur the degeneration of clustering performance, and C-noise exhibits stronger destruction than N-noise.
  arXiv  Detail & Related papers  (2022-07-13T08:37:42Z)
• MIX-MAB: Reinforcement Learning-based Resource Allocation Algorithm for LoRaWAN [6.22984202194369]
  This paper focuses on improving the resource allocation algorithm in terms of packet delivery ratio (PDR) We propose a resource allocation algorithm that enables the EDs to configure their transmission parameters in a distributed manner. Numerical results show that the proposed solution performs better than the existing schemes in terms of convergence time and PDR.
  arXiv  Detail & Related papers  (2022-06-07T15:50:05Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)
• Differentially Private ADMM for Convex Distributed Learning: Improved Accuracy via Multi-Step Approximation [10.742065340992525]
  Alternating Direction Method of Multipliers (ADMM) is a popular computation for distributed learning. When the training data is sensitive, the exchanged iterates will cause serious privacy concern. We propose a new differentially private distributed ADMM with improved accuracy for a wide range of convex learning problems.
  arXiv  Detail & Related papers  (2020-05-16T07:17:31Z)
• Distributionally Robust Bayesian Optimization [121.71766171427433]
  We present a novel distributionally robust Bayesian optimization algorithm (DRBO) for zeroth-order, noisy optimization. Our algorithm provably obtains sub-linear robust regret in various settings. We demonstrate the robust performance of our method on both synthetic and real-world benchmarks.
  arXiv  Detail & Related papers  (2020-02-20T22:04:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.