On-the-Fly Communication-and-Computing for Distributed Tensor Decomposition Over MIMO Channels

by   Xu Chen, et al.

Distributed tensor decomposition (DTD) is a fundamental data-analytics technique that extracts latent important properties from high-dimensional multi-attribute datasets distributed over edge devices. Conventionally its wireless implementation follows a one-shot approach that first computes local results at devices using local data and then aggregates them to a server with communication-efficient techniques such as over-the-air computation (AirComp) for global computation. Such implementation is confronted with the issues of limited storage-and-computation capacities and link interruption, which motivates us to propose a framework of on-the-fly communication-and-computing (FlyCom^2) in this work. The proposed framework enables streaming computation with low complexity by leveraging a random sketching technique and achieves progressive global aggregation through the integration of progressive uploading and multiple-input-multiple-output (MIMO) AirComp. To develop FlyCom^2, an on-the-fly sub-space estimator is designed to take real-time sketches accumulated at the server to generate online estimates for the decomposition. Its performance is evaluated by deriving both deterministic and probabilistic error bounds using the perturbation theory and concentration of measure. Both results reveal that the decomposition error is inversely proportional to the population of sketching observations received by the server. To further rein in the noise effect on the error, we propose a threshold-based scheme to select a subset of sufficiently reliable received sketches for DTD at the server. Experimental results validate the performance gain of the proposed selection algorithm and show that compared to its one-shot counterparts, the proposed FlyCom^2 achieves comparable (even better in the case of large eigen-gaps) decomposition accuracy besides dramatically reducing devices' complexity costs.


page 1

page 2

page 3

page 4


Analog MIMO Communication for One-shot Distributed Principal Component Analysis

A fundamental algorithm for data analytics at the edge of wireless netwo...

Learning Rate Optimization for Federated Learning Exploiting Over-the-air Computation

Federated learning (FL) as a promising edge-learning framework can effec...

Differentially Private Over-the-Air Federated Learning Over MIMO Fading Channels

Federated learning (FL) enables edge devices to collaboratively train ma...

Wireless Distributed Edge Learning: How Many Edge Devices Do We Need?

We consider distributed machine learning at the wireless edge, where a p...

Gradient Estimation for Federated Learning over Massive MIMO Communication Systems

Federated learning is a communication-efficient and privacy-preserving s...

Reduced-Dimension Design of MIMO Over-the-Air Computing for Data Aggregation in Clustered IoT Networks

One basic operation of Internet-of-Things (IoT) networks is aggregating ...

SMPC Task Decomposition: A Theory for Accelerating Secure Multi-party Computation Task

Today, we are in the era of big data, and data are becoming more and mor...

Please sign up or login with your details

Forgot password? Click here to reset