Stable fixed points of combinatorial threshold-linear networks

DOI10.1016/J.AAM.2023.102652zbMATH Open1530.37064arXiv1909.02947OpenAlexW2971423343MaRDI QIDQ6138049FDOQ6138049

Katherine Morrison, Carina Curto, Jesse Geneson

Publication date: 16 January 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: Combinatorial threshold-linear networks (CTLNs) are a special class of recurrent neural networks whose dynamics are tightly controlled by an underlying directed graph. Recurrent networks have long been used as models for associative memory and pattern completion, with stable fixed points playing the role of stored memory patterns in the network. In prior work, we showed that target-free cliques of the graph correspond to stable fixed points of the dynamics, and we conjectured that these are the only stable fixed points possible. In this paper, we prove that the conjecture holds in a variety of special cases, including for networks with very strong inhibition and graphs of size $nleq4$. We also provide further evidence for the conjecture by showing that sparse graphs and graphs that are nearly cliques can never support stable fixed points. Finally, we translate some results from extremal combinatorics to upper bound the number of stable fixed points of CTLNs in cases where the conjecture holds.

Full work available at URL: https://arxiv.org/abs/1909.02947

zbMATH Keywords

cliquesCollatz-Wielandt formulaattractor neural networksstable fixed pointsthreshold-linear networks

Mathematics Subject Classification ID

Boundary value problems on graphs and networks for ordinary differential equations (34B45) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25) Stability theory for smooth dynamical systems (37C75) Dynamical systems involving maps of trees and graphs (37E25)

Cites Work

• Neural networks and physical systems with emergent collective computational abilities.
• On cliques in graphs
• The maximum number of cliques in dense graphs
• On cliques in graphs
• The worst-case time complexity for generating all maximal cliques and computational experiments
• Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks
• Modeling Brain Function
• Optimal control problems for a class of non-linear evolution equations
• Encoding Binary Neural Codes in Networks of Threshold-Linear Neurons
• Rat Prefrontal Cortex Inactivations during Decision Making Are Explained by Bistable Attractor Dynamics
• On cliques in graphs
• Selectively Grouping Neurons in Recurrent Networks of Lateral Inhibition
• Fixed Points of Competitive Threshold-Linear Networks
• Sequential Attractors in Combinatorial Threshold-Linear Networks
• Pattern Completion in Symmetric Threshold-Linear Networks
• Flexible memory networks
• Title not available (Why is that?)
• Graph Rules for Recurrent Neural Network Dynamics

This page was built for publication: Stable fixed points of combinatorial threshold-linear networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138049)