Pith. sign in

REVIEW

Gramian-Based Adaptive Combination Policies for Diffusion Learning over 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 2010.13104 v1 pith:56WFPLV5 submitted 2020-10-25 cs.MA cs.DCeess.SP

classification cs.MAcs.DCeess.SP
keywords performancepoliciesadaptivecombinationlearningbehaviordiffusionenhanced
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents an adaptive combination strategy for distributed learning over diffusion networks. Since learning relies on the collaborative processing of the stochastic information at the dispersed agents, the overall performance can be improved by designing combination policies that adjust the weights according to the quality of the data. Such policies are important because they would add a new degree of freedom and endow multi-agent systems with the ability to control the flow of information over their edges for enhanced performance. Most adaptive and static policies available in the literature optimize certain performance metrics related to steady-state behavior, to the detriment of transient behavior. In contrast, we develop an adaptive combination rule that aims at optimizing the transient learning performance, while maintaining the enhanced steady-state performance obtained using policies previously developed in the literature.

Discussion (0). Sign in to comment.

Pith tools