Average consensus algorithms are used in many distributed systems such as distributed optimization, sensor fusion and the control of dynamic systems. consensus algorithms converge through an explicit exchange of state...
详细信息
ISBN:
(数字)9789082797053
ISBN:
(纸本)9781728150017
Average consensus algorithms are used in many distributed systems such as distributed optimization, sensor fusion and the control of dynamic systems. consensus algorithms converge through an explicit exchange of state variables. In some cases, however, the state variables are confidential. In this paper, a privacy-preserving asynchronous distributed average consensus method is proposed, which decomposes the initial values into two states; alpha states and beta states. These states are initialized such that their sum is twice the initial value. The alpha states are used to communicate with the other nodes, while the beta states are used internally. Although beta states are not shared, they are used in the update of the alpha states. Unlike differential privacy based methods, the proposed algorithm achieves the exact average consensus, while providing privacy to the initial values. Compared to the synchronous state decomposition algorithm, the convergence rate is improved without any privacy compromise. As the variances of coupling weights become infinitely large, the semi-honest adversary does not have any range to estimate the initial value of the nodes given that there is at least one coupling weight hidden from the adversary.
We present a randomized algorithm that, given a constant Ε > 0, outputs a proper (1 + Ε)∆-edge-coloring of an m-edge simple graph G of maximum degree ∆ ≥ 1/Ε in O(m) time with high probability. This is the firs...
详细信息
This note describes a very simple O(1) query time algorithm for finding level ancestors. This is basically a serial (re)-implementation of the parallel algorithm of Berkman and Vishkin (*** and ***, Finding level-ance...
详细信息
Stochastic optimization naturally appear in many application areas, including machine learning. Our goal is to go further in the analysis of the Stochastic Average Gradient Accelerated (SAGA) algorithm. To achieve thi...
详细信息
We study deterministic and randomized streaming algorithms for word problems of finitely generated groups. For finitely generated groups that can be obtained from linear groups using the following operations we show t...
详细信息
By selecting different filter functions, spectral algorithms can generate various regularization methods to solve statistical inverse problems within the learning-from-samples framework. This paper combines distribute...
详细信息
In this paper, we propose an acceleration of the exact k-means++ algorithm using geometric information, specifically the Triangle Inequality and additional norm filters, along with a two-step sampling procedure. Our e...
详细信息
We present a non-intrusive gradient and a non-intrusive BFGS algorithm for parameter estimation problems in non-stationary elasticity. To avoid multiple (and potentially expensive) solutions of the underlying partial ...
详细信息
Domain adaptation (DA) is a statistical learning problem that arises when the distribution of the source data used to train a model differs from that of the target data used to evaluate the model. While many DA algori...
详细信息
To guarantee the success of vehicular networks, it is essential to ensure that the communication process is reliable and safe from malicious actions and that the solution has low computational complexity and energy co...
详细信息
To guarantee the success of vehicular networks, it is essential to ensure that the communication process is reliable and safe from malicious actions and that the solution has low computational complexity and energy consumption. Therefore, the present work proposes a proof-of-concept solution to ensure crash fault-tolerant communication in emulated heterogeneous Flying Ad-Hoc Networks (FANETs) using the Proof of Elapsed Time (PoET) consensus algorithm through the Hyperledger Sawtooth blockchain framework.
暂无评论