Robust Interference Management for SISO Systems with Multiple Over-the-Air Computations

• URL: http://arxiv.org/abs/2004.09906v1
• Date: Tue, 21 Apr 2020 11:15:26 GMT
• Title: Robust Interference Management for SISO Systems with Multiple Over-the-Air Computations
• Authors: Jaber Kakar and Aydin Sezgin
• Abstract summary: We consider the over-the-air computation of sums over a shared complex-valued MAC. Finding appropriate Tx-Rx scaling factors balance between a low error in the computation of $s_n$ and the interference induced by it.
• Score: 16.52374405363812
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we consider the over-the-air computation of sums. Specifically, we wish to compute $M\geq 2$ sums $s_m=\sum_{k\in\mathcal{D}m}x_k$ over a shared complex-valued MAC at once with minimal mean-squared error ($\mathsf{MSE}$). Finding appropriate Tx-Rx scaling factors balance between a low error in the computation of $s_n$ and the interference induced by it in the computation of other sums $s_m$, $m\neq n$. In this paper, we are interested in designing an optimal Tx-Rx scaling policy that minimizes the mean-squared error $\max_{m\in[1:M]}\mathsf{MSE}_m$ subject to a Tx power constraint with maximum power $P$. We show that an optimal design of the Tx-Rx scaling policy $\left(\bar{\mathbf{a}},\bar{\mathbf{b}}\right)$ involves optimizing (a) their phases and (b) their absolute values in order to (i) decompose the computation of $M$ sums into, respectively, $M_R$ and $M_I$ ($M=M_R+M_I$) calculations over real and imaginary part of the Rx signal and (ii) to minimize the computation over each part -- real and imaginary -- individually. The primary focus of this paper is on (b). We derive conditions (i) on the feasibility of the optimization problem and (ii) on the Tx-Rx scaling policy of a local minimum for $M_w=2$ computations over the real ($w=R$) or the imaginary ($w=I$) part. Extensive simulations over a single Rx chain for $M_w=2$ show that the level of interference in terms of $\Delta D=|\mathcal{D}_2|-|\mathcal{D}_1|$ plays an important role on the ergodic worst-case $\mathsf{MSE}$. At very high $\mathsf{SNR}$, typically only the sensor with the weakest channel transmits with full power while all remaining sensors transmit with less to limit the interference. Interestingly, we observe that due to residual interference, the ergodic worst-case $\mathsf{MSE}$ is not vanishing; rather, it converges to $\frac{|\mathcal{D}_1||\mathcal{D}_2|}{K}$ as $\mathsf{SNR}\rightarrow\infty$.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting [21.002519159190538]
  We analyze a distributed algorithm to compute a low-rank matrix factorization on $N$ clients. We obtain a global $mathbfV$ in $mathbbRd times r$ common to all clients and a local $mathbfUi$ in $mathbbRn_itimes r$.
  arXiv  Detail & Related papers  (2024-09-13T12:28:42Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• $\ell_p$-Regression in the Arbitrary Partition Model of Communication [59.89387020011663]
  We consider the randomized communication complexity of the distributed $ell_p$-regression problem in the coordinator model. For $p = 2$, i.e., least squares regression, we give the first optimal bound of $tildeTheta(sd2 + sd/epsilon)$ bits. For $p in (1,2)$,we obtain an $tildeO(sd2/epsilon + sd/mathrmpoly(epsilon)$ upper bound.
  arXiv  Detail & Related papers  (2023-07-11T08:51:53Z)
• Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization [54.29685789885059]
  We introduce efficient $(1+varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem. The goal is to approximate $mathbfA$ as a product of low-rank factors. Our techniques generalize to other common variants of the BMF problem.
  arXiv  Detail & Related papers  (2023-06-02T18:55:27Z)
• An Optimal Stochastic Algorithm for Decentralized Nonconvex Finite-sum Optimization [25.21457349137344]
  We show a proof to show DEAREST requires at most $mathcal O(+sqrtmnLvarepsilon-2)$ first-order oracle (IFO) calls and $mathcal O(Lvarepsilon-2/sqrt1-lambda_W)$ communication rounds.
  arXiv  Detail & Related papers  (2022-10-25T11:37:11Z)
• Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
  We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
  arXiv  Detail & Related papers  (2022-06-17T17:55:43Z)
• Decentralized Stochastic Variance Reduced Extragradient Method [25.21457349137344]
  This paper studies decentralized convex-concave minimax optimization problems of the form $min_xmax_y fx,y triqfrac1msumi=1m f_i triqfrac1msumi=1m f_i triqfrac1msumi=1m f_i triqfrac1msumi=1m f_i triqfrac1msum
  arXiv  Detail & Related papers  (2022-02-01T16:06:20Z)
• Threshold Phenomena in Learning Halfspaces with Massart Noise [56.01192577666607]
  We study the problem of PAC learning halfspaces on $mathbbRd$ with Massart noise under Gaussian marginals. Our results qualitatively characterize the complexity of learning halfspaces in the Massart model.
  arXiv  Detail & Related papers  (2021-08-19T16:16:48Z)
• The planted matching problem: Sharp threshold and infinite-order phase transition [25.41713098167692]
  We study the problem of reconstructing a perfect matching $M*$ hidden in a randomly weighted $ntimes n$ bipartite graph. We show that if $sqrtd B(mathcalP,mathcalQ) ge 1+epsilon$ for an arbitrarily small constant $epsilon>0$, the reconstruction error for any estimator is shown to be bounded away from $0$.
  arXiv  Detail & Related papers  (2021-03-17T00:59:33Z)
• Convergence Rate of the (1+1)-Evolution Strategy with Success-Based Step-Size Adaptation on Convex Quadratic Functions [20.666734673282498]
  The (1+1)-evolution strategy (ES) with success-based step-size adaptation is analyzed on a general convex quadratic function. The convergence rate of the (1+1)-ES is derived explicitly and rigorously on a general convex quadratic function.
  arXiv  Detail & Related papers  (2021-03-02T09:03:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.