Representing Piecewise-Linear Functions by Functions with Minimal Arity
Christoph Koutschan, Anton Ponomarchuk, Josef Schicho
TL;DR
This work investigates the minimal arity required to represent a continuous piecewise-linear function $F:\mathbb{R}^{n}\to \mathbb{R}$ as a sum of maxima of affine functions. It introduces a polyhedral-geometry framework based on piecewise-constant functions, flags, and delta functions, establishing that $F$ admits a representation with at most $k$ arguments if and only if the delta function $\Delta_{\nabla F}(\mathcal{H})$ is constant for all flags of length $k-1$, and shows how to compute the minimal $k^{*}$ via a finite-flag analysis. A constructive decomposition is given that expresses $F$ as a sum of components each using at most $k+1$ arguments, linking these results to ReLU network depth bounds and revealing that matching tessellations do not guarantee low-arity representations. The work further clarifies that the interplay between the input-space tessellation and function gradient structure governs the efficiency of piecewise-linear representations.
Abstract
Any continuous piecewise-linear function $F\colon \mathbb{R}^{n}\to \mathbb{R}$ can be represented as a linear combination of $\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear functions by functions with small arity'', AAECC, 2023], we showed that this upper bound of $n+1$ arguments is tight. In the present paper, we extend this result by establishing a correspondence between the function $F$ and the minimal number of arguments that are needed in any such decomposition. We show that the tessellation of the input space $\mathbb{R}^{n}$ induced by the function $F$ has a direct connection to the number of arguments in the $\max$ functions.
