Byzantine-Resilient Consensus via Active Reputation Learning

TL;DR

This paper introduces a Byzantine-resilient consensus framework that actively learns reputations of agents to identify adversaries and ensure reliable agreement among normal agents, outperforming classical methods.

Contribution

It embeds an active reputation learning mechanism into the consensus process, enabling dynamic trust assessment and improved Byzantine detection and consensus reliability.

Findings

Achieves superior Byzantine detection accuracy.

Demonstrates more reliable and scalable consensus in experiments.

Outperforms classical resilient consensus methods.

Abstract

This paper proposes a Byzantine-resilient consensus framework that simultaneously pursues two tightly coupled objectives: actively identifying Byzantine agents and guaranteeing resilient consensus among normal agents. Unlike existing methods that treat adversary mitigation as a passive filtering process, our approach embeds an active reputation learning mechanism into the consensus loop. Agents evaluate neighbors' behaviors using outlier-robust loss functions and historical information, and construct a reputation vector on a probability simplex via a mechanism that balances loss minimization with diversity-preserving exploration, representing dynamic beliefs over neighbor trustworthiness. These reputations are then used to form weighted local updates that suppress adversarial influence and improve agreement among normal agents, thereby reducing the bias in local loss evaluations and enabling more reliable subsequent reputation estimation. This learning-control co-design yields a closed-loop dual objective: improved consensus states enhance Byzantine identifiability, while refined reputations in turn improve consensus. A range of distributed systems experiments, benchmarking against classical resilient consensus methods, demonstrate superior Byzantine detection accuracy and significantly more reliable and scalable consensus.