Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This research advances decentralized federated learning by applying evolutionary game theory to mitigate free-rider behaviors in peer-to-peer networks without a central coordinator. By integrating reputation mechanisms and bounded rationality models, the study achieves near-perfect cooperation rates while significantly improving model accuracy convergence. The work addresses critical stability challenges inherent in distributed AI training environments where trust is scarce.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Reputation-driven Cooperation in Lattice-based Decentralized Federated Learning through Evolutionary Game Theory

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2608.01197v1 Announce Type: new Abstract: Decentralized Federated Learning (DFL) has emerged as an optimal privacy-preserving solution; however, it remains vulnerable to opportunistic behaviors due to the absence of a central coordinator. While Evolutionary Game Theory (EGT) serves as a powerful framework for analyzing such behaviors, existing studies often assume that agents possess perfect rationality and maintain static strategies. To address these limitations, this paper proposes a novel EGT framework designed to analyze strategic evolution and enhance overall system performance. The primary contributions of this work are threefold: First, we model peer-to-peer (P2P) interactions on a lattice network structure under the assumption of bounded rationality. Second, we formulate a comprehensive payoff matrix incorporating training costs, communication overhead, and cooperative rewards, while tailoring a strategy update rule that captures spatial propagation dynamics. Third, we integrate a reputation-based reward-and-punishment mechanism to effectively deter free-riding behaviors. Simulation results demonstrate that the framework significantly outperforms the baseline. Specifically, it increases average accuracy from approximately 70% to 82%, elevates cooperation frequency to approach 100% (compared to below 5% in the baseline), and drops accuracy variance from around 0.40 to 0.002, thereby accelerating uniform convergence and ensuring system stability.

Abstract:Decentralized Federated Learning (DFL) has emerged as an optimal privacy-preserving solution; however, it remains vulnerable to opportunistic behaviors due to the absence of a central coordinator. While Evolutionary Game Theory (EGT) serves as a powerful framework for analyzing such behaviors, existing studies often assume that agents possess perfect rationality and maintain static strategies. To address these limitations, this paper proposes a novel EGT framework designed to analyze strategic evolution and enhance overall system performance. The primary contributions of this work are threefold: First, we model peer-to-peer (P2P) interactions on a lattice network structure under the assumption of bounded rationality. Second, we formulate a comprehensive payoff matrix incorporating training costs, communication overhead, and cooperative rewards, while tailoring a strategy update rule that captures spatial propagation dynamics. Third, we integrate a reputation-based reward-and-punishment mechanism to effectively deter free-riding behaviors. Simulation results demonstrate that the framework significantly outperforms the baseline. Specifically, it increases average accuracy from approximately 70% to 82%, elevates cooperation frequency to approach 100% (compared to below 5% in the baseline), and drops accuracy variance from around 0.40 to 0.002, thereby accelerating uniform convergence and ensuring system stability.

Artificial Intelligence (cs.AI); Cryptography and Security (cs.CR); Distributed, Parallel, and Cluster Computing (cs.DC); Computer Science and Game Theory (cs.GT); Dynamical Systems (math.DS)

arXiv:2608.01197 [cs.AI]

(or arXiv:2608.01197v1 [cs.AI] for this version)

https://doi.org/10.48550/arXiv.2608.01197 arXiv-issued DOI via DataCite (pending registration)

Text integral sub licența deschisă a publicației · 224 cuvinte

Subiecte conexe