
Over-the-Air Gaussian Process Regression
Based on Product of Experts
Koya Sato
Artificial Intelligence eXploration Research Center,
The University of Electro-Communications, 1-5-1, Chofugaoka, Chofu-shi, Tokyo, Japan
E-mail: k sato@ieee.org
Abstract—This paper proposes a distributed Gaussian process
regression (GPR) with over-the-air computation, termed AirComp
GPR, for communication- and computation-efficient data analysis
over wireless networks. GPR is a non-parametric regression
method that can model the target flexibly. However, its com-
putational complexity and communication efficiency tend to be
significant as the number of data increases. AirComp GPR
focuses on that product-of-experts-based GPR approximates the
exact GPR by a sum of values reported from distributed nodes.
We introduce AirComp for the training and prediction steps to
allow the nodes to transmit their local computation results simul-
taneously; the communication strategies are presented, including
distributed training based on perfect and statistical channel state
information cases. Applying to a radio map construction task, we
demonstrate that AirComp GPR speeds up the computation time
while maintaining the communication cost in training constant
regardless of the numbers of data and nodes.
Index Terms—Over-the-air computation, distributed machine
learning, Gaussian processes, radio map construction
I. INTRODUCTION
Gaussian process regression (GPR) is a non-parametric
approach to regression tasks, which realizes flexible modeling
of a dataset without specifying low-level assumptions [1], [2].
Assuming GP for the target data, we can obtain both the mean
and variance of the regression results. There has been a wide
range of applications for GPR such as environmental monitor-
ing based on spatial statistics [3], [4], experimental design [5]
and motion trajectory analysis [6]; in wireless communication
systems, recent results have shown its advances in coverage
analysis and communication design, with the term of radio
map [7]–[9]. GPR will play an important role in the next
Internet of Things (IoT) era.
However, GPR has some critical drawbacks regarding com-
munication and computational costs in such applications. Let
us consider a situation where multiple nodes are distributed on
a network to monitor an environmental state and connected to
a server wirelessly, as envisioned in [10]. When the server
performs GPR to analyze the sensing results, the nodes need
to upload their sensing data to the server. The exact GPR
requires inverse matrices in training and prediction steps. This
leads the complexity of O(N3)for Ntraining data; further,
for nin input dimension data, the nodes upload (nin + 1)N
This work was supported in part by JST, ACT-X, JPMJAX21AA and JST
SICORP, JPMJSC20C1.
variables to the server. The first problem can be improved by
distributed GPR based on the product of experts [2], [11].
This method approximates GPR by the sum of computation
results at nodes to reduce the computational complexity from
O(N3)at the server to O((N/M)3)at Mdistributed nodes;
however, the communication slots still depend on M.
In this paper, toward a communication- and computation-
efficient IoT monitoring system, we propose a distributed GPR
scheme with over-the-air computation, termed AirComp GPR.
Over-the-air computation is a technique for communication-
efficient distributed computation over shared channels based
on nomographic functions [12], [13]. Each node transmits
its message with an analog modulation function. Then, the
receiver obtains the target computation result from the super-
imposed signal based on a decoding function. Since multiple
nodes transmit their analog-modulated signals simultaneously,
we can realize a low-latency computation over networks. We
focus on that both training/regression results in the distributed
GPR are based on the sum of computation results reported
from the nodes. The proposed method aggregates the local
computation results based on the over-the-air computation; as
a result, the communication cost does not depend on the data
size and the number of nodes.
Major contributions of this paper are listed as follows.
•We propose AirComp-aided distributed GPR for com-
munication/computation efficient regression over wireless
networks. It is shown that the computational complexity
can be reduced from O(N3)at BS to O((N/M)3)at
Mdistributed nodes, and its communication cost at the
training step can be constant regardless of Mand N.
•Two schemes are introduced for the training step: per-
fect channel state information (CSI)-based and statistical
CSI-based schemes. The first approach can perform the
distributed GPR with a limited accuracy degradation from
full GPR; further, the latter enables no requirements for
the uplink instantaneous channel estimations.
•Performance of AirComp GPR is analyzed in the radio
map construction task. We demonstrate that an accurate
radio map can be constructed efficiently.
Notations: throughout this paper, the transpose, determinant,
and inverse operators are denoted by (·)T,det(·)and (·)−1,
while the expectation and the variance are expressed by E[·]
arXiv:2210.02204v2 [eess.SP] 6 Oct 2022