Designing Asymmetric Shift Operators for Decentralized Subspace Projection
A large number of applications in wireless sensor networks include projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. In general, accomplishing such a task in a centralized fashion, entails a large power consumption, congestion at certain nodes, and suffers from robustness issues against possible node failures. Computing such projections in a decentralized fashion is an alternative solution that solves these issues. Recent works have shown that this task can be done via the so-called graph filters where only local inter-node communication is performed in a distributed manner using a graph shift operator. Existing methods designed the graph filters for symmetric topologies. However, in this paper, the design of the graph shift operators to perform decentralized subspace projection for asymmetric topologies is studied.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Fast Decentralized Linear Functions Over Edge Fluctuating Graphs
Implementing linear transformations is a key task in the decentralized signal processing framework, which performs learning tasks on data sets distributed over multi-node networks. That kind of network can be represented…
Krylov Subspace Method for Nonlinear Dynamical Systems with Random Noise
Operator-theoretic analysis of nonlinear dynamical systems has attracted much attention in a variety of engineering and scientific fields, endowed with practical estimation methods using data such as dynamic mode decompo…
Anomaly DetectionAsymmetric 3D Context Fusion for Universal Lesion Detection
Modeling 3D context is essential for high-performance 3D medical image analysis. Although 2D networks benefit from large-scale 2D supervised pretraining, it is weak in capturing 3D context. 3D networks are strong in 3D c…
Computed Tomography (CT)Lesion DetectionMedical Image AnalysisTranslationCentralized and Decentralized Global Outer-synchronization of Asymmetric Recurrent Time-varying Neural Network by Data-sampling
In this paper, we discuss the outer-synchronization of the asymmetrically connected recurrent time-varying neural networks. By both centralized and decentralized discretization data sampling principles, we derive several…
Efficient decentralized multi-agent learning in asymmetric bipartite queueing systems
We study decentralized multi-agent learning in bipartite queueing systems, a standard model for service systems. In particular, N agents request service from K servers in a fully decentralized way, i.e, by running the sa…