Pith. sign in

REVIEW 1 cited by

Memory capacity of neural networks with threshold and ReLU activations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.06938 v2 pith:3YCUVAUF submitted 2020-01-20 cs.LG cs.ITcs.NEmath.ITstat.ML

classification cs.LGcs.ITcs.NEmath.ITstat.ML
keywords networksactivationsneuralreluthresholdactivationdatafunctions
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Overwhelming theoretical and empirical evidence shows that mildly overparametrized neural networks -- those with more connections than the size of the training data -- are often able to memorize the training data with $100\%$ accuracy. This was rigorously proved for networks with sigmoid activation functions and, very recently, for ReLU activations. Addressing a 1988 open question of Baum, we prove that this phenomenon holds for general multilayered perceptrons, i.e. neural networks with threshold activation functions, or with any mix of threshold and ReLU activations. Our construction is probabilistic and exploits sparsity.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Information Theoretic Perspective on Representation Learning

    cs.IT 2026-01 conditional novelty 2.0 of 10

    Representation learning limits are restatements of Shannon's source coding, channel coding, and rate-distortion theorems under a dictionary mapping embedding size to code rate.

Pith tools