The global geometry of optimal neural representations

Efficient coding hypothesizes that neural activity optimally represents information under resource constraints. The global structures of such optimal population codes are difficult to study theoretically, and previous works have usually resorted to either focusing on local properties like fine discrimination or placing restrictions on the parametric forms of neural tuning. We address the general problem by analytically deriving the neural representation that minimizes the all-pairs average classification error of a one-dimensional circular variable under various forms of neural response noise. Our method is based on formulating the space of neural response distributions as a statistical manifold whose geometry can be simplified through a generalized version of variance-stabilizing transformations. The theory fully characterizes the complete family of optimal population codes and allows us to make two novel predictions. First, an optimal code should allow the existence of oppositely peaked bimodal tuning curves. Second, there should be a correlation between spike count variability and tuning sharpness. We validate both of these predictions in the mouse head direction system.

Authors

Institutions

Publication Details

Journal
bioRxiv (Cold Spring Harbor Laboratory)
Published
2026-11-18
DOI
https://doi.org/10.64898/2026.11.17.767450
Primary Topic
Neural dynamics and brain function
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The global geometry of optimal neural representations

Brent Doiron, Gengshuo John Tian
1 links
bioRxiv (Cold Spring Harbor Laboratory)
Neural dynamics and brain function
preprint

The global geometry of optimal neural representations

Brent Doiron, Gengshuo John Tian
preprint en

Abstract

Efficient coding hypothesizes that neural activity optimally represents information under resource constraints. The global structures of such optimal population codes are difficult to study theoretically, and previous works have usually resorted to either focusing on local properties like fine discrimination or placing restrictions on the parametric forms of neural tuning. We address the general problem by analytically deriving the neural representation that minimizes the all-pairs average classification error of a one-dimensional circular variable under various forms of neural response noise. Our method is based on formulating the space of neural response distributions as a statistical manifold whose geometry can be simplified through a generalized version of variance-stabilizing transformations. The theory fully characterizes the complete family of optimal population codes and allows us to make two novel predictions. First, an optimal code should allow the existence of oppositely peaked bimodal tuning curves. Second, there should be a correlation between spike count variability and tuning sharpness. We validate both of these predictions in the mouse head direction system.

bioRxiv (Cold Spring Harbor Laboratory)
University of Chicago (US)
Neural dynamics and brain function
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon