LGFAJul 25, 2023

Piecewise Linear Functions Representable with Infinite Width Shallow ReLU Neural Networks

arXiv:2307.14373v11 citationsh-index: 1
Originality Synthesis-oriented
AI Analysis

This resolves a conjecture for theoretical machine learning, providing clarity on the expressiveness of shallow neural networks, though it is incremental in nature.

The paper tackles the problem of representing continuous piecewise linear functions using infinite width shallow ReLU neural networks, proving that every such function expressible with infinite width can also be expressed with finite width.

This paper analyzes representations of continuous piecewise linear functions with infinite width, finite cost shallow neural networks using the rectified linear unit (ReLU) as an activation function. Through its integral representation, a shallow neural network can be identified by the corresponding signed, finite measure on an appropriate parameter space. We map these measures on the parameter space to measures on the projective $n$-sphere cross $\mathbb{R}$, allowing points in the parameter space to be bijectively mapped to hyperplanes in the domain of the function. We prove a conjecture of Ongie et al. that every continuous piecewise linear function expressible with this kind of infinite width neural network is expressible as a finite width shallow ReLU neural network.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes