Special Session 62: Group invariant machine learning

Universality of Andrews Networks

Nathaniel Strawn
Georgetown University
USA
Co-Author(s):    Nate Strawn
Abstract:
Andrews plots provide lossless visualizations of high-dimensional data sets by linearly mapping data points to 1D functions. Employing the subtle nonlinear transformation which sends smooth functions to path integrals over a function`s graph, we obtain a neural network architecture admitting visualizations at every single step. In this talk, we demonstrate a universal approximation property of such networks, and discuss applications.