Temporal smoothness constraints on efficient neurobiological codes imply temporal specialization
Abstract
Neurobiological circuits may be energy efficient in part because there is a division of labor: different subsystems compute or represent different things. In light of this, it is interesting that a major difference between subsystems is the time scale on which they typically vary. Here, we argue that temporal smoothness constraints---the idea that it may be energetically costly for systems to vary much more quickly than their typical time scale---imply a certain division of labor with respect to temporal stimulus features. In particular, slow subsystems ought to represent slowly varying stimulus features, and fast subsystems ought to represent quickly varying features. We formulate a novel efficient coding model that we use to investigate this claim, and exactly solve for the optimal division of labor. In addition to finding that slower subsystems ought to represent more slowly varying temporal features, we find surprising structure of mathematical interest: optimal codes have subsystems which represent orthogonal temporal features, and which correspond to the eigenfunctions of a Sturm-Liouville problem.
Related
- Temporal and spatial atlas of eosinophil specialization across tissues
- Maturational constraints on tracking of temporal attention in infant language acquisition.
- Efficient phenotyping of banana (Musa spp.) germplasm for resistance to five biotic constraints using Partially replicated (P-rep) design.
- Constrained Hebbian learning supports efficient representational allocation under structural constraints.
- Parameter-Efficient Adaptation of Protein Language Models for Dual-Target Antimicrobial Peptide Discovery Under Strict Homology Constraints
BibTeX
@misc{vastola2026temporal,
title = {{Temporal smoothness constraints on efficient neurobiological codes imply temporal specialization}},
author = {John J. Vastola and Samuel J. Gershman},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.36272},
eprint = {2610.36272},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.36272},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Temporal smoothness constraints on efficient neurobiological codes imply temporal specialization
AU - John J. Vastola
AU - Samuel J. Gershman
PY - 2026
DA - 2026/10/26
PB - arXiv
DO - 10.48550/arxiv.2610.36272
UR - https://arxiv.org/abs/2610.36272
AB - Neurobiological circuits may be energy efficient in part because there is a division of labor: different subsystems compute or represent different things. In light of this, it is interesting that a major difference between subsystems is the time scale on which they typically vary. Here, we argue that temporal smoothness constraints---the idea that it may be energetically costly for systems to vary much more quickly than their typical time scale---imply a certain division of labor with respect to temporal stimulus features. In particular, slow subsystems ought to represent slowly varying stimulus features, and fast subsystems ought to represent quickly varying features. We formulate a novel efficient coding model that we use to investigate this claim, and exactly solve for the optimal division of labor. In addition to finding that slower subsystems ought to represent more slowly varying temporal features, we find surprising structure of mathematical interest: optimal codes have subsystems which represent orthogonal temporal features, and which correspond to the eigenfunctions of a Sturm-Liouville problem.
ER -