Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0709.0172

Improving the consensus performance via predictive mechanisms

Hai-Tao Zhang·Guy-Bart Stan·Michael ZhiQiang Chen·Jan M. Maciejowski·Tao Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

Considering some predictive mechanisms, we show that ultrafast average-consensus can be achieved in networks of interconnected agents. More specifically, by predicting the dynamics of the network several steps ahead and using this information in the design of the consensus protocol of each agent, drastic improvements can be achieved in terms of the speed of consensus convergence, without changing the topology of the network. Moreover, using these predictive mechanisms, the range of sampling periods leading to consensus convergence is greatly expanded compared with the routine consensus protocol. This study provides a mathematical basis for the idea that some predictive mechanisms exist in widely-spread biological swarms, flocks, and networks. From the industrial engineering point of view, inclusion of an efficient predictive mechanism allows for a significant increase in the speed of consensus convergence and also a reduction of the communication energy required to achieve a predefined consensus performance.

Explore related subjects

physics.data-an

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hai-Tao Zhang, Guy-Bart Stan, Michael ZhiQiang Chen, Jan M. Maciejowski, Tao Zhou. 2007-12-06. Improving the consensus performance via predictive mechanisms. https://arxiv.org/abs/0709.0172

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Data geometry preserves prediction but reshapes explanation

Across scientific domains, empirical data often give rise to positive semidefinite matrices that encode similarities, couplings or interactions and induce natural geometries. We investigate whether changing the geometry used to compare the same empirical representations preserves subject-level performance and the local structures from which explanations are derived, a question we term the prediction explanation invariance problem. We address this problem across morphometric MRI, fMRI and EEG data by comparing Frobenius and trace geometries applied to the same empirical matrices. Predictive performance was broadly preserved across geometries, but comparable performance did not imply agreement in subject-level decision scores or predicted labels. Predictive similarity also masked geometry-dependent differences in local neighbourhoods, perturbation sensitivities and explanatory rankings. Dimensionality reduction made the two subject-space geometries progressively more concordant, while classification performance and decision-level agreement declined. These results identify data geometry as a hidden degree of freedom in explainability: similar performance does not guarantee invariant decisions or explanations.

physics.data-an↗
arXiv2026

Modular Aggregation as a Debiasing Method for Non-Stationary Discrete Sources: Convergence and Numerical Validatio

We analyze \emph{modular aggregation}---summing $N$ independent outcomes modulo $m$---as a post-processing method for extracting nearly uniform randomness from biased discrete sources. Using discrete Fourier analysis over the cyclic group $\mathbb{Z}_m$, we prove exponential convergence of the output distribution to uniformity, with a rate determined by the largest non-trivial Fourier modulus. The result applies to independent non-stationary (non-IID) sources under a uniform spectral-gap condition on the non-trivial Fourier modes. Numerical simulations under several bias regimes, including cyclic drift and extreme cyclic bias, are used as finite-sample diagnostics and illustrate the theoretical predictions in comparison with Peres extraction and SHA-256 post-processing. The robustness of modular aggregation comes at a retention cost of order $1/N$, yielding an explicit trade-off between statistical quality and throughput.

physics.data-an↗
arXiv2026

Developing Multi-Dimensional, Sequential sWeighting Routines for Reaction Selection with Emphasis on Kaon Identification at CLAS12

In nuclear and particle physics experiments, event selection is often a multidimensional classification problem which involves several correlated observables. The widely used sWeight technique provides a statistically rigorous means of separating signal and background using discriminating variables, but its conventional formulation is generally applied to a single discriminating variable or a simultaneous multidimensional fit. In this paper we present a novel extension of the widely used sWeight technique, in which an arbitrary number of discriminating variables can be used to construct a multidimensional sequential framework. This method allows the extraction of signal distributions in controlled variables in a rigorous way. Particular attention is given to the treatment of signal and background correlations, as well as the propagation of statistical uncertainties through successive weighting stages. The method yields high-purity signal samples even in the presence of large and correlated backgrounds. As a benchmark application, the validity of this technique is demonstrated on kaon identification in a dataset collected with the CLAS12 detector at the Thomas Jefferson National Laboratory for cascade baryon searches. The final workflow is shown to be robust and consistent across different run periods and beam/detector conditions, demonstrating minimal systematical uncertainties associated with the method. Statistical uncertainties are proved to be evaluable using a bootstrap-based procedure. The method provides a general framework for multidimensional event weighting and is intended for application in complex analyses requiring robust signal selection in the presence of complex correlated backgrounds.

physics.data-an↗