Pith. Sign in

RECORD

Approximating nonlinear functions with latent boundaries in low-rank excitatory-inhibitory spiking networks

Neurons and Cognition · Submitted 18 Jul 2023

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim The computation of the resulting networks can be understood as the difference of two convex functions and is thereby capable of approximating arbitrary non-linear input-output mappings.

how it is stated · asserted 0.98 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2307.09334 (version 3)
Pith IDGOC3TMRJ, Pith's permanent record of this paper and its review
CitationChristian K. Machens, William F. Podlaski. "Approximating nonlinear functions with latent boundaries in low-rank excitatory-inhibitory spiking networks." arXiv:2307.09334 (2023). https://pith.science/paper/GOC3TMRJ
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,618 input tokens.

What the abstract itself states, as probabilities: claims first 0.08 · states limitation 0.96 · human participants 0.02 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.38 · compares with prior results 0.44 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; .

Deep feedforward and recurrent rate-based neural networks have become successful functional models of the brain, but they neglect obvious biological details such as spikes and Dale's law. Here we argue that these details are crucial in order to understand how real neural circuits operate. Towards this aim, we put forth a new framework for spike-based computation in low-rank excitatory-inhibitory spiking networks. By considering populations with rank-1 connectivity, we cast each neuron's spiking threshold as a boundary in a low-dimensional input-output space. We then show how the combined thresholds of a population of inhibitory neurons form a stable boundary in this space, and those of a population of excitatory neurons form an unstable boundary. Combining the two boundaries results in a rank-2 excitatory-inhibitory (EI) network with inhibition-stabilized dynamics at the intersection of the two boundaries. The computation of the resulting networks can be understood as the difference of two convex functions and is thereby capable of approximating arbitrary non-linear input-output mappings. We demonstrate several properties of these networks, including noise suppression and amplification, irregular activity and synaptic balance, as well as how they relate to rate network dynamics in the limit that the boundary becomes soft. Finally, while our work focuses on small networks (5-50 neurons), we discuss potential avenues for scaling up to much larger networks. Overall, our work proposes a new perspective on spiking networks that may serve as a starting point for a mechanistic understanding of biological spike-based computation.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Deep feedforward and recurrent rate-based neural networks have become successful functional models of the brain, but they neglect obvious biological details such as spikes and Dale's law. background 0.85 0.05 0.03 asserted 1.00
s1 Here we argue that these details are crucial in order to understand how real neural circuits operate. gap 0.52 0.13 0.08 asserted 0.95
s2 Towards this aim, we put forth a new framework for spike-based computation in low-rank excitatory-inhibitory spiking networks. contribution 0.99 0.83 0.08 asserted 0.90
s3 By considering populations with rank-1 connectivity, we cast each neuron's spiking threshold as a boundary in a low-dimensional input-output space. method 0.91 0.90 0.07 asserted 1.00
s4 We then show how the combined thresholds of a population of inhibitory neurons form a stable boundary in this space, and those of a population of excitatory neurons form an unstable boundary. result 0.94 0.93 0.09 asserted 1.00
s5 Combining the two boundaries results in a rank-2 excitatory-inhibitory (EI) network with inhibition-stabilized dynamics at the intersection of the two boundaries. method 0.40 0.87 0.13 asserted 1.00
s6 The computation of the resulting networks can be understood as the difference of two convex functions and is thereby capable of approximating arbitrary non-linear input-output mappings. result 0.72 0.90 0.58 asserted 0.98
s7 We demonstrate several properties of these networks, including noise suppression and amplification, irregular activity and synaptic balance, as well as how they relate to rate network dynamics in the limit that the boundary becomes soft. result 0.70 0.92 0.07 asserted 1.00
s8 Finally, while our work focuses on small networks (5-50 neurons), we discuss potential avenues for scaling up to much larger networks. limitation 0.78 0.59 0.04 hedged possibility 0.58
s9 Overall, our work proposes a new perspective on spiking networks that may serve as a starting point for a mechanistic understanding of biological spike-based computation. interpretation 0.65 0.58 0.38 hedged possibility 0.95

What kind of paper the classifier reports this is: theoretical result 0.89 · evidence from proof or derivation 0.65.

What was examined, and what was not

sources read
  • arXiv listing abstract v3
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Deep feedforward and recurrent rate-based neural networks have become successful functional models of the brain, but they neglect obvious biological details such as spikes and Dale's law. Here we argue that these details are crucial in order to understand how real neural circuits operate. Towards this aim, we put forth a new framework for spike-based computation in low-rank excitatory-inhibitory spiking networks. By considering populations with rank-1 connectivity, we cast each neuron's spiking threshold as a boundary in a low-dimensional input-output space. We then show how the combined thresholds of a population of inhibitory neurons form a stable boundary in this space, and those of a population of excitatory neurons form an unstable boundary. Combining the two boundaries results in a rank-2 excitatory-inhibitory (EI) network with inhibition-stabilized dynamics at the intersection of the two boundaries. The computation of the resulting networks can be understood as the difference of two convex functions and is thereby capable of approximating arbitrary non-linear input-output mappings. We demonstrate several properties of these networks, including noise suppression and amplification, irregular activity and synaptic balance, as well as how they relate to rate network dynamics in the limit that the boundary becomes soft. Finally, while our work focuses on small networks (5-50 neurons), we discuss potential avenues for scaling up to much larger networks. Overall, our work proposes a new perspective on spiking networks that may serve as a starting point for a mechanistic understanding of biological spike-based computation.

Human review
How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it

Cites it as background 1 paper
  • Recently, this low-rank framework has been applied to analyze the low-rank excitatory-inhibitory spiking networks, with a focus either on mean-field analysis of random networks [ref] , decomposition of synaptic input into factor based (partially trained and low-rank) and non-factor based (random) components [ref] , or on the capability of approximating arbitrary non-linear input-output mappings using small size networks [ref] .

    Spiking mode-based neural networks · Introduction · 0.94

What it cites · 1 sentence without a confident label

Compares with 1 paper
  • Many previous models, in contrast, typically start with Dale's law as a biological constraint, then attempt to achieve performance on par with an unconstrained network, and finally reflect on the potential benefits of such a constraint for, e.g., stability or robustness [ref] .

    The computational and learning benefits of Daleian neural networks · Discussion · 0.80

Cites as background 2 papers
  • More generally, the spike-coding framework has been extended in various ways for other computational aims (e.g., [ref] ), as well as to incorporate additional biologically-plausible details or activity regimes (e.g., [ref] ), and it will be interesting to see how our perspective here may be integrated with these other studies.

    Closed-form control with spike coding networks · Discussion · 0.95

  • Functional models of static input-output mappings are perhaps best represented by feedforward rate networks [ref] .

    Spiking Deep Networks with LIF Neurons · Discussion · 0.93

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.