Papers
Topics
Authors
Recent
Search
2000 character limit reached

Representing Piecewise-Linear Functions by Functions with Minimal Arity

Published 4 Jun 2024 in cs.DM, cs.LG, and cs.SC | (2406.02421v1)

Abstract: Any continuous piecewise-linear function F ⁣:R<sup>n→</sup>RF\colon \mathbb{R}<sup>{n}\to</sup> \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 R<sup>n\mathbb{R}<sup>{n} induced by the function FF has a direct connection to the number of arguments in the max⁡\max functions.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.