Pith. sign in

REVIEW 2 cited by

ZerO Initialization: Initializing Neural Networks with only Zeros and Ones

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 2110.12661 v3 pith:NLODXG7F submitted 2021-10-25 cs.LG cs.CV

classification cs.LGcs.CV
keywords networkszeroinitializationrandomtrainingweightsdeeplow-rank
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep neural networks are usually initialized with random weights, with adequately selected initial variance to ensure stable signal propagation during training. However, selecting the appropriate variance becomes challenging especially as the number of layers grows. In this work, we replace random weight initialization with a fully deterministic initialization scheme, viz., ZerO, which initializes the weights of networks with only zeros and ones (up to a normalization factor), based on identity and Hadamard transforms. Through both theoretical and empirical studies, we demonstrate that ZerO is able to train networks without damaging their expressivity. Applying ZerO on ResNet achieves state-of-the-art performance on various datasets, including ImageNet, which suggests random weights may be unnecessary for network initialization. In addition, ZerO has many benefits, such as training ultra deep networks (without batch-normalization), exhibiting low-rank learning trajectories that result in low-rank and sparse solutions, and improving training reproducibility.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Subspace Networks: Scaling Decentralized Training with Communication-Efficient Model Parallelism

    cs.LG 2025-06 reject novelty 7.0 of 10

    Constraining transformer projection weights to a shared low-rank subspace reportedly enables near-lossless compression of pipeline-parallel communication, matching centralized convergence at 80Mbps bandwidth.

  2. Principled Approaches for Extending Neural Architectures to Function Spaces for Operator Learning

    cs.LG 2025-06 conditional novelty 4.0 of 10

    A practical recipe to convert common neural architectures into discretization-agnostic neural operators, validated by Navier-Stokes experiments showing cross-resolution generalization of FNO-style models.

Pith tools