Pith. sign in

REVIEW 1 cited by

What's Hidden in a Randomly Weighted Neural Network?

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 1911.13299 v2 pith:XIXH3LWD submitted 2019-11-29 cs.CV cs.LG

What's Hidden in a Randomly Weighted Neural Network?

classification cs.CV cs.LG
keywords neuralrandomlyweightedweightsnetworkhiddennetworksperformance
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Training a neural network is synonymous with learning the values of the weights. By contrast, we demonstrate that randomly weighted neural networks contain subnetworks which achieve impressive performance without ever training the weight values. Hidden in a randomly weighted Wide ResNet-50 we show that there is a subnetwork (with random weights) that is smaller than, but matches the performance of a ResNet-34 trained on ImageNet. Not only do these "untrained subnetworks" exist, but we provide an algorithm to effectively find them. We empirically show that as randomly weighted neural networks with fixed weights grow wider and deeper, an "untrained subnetwork" approaches a network with learned weights in accuracy. Our code and pretrained models are available at https://github.com/allenai/hidden-networks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Double-Scoring: Reliable Extraction of Strong Lottery Tickets

    cs.LG 2026-07 conditional novelty 5.0

    Double-scoring replaces layerwise sparsity selection with fixed half-density masking over an augmented score tensor, yielding higher untrained-subnetwork accuracy but at uncontrolled effective sparsity.