SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1707.04780 · 2017

Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science

arXiv · PDF · Open in the Atlas

Code that ran

3 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 2 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/1707.04780.json · badge: /api/ran/1707.04780.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
copy not recorded community
not in the paper's declared repositories
3 ran · 0 no recorded run
FunctionStatusWhere it lives
createSparseWeights Ran
ran; our contract draft was wrong, not the code
this paper's copy was not recorded; identical code first harvested from dcmocanu/sparse-evolutionary-artificial-neural-networks
pointer only · get_code("d1dd6b1240c82834")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

find_first_pos Ran
ran, honoured the contract we drafted
this paper's copy was not recorded; identical code first harvested from joostPieterse/CosineSET
pointer only; the stored copy get_code serves, from joostPieterse/CosineSET, is pointer only (licence: NONE) · get_code("09540a28779b66ce")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

find_last_pos Ran
ran, honoured the contract we drafted
this paper's copy was not recorded; identical code first harvested from joostPieterse/CosineSET
pointer only; the stored copy get_code serves, from joostPieterse/CosineSET, is pointer only (licence: NONE) · get_code("6c42c3044030b535")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
find_first_pos 4 other papers
4 later
1901.09181 (2019-01)
Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardware
1903.07138 (2019-03)
A Brain-inspired Algorithm for Training Highly Sparse Neural Networks
2006.14085 (2020-06)
Topological Insights into Sparse Neural Networks
and 1 more not named here
find_last_pos 3 other papers
3 later
1901.09181 (2019-01)
Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardware
1903.07138 (2019-03)
A Brain-inspired Algorithm for Training Highly Sparse Neural Networks
2006.14085 (2020-06)
Topological Insights into Sparse Neural Networks
createSparseWeights 2 other papers
2 later
1901.09181 (2019-01)
Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardware
2006.14085 (2020-06)
Topological Insights into Sparse Neural Networks

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Through the success of deep learning in various domains, artificial neural networks are currently among the most used artificial intelligence methods. Taking inspiration from the network properties of biological neural networks (e.g. sparsity, scale-freeness), we argue that (contrary to general practice) artificial neural networks, too, should not have fully-connected layers. Here we propose sparse evolutionary training of artificial neural networks, an algorithm which evolves an initial sparse topology (Erdős-Rényi random graph) of two consecutive layers of neurons into a scale-free topology, during learning. Our method replaces artificial neural networks fully-connected layers with sparse ones before training, reducing quadratically the number of parameters, with no decrease in accuracy. We demonstrate our claims on restricted Boltzmann machines, multi-layer perceptrons, and convolutional neural networks for unsupervised and supervised learning on 15 datasets. Our approach has the potential to enable artificial neural networks to scale up beyond what is currently possible.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1707.04780")
get_code_for_paper("1707.04780")
have("1707.04780")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1707.04780.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1707.04780.svg)](https://syntology.ai/paper/1707.04780)

Connect an agent — have() is free.