pith. sign in

Understanding Deep Neural Networks with Rectified Linear Units

11 Pith papers cite this work. Polarity classification is still indexing.

11 Pith papers citing it
abstract

In this paper we investigate the family of functions representable by deep neural networks (DNN) with rectified linear units (ReLU). We give an algorithm to train a ReLU DNN with one hidden layer to *global optimality* with runtime polynomial in the data size albeit exponential in the input dimension. Further, we improve on the known lower bounds on size (from exponential to super exponential) for approximating a ReLU deep net function by a shallower ReLU net. Our gap theorems hold for smoothly parametrized families of "hard" functions, contrary to countable, discrete families known in the literature. An example consequence of our gap theorems is the following: for every natural number $k$ there exists a function representable by a ReLU DNN with $k^2$ hidden layers and total size $k^3$, such that any ReLU DNN with at most $k$ hidden layers will require at least $\frac{1}{2}k^{k+1}-1$ total nodes. Finally, for the family of $\mathbb{R}^n\to \mathbb{R}$ DNNs with ReLU activations, we show a new lowerbound on the number of affine pieces, which is larger than previous constructions in certain regimes of the network architecture and most distinctively our lowerbound is demonstrated by an explicit construction of a *smoothly parameterized* family of functions attaining this scaling. Our construction utilizes the theory of zonotopes from polyhedral theory.

citation-role summary

background 1

citation-polarity summary

verdicts

UNVERDICTED 11

roles

background 1

polarities

background 1

representative citing papers

Non-Uniqueness of Solutions in Neural Variational Methods

math.NA · 2026-05-09 · unverdicted · novelty 7.0 · 2 refs

Finite linear measurements in variational neural discretizations cause ill-posed discrete problems with non-unique minimizers, independent of the underlying continuous variational problem's well-posedness.

A Theory on Flow Matching with Neural Networks

cs.LG · 2026-06-08 · unverdicted · novelty 6.0

Establishes convergence guarantees for overparameterized 2-layer ReLU networks in flow matching, generalization bounds for the velocity-field objective, and Wasserstein guarantees for generated samples, using multi-task representation learning bounds.

On Symmetry and Initialization for Neural Networks

cs.LG · 2019-07-01 · unverdicted · novelty 5.0

For symmetric target functions, chosen initial conditions in one-hidden-layer networks enable SGD to produce generalization guarantees, unlike random initialization.

Bayesian meta-learning for modeling Alzheimer's disease progression

stat.ML · 2026-06-01 · unverdicted · novelty 4.0

Bayesian meta-learner predicts individualized Alzheimer's disease progression distributions from MRI and trajectories, competitive on ADNI data and less overconfident for long-term scores than deterministic versions.

citing papers explorer

Showing 11 of 11 citing papers.