Consensus Seminorms and their Applications
Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. We study the applications of seminorms for this goal. We revisit a previously suggested family of seminorms and correct an error made in their original presentation where it was claimed that the a certain seminorm is equal to the well-known coefficient of ergodicity. We then propose a wider family of seminorms which guarantee convergence at an exponential rate of infinite products of matrices which generalizes known results on stochastic matrices to the class of matrices whose row sums are all equal one. Finally, we show that such seminorms cannot be used to bound the rate of convergence of classes larger than the well-known class of scrambling matrices, and pose several open questions for future research.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Sparse Signal Reconstruction for Overdispersed Low-photon Count Biomedical Imaging Using $\ell_p$ Total Variation
The negative binomial model, which generalizes the Poisson distribution model, can be found in applications involving low-photon signal recovery, including medical imaging. Recent studies have explored several regulariza…
Image ReconstructionAdaptive Consensus: A network pruning approach for decentralized optimization
We consider network-based decentralized optimization problems, where each node in the network possesses a local function and the objective is to collectively attain a consensus solution that minimizes the sum of all the …
Network PruningConsensus-aware Contrastive Learning for Group Recommendation
Group recommendation aims to provide personalized item suggestions to a group of users by reflecting their collective preferences. A fundamental challenge in this task is deriving a consensus that adequately represents t…
Contrastive LearningConsensus-based Recursive Multi-Output Gaussian Process
Multi-output Gaussian Processes provide principled uncertainty-aware learning of vector-valued fields but are difficult to deploy in large-scale, distributed, and streaming settings due to their computational and central…
Gaussian Processes"Hey, that's not an ODE": Faster ODE Adjoints via Seminorms
Neural differential equations may be trained by backpropagating gradients via the adjoint method, which is another differential equation typically solved using an adaptive-step-size numerical differential equation solver…
Time SeriesTime Series Analysis