Pith. sign in

REVIEW

Competing Adaptive Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2103.15664 v1 pith:F4E66PZR submitted 2021-03-29 cs.MA cs.LGeess.SPstat.ML

classification cs.MAcs.LGeess.SPstat.ML
keywords adaptiveagentsnetworkscommoncompetingdecentralizedinteractionsnetwork
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Adaptive networks have the capability to pursue solutions of global stochastic optimization problems by relying only on local interactions within neighborhoods. The diffusion of information through repeated interactions allows for globally optimal behavior, without the need for central coordination. Most existing strategies are developed for cooperative learning settings, where the objective of the network is common to all agents. We consider in this work a team setting, where a subset of the agents form a team with a common goal while competing with the remainder of the network. We develop an algorithm for decentralized competition among teams of adaptive agents, analyze its dynamics and present an application in the decentralized training of generative adversarial neural networks.

Discussion (0). Sign in to comment.

Pith tools