Proposed an asynchronous block coordinate descent algorithm for distributed trajectory estimation in robotics, reducing communications by up to 96.9% and achieving exponential convergence.

This paper introduces a new distributed computational model called the uniform port model, which allows for efficient self-stabilizing algorithms for local symmetry breaking problems on general graphs…

The paper proposes DySCo, a dynamic trust-aware sparse consensus mechanism, to efficiently manage communication in multi-agent LLM systems by selectively connecting agents based on real-time value, th…

The paper proposes a Network Distributed Multi-Agent Reinforcement Learning (ND-MARL) framework that enables stable, scalable consensus control for large swarms of quadcopters using only local neighbo…

The authors resolve the contradiction between deterministic crash-tolerant consensus in a fully asynchronous environment and the FLP impossibility result by demonstrating that one protocol phase separ…

The paper proposes a scalable, distributed approach for constrained Multi-Agent Reinforcement Learning by using local consensus over dual variables to ensure global constraint satisfaction without cen…

This paper proposes a decentralized collaborative learning paradigm for Tsetlin Machines using consensus-based inference, allowing heterogeneous agents to maintain their own private models and combine…

The paper analyzes a new class of asynchronous adaptive first-order optimization methods and proves their stochastic convergence rate is O(1/sqrt{t}) for non-convex functions.

Gatling is a new atomic broadcast protocol that achieves arbitrarily small inter-proposal times, even smaller than the network delay, by running multiple parallel instances of a black-box atomic broad…

This paper introduces Epistemic Byzantine Fault Tolerance (EBFT), a fault-tolerance model for agentic infrastructure and post-deterministic distributed systems, addressing the Honest Quorum Problem an…

This paper proposes improvements to rotating-leader consensus protocols and their underlying P2P networks in blockchain systems, achieving up to 7.26x peak throughput improvement.

This paper analyzes Bregman ADMM for nonconvex linearly constrained problems under two-sided relative smoothness, showing convergence to strict saddle points and almost-sure second-order stationarity.

This paper introduces Stale Synchronous Parallel mode of execution for parallel sparse triangular linear system solve and presents a scheduler that achieves geometric-mean speed-ups of 7-30% over Grow…

This paper investigates how network perturbations can alter the asymptotic agreement trajectory in distributed coordination systems, proving fragility in standard cooperative output regulation schemes…

The paper proposes using an LLM aggregator that analyzes complete reasoning traces, demonstrating that trace-level synthesis is superior to traditional consensus methods like majority voting for solvi…