Related papers: Expected Constant Time Self-stabilizing Byzantine …
Synchronization in quantum systems has been recently studied through persistent oscillations of local observables, which stem from undamped modes of the dissipative dynamics. However, the existence of such modes requires fine-tuning the…
Wall-clock convergence time and communication rounds are critical performance metrics in distributed learning with parameter-server setting. While synchronous methods converge fast but are not robust to stragglers; and asynchronous ones can…
We study the synchronization of chaotic units connected through time-delayed fluctuating interactions. We focus on small-world networks of Bernoulli and Logistic units with a fixed chiral backbone. Comparing the synchronization properties…
Experimental observations of typical kinds of synchronization transitions are reported in unidirectionally coupled time-delay electronic circuits with a threshold nonlinearity and two time delays, namely feedback delay $\tau_1$ and coupling…
We demonstrate that the Byzantine Agreement (detectable broadcast) is also solvable in the continuous-variable scenario with multipartite entangled Gaussian states and Gaussian operations (homodyne detection). Within this scheme we find…
We propose a time-delayed model for the study of active mode-locking that is valid for large values of the round-trip gain and losses. It allows us to access the typical regimes encountered in semiconductor lasers and to perform an extended…
Event synchronisation is a ubiquitous task, with applications ranging from 5G technology to industrial automation and smart power grids. The emergence of quantum communication networks will further increase the demand for precise…
A shared read/write register emulation provides the illusion of shared-memory on top of message-passing models. The main hurdle with such emulations is dealing with server faults in the system. Several crash-tolerant register emulations in…
Current reconfiguration techniques are based on starting the system in a consistent configuration, in which all participating entities are in their initial state. Starting from that state, the system must preserve consistency as long as a…
Distributed learning has many computational benefits but is vulnerable to attacks from a subset of devices transmitting incorrect information. This paper investigates Byzantine-resilient algorithms in a decentralized setting, where devices…
Both Byzantine resilience and communication efficiency have attracted tremendous attention recently for their significance in edge federated learning. However, most existing algorithms may fail when dealing with real-world irregular data…
We present an analytical investigation of exact anticipating synchronization between two bi-idirectionally coupled time-delayed systems in the case when these systems are governed by two characteristic times: the delay time in the coupling…
This paper studies the problem of stabilization of a nonlinear system with time-varying delays in both sensing and actuation using event-triggered control. Our proposed strategy seeks to opportunistically minimize the number of control…
Synchronization is ubiquitous in nature at various scales and fields. This phenomenon not only offers a window into the intrinsic harmony of complex systems, but also serves as a robust probe for many-body quantum systems. One such system…
Classical discrete-time adaptive controllers provide asymptotic stabilization. While the original adaptive controllers did not handle noise or unmodelled dynamics well, redesigned versions were proven to have some tolerance; however,…
Distributed machine learning algorithms enable learning of models from datasets that are distributed over a network without gathering the data at a centralized location. While efficient distributed algorithms have been developed under the…
Standard federated learning algorithms are vulnerable to adversarial nodes, a.k.a. Byzantine failures. To solve this issue, robust distributed learning algorithms have been developed, which typically replace parameter averaging by robust…
Dynamical decoupling pulse sequences have been used to extend coherence times in quantum systems ever since the discovery of the spin-echo effect. Here we introduce a method of recursively concatenated dynamical decoupling pulses, designed…
Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on…
In this paper, we show that the protocol complex of a Byzantine synchronous system can remain $(k - 1)$-connected for up to $\lceil t/k \rceil$ rounds, where $t$ is the maximum number of Byzantine processes, and $t \ge k \ge 1$. This…