Distributed Computation over MAC via Kolmogorov-Arnold Representation

05/17/2021
by   Derya Malak, et al.
0

Kolmogorov's representation theorem provides a framework for decomposing any arbitrary real-valued, multivariate, and continuous function into a two-layer nested superposition of a finite number of functions. The functions at these two layers, are referred to as the inner and outer functions with the key property that the design of the inner functions is independent of that of the original function of interest to be computed. This brings modularity and universality to the design of the inner function, and subsequently, a part of computation. This paper capitalizes on such modularity and universality in functional representation to propose two frameworks for distributed computation over the additive multiple access channels (MACs). In the first framework, each source encodes the inner representations and sends them over the additive MAC. Subsequently, the receiver computes the outer functions to compute the function of interest. Transmitting the values of the inner functions instead of the messages directly leads to compression gains. In the second approach, in order to further increase the compression rate, the framework aims to also bring computing the outer functions to the source sites. Specifically, each source employs a graph-coloring-based approach to perform joint functional compression of the inner and the outer functions, which may attain further compression savings over the former. These modular encoding schemes provide an exact representation in the asymptotic regime and the non-asymptotic regime. Contrasting these with the baseline model where sources directly transmit data over MAC, we observe gains. To showcase the gains of these two frameworks and their discrepancies, they are applied to a number of commonly used computations in distributed systems, e.g., computing products, ℓ_m-norms, polynomial functions, extremum values of functions, and affine transformations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2018

Optimal Achievable Rates for Computation With Random Homologous Codes

Building on the framework of nested coset codes by Padakandla and Pradha...
research
12/22/2017

An Algorithm for Computing Lipschitz Inner Functions in Kolmogorov's Superposition Theorem

Kolmogorov famously proved that multivariate continuous functions can be...
research
03/13/2023

The joint bidiagonalization of a matrix pair with inaccurate inner iterations

The joint bidiagonalization (JBD) process iteratively reduces a matrix p...
research
02/24/2021

Multiple Access Channel Simulation

We study the problem of simulating a two-user multiple access channel ov...
research
08/30/2020

Optimal Nested Simulation Experiment Design via Likelihood Ratio Method

Nested simulation arises frequently in financial or input uncertainty qu...
research
03/30/2021

Applications of Common Information to Computing Functions

We design a low complexity distributed compression scheme for computing ...
research
02/12/2018

From expanders to hitting distributions and simulation theorems

Recently, Chattopadhyay et al. [chattopadhyay 2017 simulation] proved th...

Please sign up or login with your details

Forgot password? Click here to reset