Distributed Machine Learning in the Context of Function Computation over Wireless Networks

Due to strict limitations on the capacity of wireless links, applications of machine learning to various problems in wireless networks require the development of novel distributed solutions that facilitate an efficient evaluation of linear and nonlinear functions over the wireless channel. In this paper, we focus on selected machine learning-based approaches to the problem of detecting anomalies in applications such as condition monitoring, fault diagnosis and in general industrial environments. In particular, we study the possibility of exploiting the broadcast property of the wireless channel to efficiently compute discriminant functions over the channel. Our contribution includes quantitative (exponential) bounds on probabilities of mislabeling in binary linear classification and error in distributed linear function approximation. The problem of exploiting the broadcast property of the wireless channel to compute nonlinear functions might be difficult because the nomographic representation of general nomographic functions is not known. Therefore, we consider two approaches to this problem. First we combine computation coding for combating the impact of noise with a transmitter-side nonlinear pre-processing, whose goal is to approximate nomographic representations by general additive models. Our second approach is to extend the principle of computation coding to embed data in higher dimensions where data sets are linearly separable.

[1]  Slawomir Stanczak,et al.  Robust Analog Function Computation via Wireless Multiple-Access Channels , 2012, IEEE Transactions on Communications.

[2]  Michael Gastpar,et al.  Computation over Gaussian Multiple-Access Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[3]  Slawomir Stanczak,et al.  A simple algorithm for approximation by nomographic functions , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  David A. Sprecher,et al.  A representation theorem for continuous functions of several variables , 1965 .

[5]  Manfred V. Golitschek APPROXIMATING BIVARIATE FUNCTIONS AND MATRICES BY NOMOGRAPHIC FUNCTIONS , 1980 .

[6]  Slawomir Stanczak,et al.  Harnessing Interference for Analog Function Computation in Wireless Sensor Networks , 2013, IEEE Transactions on Signal Processing.

[7]  Slawomir Stanczak,et al.  C-RAN-Assisted Non-Coherent Grant-Free Random Access Based on Compute-and-Forward , 2018, 2018 IEEE Globecom Workshops (GC Wkshps).

[8]  Slawomir Stanczak,et al.  Energy-efficient classification for anomaly detection: The wireless channel as a helper , 2015, 2016 IEEE International Conference on Communications (ICC).

[9]  R. Tibshirani,et al.  Generalized Additive Models , 1991 .

[10]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[11]  R. Creighton Buck,et al.  Nomographic functions are nowhere dense , 1982 .

[12]  Slawomir Stanczak,et al.  Harnessing channel collisions for efficient massive access in 5G networks: A step forward to practical implementation , 2016, 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC).

[13]  Raceala-Motoc Miruna,et al.  Robust message recovery for non-cooperative compute-and-forward relaying , 2016 .

[14]  Carsten Bockelmann,et al.  Towards Massive Connectivity Support for Scalable mMTC Communications in 5G Networks , 2018, IEEE Access.

[15]  Robert Hable,et al.  Consistency of support vector machines using additive kernels for additive models , 2012, Comput. Stat. Data Anal..

[16]  R. Buck,et al.  Approximate complexity and functional representation , 1979 .