← Back to all news
arXiv Machine Learning By Christoph Koutschan, Anton Ponomarchuk, Josef Schicho

Representing Piecewise-Linear Functions by Functions with Minimal Arity

Read the original on arXiv Machine Learning →

arXiv:2406. 02421v2 Announce Type: replace-cross 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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jul 27

Shallower ReLU Network Representations via Exact Linear Algebra

arXiv:2607. 21651v1 Announce Type: new Abstract: We prove that the maximum of $n$ real numbers is exactly representable by a ReLU network with two hidden layers for every $n\le 10$.

By Kilian Rue{\ss}, Gennadiy Averkov, Florestan Brunck, Moritz Grillo, Christoph Hertrich, Georg Loho, Jack Stade, Moritz Stargalla, Matthew Sun, Martin Winter
More like this →
arXiv Machine Learning
Jun 5

Decomposition Polyhedra of Piecewise Linear Functions

arXiv:2410. 04907v2 Announce Type: replace-cross Abstract: In this paper we contribute to the frequently studied question of how to decompose a continuous piecewise linear (CPWL) function into a difference of two convex CPWL functions.

By Marie-Charlotte Brandenburg, Moritz Grillo, Christoph Hertrich
More like this →
arXiv Machine Learning
Aug 19

Tight Bounds for Data-driven Multiple Hyper-parameter Tuning with Structured Loss Function

The paper establishes tight pseudo-dimension bounds for data-driven multiple hyper‑parameter tuning with structured loss functions. By refining upper bounds through real algebraic geometry and analyzing invariant connected sign cells, the authors avoid over‑counting and achieve sharper sample complexities. A multi‑regime lower‑bound framework demonstrates that these upper bounds are tight, and the approach is extended to general bi‑level validation‑loss tuning and broader semi‑algebraic applications.

By Anh Tuan Nguyen, Viet Anh Nguyen
More like this →