Paper recorded by Signals 4 on 2026-10-19 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-19 on arXiv · recorded by Signals 4 on 2026-10-20
Category: cs.LG · 机器学习 · first seen 2026-10-20
Every continuous piecewise linear (CPWL) function is a finite signed sum of maxima of affine functions, making maximum representation a central problem in the study of the expressiveness of ReLU networks. A now-disproved conjecture predicted logarithmic depth for maxima. Inspired by the proof by Brunck et al. (2026) that two hidden layers suffice for general CPWL functions, we give the Caterpillar