English

Representing Piecewise-Linear Functions by Functions with Minimal Arity

Discrete Mathematics 2024-06-05 v1 Machine Learning Symbolic Computation

Abstract

Any continuous piecewise-linear function F ⁣:RnRF\colon \mathbb{R}^{n}\to \mathbb{R} can be represented as a linear combination of max\max functions of at most n+1n+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+1n+1 arguments is tight. In the present paper, we extend this result by establishing a correspondence between the function FF and the minimal number of arguments that are needed in any such decomposition. We show that the tessellation of the input space Rn\mathbb{R}^{n} induced by the function FF has a direct connection to the number of arguments in the max\max functions.

Keywords

Cite

@article{arxiv.2406.02421,
  title  = {Representing Piecewise-Linear Functions by Functions with Minimal Arity},
  author = {Christoph Koutschan and Anton Ponomarchuk and Josef Schicho},
  journal= {arXiv preprint arXiv:2406.02421},
  year   = {2024}
}
R2 v1 2026-06-28T16:53:07.698Z