REVIEW 2 cited by
Weight Agnostic Neural Networks
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
Signed reviews
read the original abstract
Not all neural network architectures are created equal, some perform much better than others for certain tasks. But how important are the weight parameters of a neural network compared to its architecture? In this work, we question to what extent neural network architectures alone, without learning any weight parameters, can encode solutions for a given task. We propose a search method for neural network architectures that can already perform a task without any explicit weight training. To evaluate these networks, we populate the connections with a single shared weight parameter sampled from a uniform random distribution, and measure the expected performance. We demonstrate that our method can find minimal neural network architectures that can perform several reinforcement learning tasks without weight training. On a supervised learning domain, we find network architectures that achieve much higher than chance accuracy on MNIST using random weights. Interactive version of this paper at https://weightagnostic.github.io/
Forward citations
Cited by 2 Pith papers
-
Learning Digital Circuits: A Journey Through Weight Invariant Self-Pruning Neural Networks
A BinaryConnect-style method with 0/1 weights learns sparse topologies that retain near-baseline accuracy and tolerate constant weight rescaling, interpreted as NOR-gate digital circuits.
-
Creating Hierarchical Dispositions of Needs in an Agent
A hand-designed nested reward formula with a secondary multi-output network is claimed to improve PPO on Pendulum-v1, but the method is underspecified and the evidence is anecdotal.
Discussion (0). Continue with ORCID to comment.