Evidence map›Paper›PMID 29921910›Full record

ArticleNature communications2018

Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science.

Decebal Constantin Mocanu, Elena Mocanu, Peter Stone, Phuong H Nguyen, Madeleine Gibescu, Antonio Liotta

Abstract read
In one paragraph

Article in Nature communications, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 41 papers.

0numbers the graph read from it
0cells of the map it votes in
41citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

41 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
  4. Article
  5. Review
  6. Article
  7. Article
  8. Article
  9. Review
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Review
  18. Perturbation of deep autoencoder weights for model compression and classification of tabular data.Neural networks : the official journal of the International Neural Network Society · 2022
    Article
  19. Article
  20. Non-smooth Bayesian learning for artificial neural networks.Journal of ambient intelligence and humanized computing · 2022
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Decebal Constantin MocanuDepartment of Mathematics and Computer Science, Eindhoven University of Technology, De Rondom 70, 5612 AP, Eindhoven, The Netherlands. d.c.mocanu@tue.nl.ORCID http://orcid.org/0000-0002-5636-7683
Elena MocanuDepartment of Electrical Engineering, Eindhoven University of Technology, De Rondom 70, 5612 AP, Eindhoven, The Netherlands.ORCID http://orcid.org/0000-0002-0856-579X
Peter StoneDepartment of Computer Science, The University of Texas at Austin, 2317 Speedway, Stop D9500, Austin, TX, 78712-1757, USA.
Phuong H NguyenDepartment of Electrical Engineering, Eindhoven University of Technology, De Rondom 70, 5612 AP, Eindhoven, The Netherlands.
Madeleine GibescuDepartment of Electrical Engineering, Eindhoven University of Technology, De Rondom 70, 5612 AP, Eindhoven, The Netherlands.
Antonio LiottaData Science Centre, University of Derby, Lonsdale House, Quaker Way, Derby, DE1 3HD, UK.ORCID http://orcid.org/0000-0002-2773-4421

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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.

Identifiers

PMID29921910
PMCPMC6008460

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.