Evidence map›Paper›PMID 33500352›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2021

Neural network interpretation using descrambler groups.

Jake L Amey, Jake Keeley, Tajwar Choudhury, Ilya Kuprov

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.

0numbers the graph read from it
0cells of the map it votes in
9citing 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

9 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Review
  8. Article
  9. 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

4 authors.

Jake L AmeySchool of Chemistry, University of Southampton, Southampton SO17 1BJ, United Kingdom.ORCID 0000-0002-2597-3808
Jake KeeleySchool of Chemistry, University of Southampton, Southampton SO17 1BJ, United Kingdom.ORCID 0000-0001-5368-4010
Tajwar ChoudhurySchool of Chemistry, University of Southampton, Southampton SO17 1BJ, United Kingdom.
Ilya KuprovSchool of Chemistry, University of Southampton, Southampton SO17 1BJ, United Kingdom i.kuprov@soton.ac.uk.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The lack of interpretability and trust is a much-criticized feature of deep neural networks. In fully connected nets, the signaling between inner layers is scrambled because backpropagation training does not require perceptrons to be arranged in any particular order. The result is a black box; this problem is particularly severe in scientific computing and digital signal processing (DSP), where neural nets perform abstract mathematical transformations that do not reduce to features or concepts. We present here a group-theoretical procedure that attempts to bring inner-layer signaling into a human-readable form, the assumption being that this form exists and has identifiable and quantifiable features-for example, smoothness or locality. We applied the proposed method to DEERNet (a DSP network used in electron spin resonance) and managed to descramble it. We found considerable internal sophistication: the network spontaneously invents a bandpass filter, a notch filter, a frequency axis rescaling transformation, frequency-division multiplexing, group embedding, spectral filtering regularization, and a map from harmonic functions into Chebyshev polynomials-in 10 min of unattended training from a random initial guess.

Indexed as

digital signal processingelectron spin resonanceinterpretabilitymachine learning

Identifiers

PMID33500352
PMCPMC7865153

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.