Bacterial Reservoir Computing

---
name: bacterial-reservoir-computing
description: "Bacterial metabolic models as physical reservoirs for computation. dFBA simulations of microbial growth curves as reservoir states. Separability and similarity metrics predict performance. Activation: reservoir computing, bacterial model, biological computation, dFBA."
---

# What Makes a Bacterial Model a Good Reservoir Computer?

> arXiv:2604.19850 — Laura Alonso Bartolomé, Jean-Loup Faulon, Xavier Hinaut

## Metadata
- **Source**: arXiv:2604.19850
- **Authors**: Laura Alonso Bartolomé, Jean-Loup Faulon, Xavier Hinaut
- **Published**: 2025-04
- **Relevance**: medium
- **URL**: https://arxiv.org/abs/2604.19850

## Core Methodology

### Key Innovation
Biological systems are promising substrates for computation because they naturally process environmental information through complex internal dynamics. In this study, we investigate whether bacterial metabolic models can act as physical reservoirs and whether their computational performance can be predicted from dynamical properties linked to separability and similarity. We simulated the growth dynamics of five bacterial species, one yeast species, and 29 Escherichia coli single-gene deletion mu

### Technical Framework
tants using dynamic flux balance analysis (dFBA), with glucose and xylose concentrations as inputs and growth curves as reservoir states. Computational performance was assessed on random nonlinear classification tasks using a linear readout, while reservoir properties linked to separability and similarity were characterised through kernel and generalisation ranks computed from growth-curve state matrices. Several microbial models achieved high classification accuracy, showing that bacterial metabolic dynamics can support nonlinear computation. Clear differences were observed between species, with some models converging more rapidly and others reaching higher maximum accuracy, revealing a trade-off between convergence speed and peak performance. In contrast, all E. coli mutants were dominated by the wild-type model, suggesting that gene deletions reduce the dynamical richness required for efficient computation. The difference between kernel and generalisation ranks was generally associated with improved accuracy, but deviations across models and sensitivity at low rank values limited its predictive power in practice.

## Implementation Guide

### Prerequisites
- Python environment with scientific computing libraries
- Access to paper's supplementary materials at https://arxiv.org/abs/2604.19850

### Step-by-Step
1. Read the full paper at https://arxiv.org/abs/2604.19850
2. Identify the core algorithm/framework from the methodology section
3. Implement the key components as described in the paper
4. Validate using the paper's reported benchmarks

## Applications
- Neuroscience research
- Computational neuroscience
- Neural network design and optimization

## Pitfalls
- Results may be preliminary (preprint)
- Reproducibility depends on availability of code/data

## Related Skills
- computational-neuroscience-models
- neural-population-dynamics
- spiking-neural-network-training