Skip to content

Mini Review

Frontiers in Computational Neuroscience ·

Volume 20 - 2026 | https://doi.org/10.3389/fncom.2026.1924396

Design principles for cost functions in optimal sensory coding

  • Veronika Koren1*corresponding author
  • Stefano Panzeri1*corresponding author
  1. Institute for Neural Information Processing, University Medical Center Hamburg-Eppendorf (UKE), Hamburg, Germany
Article metrics0 viewsView details

Abstract

Studies of neural codes for sensory variables are rooted in the long-established principle that neural codes are organized to encode as much information as possible about sensory stimuli. This principle has been successful in explaining many features of neural activity, suggesting that a key component of a cost function determining sensory neural coding from first principles is the stimulus encoding error. However, recent work has shown that neural cost functions may have other terms reflecting costs or limitations of the biological hardware. One key piece is the metabolic cost of neural activity. Including metabolic cost in the cost function leads to optimized spiking models that exhibit spike-triggered adaptation. Another possible component of the neural cost function is reliable downstream transmission of information. Neurons have short integration time constants, which make it difficult for information to be transmitted reliably unless inputs to neurons are correlated. This suggests that cost functions accounting for constraints on downstream readout promote codes with redundancy-inducing correlations. We review and discuss evidence that neural codes in the brain have features consistent with the predictions expected if cost functions have additional terms beyond the encoding error. Adaptation currents are indeed present in biological neurons with the time scales predicted by metabolically efficient codes, and neural population codes have information-reducing correlations that support downstream information transmission. Finally, we discuss future directions important for fully establishing the different contributions to neural cost functions.

Keywords

Introduction

A central question for understanding biological intelligence concerns the principles determining how sensory information is encoded, processed and transmitted through the activity of neurons and neural populations. Seminal early work introduced the idea that sensory information processing should be analyzed in terms of the information carried by neural signals and the constraints imposed by their finite signaling capacity. Normative theories of neural computation proposed that sensory systems are organized to maximize information about external stimuli (Barlow, 1961; Laughlin, 1981), or to minimize errors in stimulus reconstruction, prediction, or dynamical representation (Olshausen and Field, 1996; Rao and Ballard, 1999). These theories have provided powerful frameworks for understanding neural activity in terms of the computations it supports. In particular, they have provided compelling explanations for observed neural activity features such as response non-linearities, adaptation to stimulus statistics, and redundancy reduction in early sensory systems (Simoncelli and Olshausen, 2001).

The optimality of a neural code depends on the criteria used to define it. These criteria are formalized by a cost function that needs to be minimized to achieve optimality. The traditionally considered cost function focuses on accurately encoding input stimuli and has been operationalized as the root mean squared error or minus the mutual information between the neurally-represented and target sensory signals. However, a cost function might contain other components in addition to the term for sensory encoding. Neural activity is metabolically expensive (Lennie, 2003), and spikes and synaptic transmission impose significant costs on the organism (Niven and Laughlin, 2008). Thus, a neural cost function may also contain a metabolic cost term that penalizes high activity levels. Adding metabolic constraints to the cost function can substantially change which sensory representations are optimal compared with costs based on encoding accuracy alone. Further, information present in one neural population is not necessarily fully available to downstream circuits. Downstream neurons read out information through biophysical mechanisms with short integration windows and non-linear input-output functions which are more effective when operating on correlated population activity. Therefore, cost functions may also include downstream-readout constraints and favor neural codes that differ from codes optimized only for stimulus encoding, such as codes with redundant correlations (Panzeri et al., 2022).

Here, we review studies suggesting that cost functions of biological neural populations may include constraints beyond those for optimal sensory coding. We focus on constraints that we investigated in our recent work, namely metabolic cost (Koren and Panzeri, 2022; Koren et al., 2025) and downstream readout (Runyan et al., 2017; Valente et al., 2021; Safaai et al., 2025; Ibáñez-Berganza et al., 2025), and discuss experimental observations supporting this view. We discuss both how these constraints can be applied to cost functions defined at the single neuron level, potentially explaining experimental properties of single neurons, or at the population level, potentially revealing the consequences for optimal computations of different types of relationships between neurons and enabling the design of optimal networks.

Efficient coding based on sensory encoding and adaptation to stimulus statistics

An early formulation of efficient coding is the hypothesis that neurons and neural systems optimize a cost function maximizing the information they encode about external stimuli (Barlow, 1961; Attneave, 1954). A central result of studies investigating optimal neural coding of sensory information is that sensory coding must adapt to the statistical properties of the sensory stimuli. Because the neural response range is limited, efficient codes should allocate their range preferentially to stimulus values that occur frequently or carry high behavioral relevance, which means that optimal sensory responses should reflect key aspects of the statistics of the stimuli that an organism encounters.

Because of this, neurons and networks optimizing sensory coding must also adapt optimally to changes in stimulus statistics. Experimental and theoretical work has provided evidence that neurons in the sensory periphery and sensory cortex adjust their responses to changes in the distribution of sensory stimuli (Simoncelli and Olshausen, 2001). Fairhall et al. (2001) showed that a single neuron (H1) in the fly sensory system adapts to changes in stimulus variance by rescaling its input-output function. When stimulus variance increased, the input-output function became shallower and covered a wider range of stimulus values. When stimulus variance decreased, it instead became steeper and concentrated sensitivity over a narrower stimulus range. Mlynarski and Hermundstad (2021) extended this work considering the information-theoretic optimal adaptation of neural population responses to changes in stimulus statistics. They derived population codes that optimally trade-off the need to encode accurately the current incoming stimuli with the contrasting need to detect and adapt to sudden changes in stimulus statistics. These optimal population codes have properties closely resembling those observed in real cortical population responses during adaptation.

Together, these studies show the power of sensory-encoding-based cost functions to understand from first principles the responses of neurons and populations to sensory stimuli.

Trade-off between encoding error and metabolic cost

Because neural activity is metabolically expensive, neural computations are likely constrained by metabolic expenditure (Attwell and Laughlin, 2001). Thus, several studies incorporated metabolic cost into single neuron or population cost functions. At the level of single neurons, Wang et al. (2016) analytically derived monotonic tuning curves that optimize information transmission for given stimulus statistics under metabolic constraints, finding that metabolic constraints strongly shape sensory tuning curves. When the metabolic constraint is not included, information-optimal tuning curves follow the histogram equalization principle suggested by Laughlin (1981), so that neural response levels are used uniformly across the available dynamic range. Including the metabolic constraint instead biases responses toward lower firing rates.

Other models introduced metabolic constraints at the level of neural populations. Instead of focusing on how neural populations minimize their encoding error when stimulus statistics changes, these studies asked how a neural population optimizes its parameters for a fixed stimulus distribution under both sensory coding and metabolic constraints. The problem of designing such efficient recurrent networks has been addressed first with rate models (Zhu and Rozell, 2013; Kafashan and Ching, 2017; Rullán Buxó and Pillow, 2020; Prat-Carrabin et al., 2026; Kadmon et al., 2020) and then with spiking-neuron models (hereafter termed models of efficient coding with spikes). Here, we focus on models of efficient coding with spikes because they are more biologically plausible.

These models have considered how a whole recurrent neural network can minimizes the sum of a population-level encoding error of a time-dependent stimulus signal and a population-level metabolic cost of spiking (Denève and Machens, 2016). The encoding error penalizes inaccurate representations of the target signal, whereas the metabolic cost penalizes recent spiking activity. Minimizing this efficiency cost function therefore favors accurate signal representation with few spikes. The occurrence of each spike is conditioned on a decrease of the instantaneous loss. Each spike is thus timed to decrease the loss. More generally, fine-grained spike timing allows more information to be processed with the same number of spikes and may reduce energy cost relative to implementations not exploiting it (Verzi et al., 2018).

The efficient-coding cost function can be implemented by recurrently connected networks of leaky integrate-and-fire neurons (Bourdoukan et al., 2012). The structured recurrent connectivity derived from the cost function shapes network activity in both stimulus-driven and spontaneous states (Koren and Denève, 2017). Efficient spiking models reproduce empirically observed levels of single-neuron variability and yield neural representations that are robust to neuronal loss (Barrett et al., 2016), neuron-intrinsic noise, synaptic delays (Chalk et al., 2018, 2016) and perturbations to population activity (Calaim et al., 2022). Moreover, local learning rules can approximate the optimal synaptic connectivity prescribed by analytical derivations of efficiency cost functions by maintaining time-dependent balance between excitatory (E) and inhibitory (I) synaptic currents in the presence of error feedback signal (Alemi et al., 2018; Denève et al., 2017).

A key property of biological networks is Dale's law: a neuron uses the same neurotransmitter on all of its outgoing synapses. Unlike what happens when using cost functions that do not separate neurons into cell types, assigning separate cost functions to E and I neurons yields E-I efficient spiking networks that obey Dale's law (Koren and Panzeri, 2022; Boerlin et al., 2013). By design, efficient E-I spiking networks keep firing rates and representational error bounded at all times (Urdu et al., 2025). In such E-I efficient networks, parameters that optimize the trade-off between average encoding error and metabolic cost correspond to a biologically realistic parameter set that matches measurements from primary sensory cortex (Koren et al., 2025). These results indicate that E-I-specific cost functions that trade off encoding accuracy against metabolic cost can capture key properties of sensory cortical networks and highlight the relevance of cell-type-specific cost functions.

In a series of studies, we and others investigated the effect of including metabolic cost in the cost function in networks designed to encode low-dimensional time-varying signals, that is, signals made of few independent features (Koren and Panzeri, 2022; Koren et al., 2025; Koren and Denève, 2017; Boerlin et al., 2013; Gutierrez and Denève, 2019; Zeldenrust et al., 2021). In such networks, metabolic cost adds a constant term to the firing threshold (Boerlin et al., 2013), reducing spike probability. When single-neuron and population readouts have different time constants, the same cost function also prescribes neuron-intrinsic currents (Koren and Panzeri, 2022). Under additional constraints, these currents can produce slow (Gutierrez and Denève, 2019) or fast spike-triggered adaptation (Koren et al., 2025). Spike-triggered adaptation transiently hyperpolarizes the membrane potential after a spike and reduces subsequent excitability, with an amplitude that increases with the relative weight of metabolic cost in the cost function. Thus, metabolic cost does not only suppress firing but also changes the timing of spikes selected by the efficiency cost function. These results suggest that the after hyperpolarization currents widely observed in biological neurons (Shao et al., 1999; Storm, 1987) may be understood as the result of optimizing sensory coding while controlling its metabolic cost.

We asked whether adding metabolic cost to sensory coding cost affects the optimized network parameters and resulting neural response features (Koren and Panzeri, 2022; Koren et al., 2025). We first derived properties of networks designed to optimize a cost function that includes both encoding error and metabolic cost. To illustrate the specific contribution of the metabolic cost, we then compared networks optimized either for encoding error alone or for the sum of encoding error and metabolic cost, while keeping everything else identical (Figure 1A). We jointly optimized four parameters: the membrane time constant, the noise intensity, the ratio of E to I neuron numbers, and the ratio of average I-I to E-I connectivity strength. After optimization, both models tracked time-dependent target signals with similar accuracy (Figure 1B, black for target signals and red for E-population estimates). However, they converged to distinct parameter regimes. Compared with networks optimizing encoding error and metabolic cost, networks optimizing encoding error alone had lower noise and weaker inhibition, while the E-I neuron number ratio did not differ systematically between the two cost functions (Figure 1C, black and magenta for networks optimizing error alone and the sum of error and cost). Differences in optimized parameters translated into differences in network activity (Figure 1D). The network optimizing the encoding error alone had slightly higher firing rates and significantly lower trial-to-trial variability. In particular, the network including metabolic cost had Fano Factor (the ratio of the variance to the mean across trials of spike counts) close to 1, whereas the network optimizing only the coding error had Fano Factor close to 0.5. These differences are consistent with the lower noise intensity and weaker inhibition (Figure 1C). Thus, optimizing metabolic cost does not simply reduce firing, but shapes response variability. Because the trial-to-trial variability of sensory cortical neurons is close to that of a Poisson process (Churchland et al., 2010), including metabolic cost makes the activity of efficient spiking networks more biologically realistic.

Metabolic cost changes networks optimized for encoding accuracy. **(A)** Schematic of the optimization procedure. We optimized networks minimizing either the encoding error alone **(left)** or a linear sum of encoding error and metabolic cost (right; as in Ref. Koren et al., 2025). Both models have the same E-I architecture, receive the same stimulus s(t), and estimate the same target signal x(t). The encoding error is the average of the E- and I-population encoding errors. The E-population encoding error is the squared error between the E-population readout and the target signal x(t). The I-population encoding error is the squared error between the E- and I-population readouts. The stimulus consisted of three independent Ornstein-Uhlenbeck processes. **(B)** The target signal (solid black) and E-population readout (signal estimate; dashed red) in the best performing network minimizing the encoding error alone **(top)** or the sum of the encoding error and the metabolic cost **(bottom)**. The best network minimizing the linear sum of encoding error and metabolic cost recovered the same set of parameters as reported in Ref. (Koren et al., 2025). **(C)** Parameters of the 15 best networks (lowest training loss) minimizing the encoding error alone (black) or the sum of the encoding error and the metabolic cost (magenta). The error bars show the mean ± standard deviation. The non-zero optimal noise levels found in both network types **(left)** are consistent with analytical results (Timcheck et al., 2022) **(D)** Firing rate **(left)**, Fano factor **(middle)** and the time-averaged net sum of E and I synaptic inputs to single neurons **(right)** computed on the best performing network of each type. Results are shown for E (red) and I neurons (blue). I neurons have higher firing rates and therefore higher metabolic expenditure than E neurons in both network types. The Fano factor, which measures spike-count variability, is significantly lower in the network minimizing the encoding error alone. Further, the net synaptic input in I neurons is dominated by excitation in the network minimizing the encoding error and dominated by inhibition in the network minimizing the sum of the encoding error and the metabolic cost, indicating a transition between the two network types from an excitation-dominated to an inhibition-dominated regime in I neurons. In both network types, the time-averaged net synaptic input is also more negative in E than in I neurons. Each distribution is across neurons. For (**B–D)**, we used 100 parameter initializations and 5 random seeds. All initializations reached convergence. For (**B)** and **(D)**, we tested network performance on new Ornstein-Uhlenbeck stimuli generated with the same parameters as the training stimuli. For (**D)**, we used 100 simulation trials of 1 s duration and averaged results across trials. The Fano factor was measured on spike counts in 100 ms time bins. Please note that panels C (middle), C (right), and D (middle) report unitless quantities.
Figure 1. Metabolic cost changes networks optimized for encoding accuracy. (A) Schematic of the optimization procedure. We optimized networks minimizing either the encoding error alone (left) or a linear sum of encoding error and metabolic cost (right; as in Ref. Koren et al., 2025). Both models have the same E-I architecture, receive the same stimulus s(t), and estimate the same target signal x(t). The encoding error is the average of the E- and I-population encoding errors. The E-population encoding error is the squared error between the E-population readout and the target signal x(t). The I-population encoding error is the squared error between the E- and I-population readouts. The stimulus consisted of three independent Ornstein-Uhlenbeck processes. (B) The target signal (solid black) and E-population readout (signal estimate; dashed red) in the best performing network minimizing the encoding error alone (top) or the sum of the encoding error and the metabolic cost (bottom). The best network minimizing the linear sum of encoding error and metabolic cost recovered the same set of parameters as reported in Ref. (Koren et al., 2025). (C) Parameters of the 15 best networks (lowest training loss) minimizing the encoding error alone (black) or the sum of the encoding error and the metabolic cost (magenta). The error bars show the mean ± standard deviation. The non-zero optimal noise levels found in both network types (left) are consistent with analytical results (Timcheck et al., 2022) (D) Firing rate (left), Fano factor (middle) and the time-averaged net sum of E and I synaptic inputs to single neurons (right) computed on the best performing network of each type. Results are shown for E (red) and I neurons (blue). I neurons have higher firing rates and therefore higher metabolic expenditure than E neurons in both network types. The Fano factor, which measures spike-count variability, is significantly lower in the network minimizing the encoding error alone. Further, the net synaptic input in I neurons is dominated by excitation in the network minimizing the encoding error and dominated by inhibition in the network minimizing the sum of the encoding error and the metabolic cost, indicating a transition between the two network types from an excitation-dominated to an inhibition-dominated regime in I neurons. In both network types, the time-averaged net synaptic input is also more negative in E than in I neurons. Each distribution is across neurons. For (B–D), we used 100 parameter initializations and 5 random seeds. All initializations reached convergence. For (B) and (D), we tested network performance on new Ornstein-Uhlenbeck stimuli generated with the same parameters as the training stimuli. For (D), we used 100 simulation trials of 1 s duration and averaged results across trials. The Fano factor was measured on spike counts in 100 ms time bins. Please note that panels C (middle), C (right), and D (middle) report unitless quantities.

Further, a cost function with only encoding-error optimization prescribes structured recurrent connectivity that in turn promotes temporal E-I balance, defined as the ability to maintain a tight balance of E and I synaptic inputs to each neuron at each time instant (Denève and Machens, 2016). Including the metabolic constraint increased temporal E-I balance (Koren et al., 2025) and enforced an inhibition-dominated regime, in which I synaptic inputs were stronger than E inputs (Figure 1D, right; see ref Koren et al., 2025). Including the metabolic cost therefore resulted in neural dynamics consistent with two empirical observations in sensory cortex: synaptic excitation and inhibition are coordinated over time (Okun and Lampl, 2008), and inhibition often dominates (Haider et al., 2013).

Trade-offs between information encoding and information transmission

The notion that neural codes optimize information encoding has also permeated the study of neural population codes (Dupret et al., 2026; Nigam et al., 2019; Averbeck et al., 2006). Many studies considered which features of population activity enhance the amount of information encoded in a neural population, under the assumption that neural population codes maximize encoding of information within the same population. For example, several studies have investigated how the information encoded by populations depends on the sparseness of neural representations (intuitively, the fraction of active neurons at any given time), finding that very low values of sparseness maximize the information per spike, a measure which combines encoding quality and metabolic cost (Dupret et al., 2026; Finkelstein et al., 2018; Kira et al., 2023).

A feature of neural activity that has received substantial attention in terms of its contribution to the encoded information is the correlations between neurons (Panzeri et al., 2022; Averbeck et al., 2006). Modeling studies have investigated how the strength and structure of correlations between neurons affect the amount of information about sensory stimuli that the responses of a population carry (Abbott and Dayan, 1999; Panzeri et al., 1999; Averbeck and Lee, 2006). Correlations between the activity of different neurons can either increase, decrease or leave unchanged the information carried by a population. Their effect depends on several factors, the main one being the relative sign of noise and signal correlations. Noise correlations quantify the correlations between the activity of neurons at fixed stimulus. Signal correlations quantify the correlations between the trial-averaged activity across different stimuli. When signal and noise correlations have the same sign, noise correlations decrease information (Figure 2A, left). When they have opposite signs, noise correlations increase information (Figure 2A, right). In most experimental studies on sensory cortices or decision-making areas, noise correlations were found to decrease information. This was shown by comparing information decoded from the real simultaneously recorded responses of the neural population (which contains noise correlations) and the decoding of the stimulus from pseudo-population responses obtained from randomly shuffling responses of different neurons from trial to the same stimulus to destroy noise correlations (as in Figure 2A, center). The information in shuffled responses is often higher than that in the real responses (Panzeri et al., 2022; Bartolo et al., 2020; Rumyantsev et al., 2020; Golledge et al., 2003).

Illustration of how noise correlations shape information encoding and transmission. **(A)** We use cartoons of response distributions (ellipses) of populations of neurons (*N*<sub>1</sub>, *N*<sub>2</sub>) in the space of neural population activity (using *n* = 2 neurons) in response to two stimuli (blue and red). Across panels, single neuron properties are the same but noise correlations vary. Left: Positive noise correlations between neurons with positive signal correlations decrease the amount of encoded information about stimulus (overlapping distributions being harder to discriminate) with respect to population activity without noise correlations (as on the Middle panel, in which noise correlations are absent). Noise correlations with sign opposite to those of signal correlations (e.g., the former negative and the latter positive, as in the Right panel) increase stimulus information. Stimulus information in these figures can be conceptualized as the inverse of the overlap of the two distributions: the less overlap there is, the fewer decoding errors there will be. **(B)** Transmission of information through coincidence detection. Left panels: A neuron with a short integration time constant (green window) that receives stimulus-modulated presynaptic input spike trains from two different neurons produces a stronger output firing rate when receiving correlated (top left) than uncorrelated **(bottom left)** inputs. This is because correlations increase the number of time points with coincident input spikes compared with when receiving inputs with the same individual-neuron characteristics but no correlations. Right panels: analysis of the models shows that although input correlations reduce the stimulus information encoded in the inputs, the stimulus information transmitted by the output neuron can increase with the strength of input correlations.
Figure 2. Illustration of how noise correlations shape information encoding and transmission. (A) We use cartoons of response distributions (ellipses) of populations of neurons (N1, N2) in the space of neural population activity (using n = 2 neurons) in response to two stimuli (blue and red). Across panels, single neuron properties are the same but noise correlations vary. Left: Positive noise correlations between neurons with positive signal correlations decrease the amount of encoded information about stimulus (overlapping distributions being harder to discriminate) with respect to population activity without noise correlations (as on the Middle panel, in which noise correlations are absent). Noise correlations with sign opposite to those of signal correlations (e.g., the former negative and the latter positive, as in the Right panel) increase stimulus information. Stimulus information in these figures can be conceptualized as the inverse of the overlap of the two distributions: the less overlap there is, the fewer decoding errors there will be. (B) Transmission of information through coincidence detection. Left panels: A neuron with a short integration time constant (green window) that receives stimulus-modulated presynaptic input spike trains from two different neurons produces a stronger output firing rate when receiving correlated (top left) than uncorrelated (bottom left) inputs. This is because correlations increase the number of time points with coincident input spikes compared with when receiving inputs with the same individual-neuron characteristics but no correlations. Right panels: analysis of the models shows that although input correlations reduce the stimulus information encoded in the inputs, the stimulus information transmitted by the output neuron can increase with the strength of input correlations.

These results suggest that a neural code optimized solely for population-level encoding should not contain information-limiting correlations. However, such correlations are commonly found in cortical data (Panzeri et al., 2022; Averbeck et al., 2006). Does this imply that neural population codes are not designed optimally? Or does it mean that they are designed optimally with a cost function containing terms other than encoding? A clue to this answer was found in a series of recordings from mouse cortex during perceptual decisions, which reported that correlations were information limiting but yet were stronger in trials in which mice made correct perceptual judgments, compared to trials when mice made incorrect judgements (Runyan et al., 2017; Valente et al., 2021; Safaai et al., 2025; Francis et al., 2022).

One possibility to explain these results is that the downstream readout of information to produce choices is facilitated by correlations. We demonstrated this in a recent study in which we constructed a statistical model of single-trial choices made by the mouse based on the information in neural activity in the same trial. We found that the probability of making a choice that followed the stimulus inferred as the most likely by decoding neural activity was higher when responses of neurons were more correlated (Valente et al., 2021; Safaai et al., 2025; Francis et al., 2022). This implies that information encoded in the activity of neurons can be more effectively used for downstream decisions if responses have some level of correlations. We also studied this with biophysical models of propagation of synaptic signals through the membrane of a neuron (Figure 2B). Because of short membrane integration time constants, activity is better propagated if correlations cluster spikes closer to each other in time (Figure 2B). An analytical study of this model (Ibáñez-Berganza et al., 2025) shows that moderate, intermediate correlation strength maximizes the amount of information transmitted through the membrane of the neuron (Figure 2B). The values of correlations maximizing the amount of transmitted information are roughly comparable to the range of values observed in cortical neurons (Ibáñez-Berganza et al., 2025).

These results suggests that neural codes are not optimized to encode information locally, but to trade off the need to encode information with the need to transmit it. How to optimally trade off these demands may depend on the primary function of the brain area, with a study suggesting that population codes in sensory areas have weaker correlations to weigh more sensory coding and populations in decision-making areas have stronger correlations to weigh more downstream transmission (Runyan et al., 2017).

Discussion

Sensory-encoding-based neural cost functions have proven successful for explaining response properties of sensory neurons. We reviewed how adding additional biologically-plausible constrains may change these results. Adding constraints on metabolic expenditure leads to designing biologically plausible E-I networks that reproduce additional single-neuron and network-level properties of sensory cortex. Adding constraints on downstream readability leads to population codes that allow redundant correlations to promote information transmission to downstream areas at the cost of possibly reducing the encoded information.

A first direction for future work is to understand how to jointly optimize encoding accuracy, transmission to downstream readouts, and metabolic cost. Multilayer spiking networks provide a natural setting, because they allow cost functions that constrain both the encoding of information at one layer and their transmission across layers. Such models could form important theoretical counterparts to empirical studies of organization of neural codes in projection pathways (Safaai et al., 2025). We hypothesize that incorporating information transmission into cost functions would lead to networks with higher across-neuron correlation strength.

A second direction is to ask how richer computations can be implemented efficiently. Cortical neurons often non-linearly combine different afferent features. For example, primary somatosensory neurons non-linearly combine information from different types of skin receptors (Emanuel et al., 2021). It remains unknown how to capture complex feature interactions, for example mutually amplificatory and suppressive interactions, in efficient coding models. Other important computations include linear dynamical signal transformations, such as converting transient inputs into damped oscillations (Bourdoukan and Denève, 2015), and non-linear transformations, such as generating persistent attractor states (Alemi et al., 2018).

A third direction is to understand the relationship between efficient coding and low-rank recurrent networks (Mastrogiuseppe and Ostojic, 2018; Cimeša et al., 2023), especially those producing target outputs that solve cognitive tasks (Dubreuil et al., 2022). The recurrent connectivity optimizing cost functions with sensory and metabolic cost has low-rank structure determined by the dimensionality of the encoded stimuli (Koren et al., 2025; Boerlin et al., 2013). It would be interesting to examine how metabolic cost may change the optimal connectivity rank, for example selecting among degenerate solutions by preserving stiff dimensions that strongly affect coding performance while suppressing energetically costly dimensions with little coding benefit.

Generative AI statement

The author(s) declared that Generative AI was not used in the creation of this manuscript.

Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.

Publisher's note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

Footnotes

Edited by: Alireza Alemi, University of California, Davis, CA, United States

Reviewed by: Carlotta Martelli, Johannes Gutenberg University Mainz, Germany

Yuya Sato, Waseda University, Japan

Mario Antoine Aoun, Concordia University, Canada

Statements

Conflict of interest

The author(s) declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Funding

The author(s) declared that financial support was received for this work and/or its publication. This work was supported by the German Federal Ministry of Education and Research (BMBF 01GQ2404).

Author contributions

VK: Conceptualization, Writing – original draft, Writing – review & editing, Visualization. SP: Conceptualization, Writing – original draft, Writing – review & editing.

Acknowledgements

We thank S. Deneve, S. Blanco Malerba, G. Bondanelli and T. Schwalger for valuable collaborations.

References

  1. Abbott L. F., Dayan P. (1999). The effect of correlated variability on the accuracy of a population code. Neural Comput. 11, 91 – 101. doi: doi:10.1162/089976699300016827
  2. Alemi A., Machens C., Deneve S. (2018). “Learning nonlinear dynamics in efficient, balanced spiking networks using local plasticity rules,” in AAAI Conference on Artificial Intelligence (Burnaby: PKP Publishing Services Network). doi: doi:10.1609/aaai.v32i1.11320
  3. Attneave F. (1954). Some informational aspects of visual perception. Psychol. Rev. 61, 183 – 193. doi: doi:10.1037/h0054663
  4. Attwell D., Laughlin S. B. (2001). An energy budget for signaling in the grey matter of the brain. J. Cereb. Blood Flow Metab. 21, 1133 – 1145. doi: doi:10.1097/00004647-200110000-00001
  5. Averbeck B. B., Latham P. E., Pouget A. (2006). Neural correlations, population coding and computation. Nat. Rev. Neurosci. 7, 358 – 366. doi: doi:10.1038/nrn1888
  6. Averbeck B. B., Lee D. (2006). Effects of noise correlations on information encoding and decoding. J. Neurophysiol. 95, 3633 – 3644. doi: doi:10.1152/jn.00919.2005
  7. Barlow H. B. (1961). Possible principles underlying the transformation of sensory messages. Sens. Commun. 1, 217 – 234.
  8. Barrett D. G. T., Denève S., Machens C. K. (2016). Optimal compensation for neuron loss. eLife 5: e12454. doi: doi:10.7554/eLife.12454
  9. Bartolo R., Saunders R. C., Mitz A. R., Averbeck B. B. (2020). Information-Limiting Correlations in Large Neural Populations. J. Neurosci. 40, 1668 – 1678. doi: doi:10.1523/JNEUROSCI.2072-19.2019
  10. Boerlin M., Machens C. K., Denève S. (2013). Predictive coding of dynamical variables in balanced spiking networks. PLOS Comput. Biol. 9: e1003258. doi: doi:10.1371/journal.pcbi.1003258
  11. Bourdoukan R., Barrett D. G. T., Denève S., Machens C. K. (2012). Learning optimal spike-based representations. Adv. Neural Inf. Process. Syst. 25, 2294 – 2302.
  12. Bourdoukan R., Denève S. (2015). Enforcing balance allows local supervised learning in spiking recurrent networks. Adv. Neural Inf. Process. Syst. 28, 982 – 990.
  13. Calaim N., Dehmelt F. A., Gonçalves P. J., Machens C. K. (2022). The geometry of robustness in spiking neural networks. eLife 11: e73276. doi: doi:10.7554/eLife.73276
  14. Chalk M., Gutkin B., Denève S. (2016). Neural oscillations as a signature of efficient coding in the presence of synaptic delays. eLife 5: e13824. doi: doi:10.7554/eLife.13824
  15. Chalk M., Marre O., Tkačik G. (2018). Toward a unified theory of efficient, predictive, and sparse coding. Proc. Natl. Acad. Sci. 115, 186 – 191. doi: doi:10.1073/pnas.1711114115
  16. Churchland M. M., Yu B. M., Cunningham J. P., Sugrue L. P., Cohen M. R., Corrado G. S. (2010). Stimulus onset quenches neural variability: a widespread cortical phenomenon. Nat. Neurosci. 13, 369 – 378. doi: doi:10.1038/nn.2501
  17. Cimeša L., Ciric L., Ostojic S. (2023). Geometry of population activity in spiking networks with low-rank structure. PLOS Comput. Biol. 19: e1011315. doi: doi:10.1371/journal.pcbi.1011315
  18. Denève S., Alemi A., Bourdoukan R. (2017). The brain as an efficient and robust adaptive learner. Neuron 94, 969 – 977. doi: doi:10.1016/j.neuron.2017.05.016
  19. Denève S., Machens C. K. (2016). Efficient codes and balanced networks. Nat. Neurosci. 19, 375 – 382. doi: doi:10.1038/nn.4243
  20. Dubreuil A., Valente A., Beiran M., Mastrogiuseppe F., Ostojic S. (2022). The role of population structure in computations through neural dynamics. Nat. Neurosci. 25, 783 – 794. doi: doi:10.1038/s41593-022-01088-4
  21. Dupret D., Fusi S., Panzeri S. (2026). Neural population activity for memory: properties, computations, and codes. Neuron 114, 390 – 407. doi: doi:10.1016/j.neuron.2025.11.007
  22. Emanuel A. J., Lehnert B. P., Panzeri S., Harvey C. D., Ginty D. D. (2021). Cortical responses to touch reflect subcortical integration of LTMR signals. Nature 600, 680 – 685. doi: doi:10.1038/s41586-021-04094-x
  23. Fairhall A. L., Lewen G. D., Bialek W., de Ruyter van Steveninck R. R. (2001). Efficiency and ambiguity in an adaptive neural code. Nature 412, 787 – 792. doi: doi:10.1038/35090500
  24. Finkelstein A., Ulanovsky N., Tsodyks M., Aljadeff J. (2018). Optimal dynamic coding by mixed-dimensionality neurons in the head-direction system of bats. Nat. Commun. 9: 3590. doi: doi:10.1038/s41467-018-05562-1
  25. Francis N. A., Mukherjee S., Kocillari L., Panzeri S., Babadi B., Kanold P. O. (2022). Sequential transmission of task-relevant information in cortical neuronal networks. Cell. Rep. 39: 110878. doi: doi:10.1016/j.celrep.2022.110878
  26. Golledge H., Panzeri S., Zheng F., Pola G., Scannell J., Giannikopoulos D.. (2003).Correlations, feature-binding and population coding in primary visual cortex. NeuroReport 14, 1045 – 1050. doi: doi:10.1097/00001756-200305230-00028
  27. Gutierrez G. J., Denève S. (2019). Population adaptation in efficient balanced networks. eLife 8: e46926. doi: doi:10.7554/eLife.46926
  28. Haider B., Häusser M., Carandini M. (2013). Inhibition dominates sensory responses in the awake cortex. Nature 493, 97 – 100. doi: doi:10.1038/nature11665
  29. Ibáñez-Berganza M., Bondanelli G., Panzeri S. (2025). Theory of enhanced-by-coincidence neural information transmission. Phys. Rev. Res. 7: 033155. doi: doi:10.1103/9bcy-g5sx
  30. Kadmon J., Timcheck J., Ganguli S. (2020). Predictive coding in balanced neural networks with noise, chaos and delays. Adv. Neural Inf. Process. Syst. (NeurIPS) 33, 16677 – 16688.
  31. Kafashan M., Ching S. (2017). Recurrent networks with soft-thresholding nonlinearities for lightweight coding. Neural Netw. 94, 212 – 219. doi: doi:10.1016/j.neunet.2017.07.008
  32. Kira S., Safaai H., Morcos A. S., Panzeri S., Harvey C. D. (2023). A distributed and efficient population code of mixed selectivity neurons for flexible navigation decisions. Nat. Commun. 14: 2121. doi: doi:10.1038/s41467-023-37804-2
  33. Koren V., Blanco Malerba S., Schwalger T., Panzeri S. (2025). Efficient coding in biophysically realistic excitatory-inhibitory spiking networks. eLife 13: RP99545. doi: doi:10.7554/eLife.99545.4.sa4
  34. Koren V., Denève S. (2017). Computational account of spontaneous activity as a signature of predictive coding. PLOS Comput. Biol. 13: e1005355. doi: doi:10.1371/journal.pcbi.1005355
  35. Koren V., Panzeri S. (2022). Biologically plausible solutions for spiking networks with efficient coding. Adv. Neural Inf. Process. Syst. 35, 20607 – 20620. doi: doi:10.52202/068431-1498
  36. Laughlin S. (1981). A simple coding procedure enhances a neuron's information capacity. Z. Naturforsch. C 36, 910 – 912. doi: doi:10.1515/znc-1981-9-1040
  37. Lennie P. (2003). The cost of cortical computation. Curr. Biol. 13, 493 – 497. doi: doi:10.1016/S0960-9822(03)00135-0
  38. Mastrogiuseppe F., Ostojic S. (2018). Linking connectivity, dynamics, and computations in low-rank recurrent neural networks. Neuron 99, 609 – 623.e29. doi: doi:10.1016/j.neuron.2018.07.003
  39. Mlynarski W. F., Hermundstad A. M. (2021). Efficient and adaptive sensory codes. Nat. Neurosci. 24, 998 – 1009. doi: doi:10.1038/s41593-021-00846-0
  40. Nigam S., Pojoga S., Dragoi V. (2019). Synergistic coding of visual information in columnar networks. Neuron 104, 402 – 411.e4. doi: doi:10.1016/j.neuron.2019.07.006
  41. Niven J. E., Laughlin S. B. (2008). Energy limitation as a selective pressure on the evolution of sensory systems. J. Exp. Biol. 211, 1792 – 1804. doi: doi:10.1242/jeb.017574
  42. Okun M., Lampl I. (2008). Instantaneous correlation of excitation and inhibition during ongoing and sensory-evoked activities. Nat. Neurosci. 11, 535 – 537. doi: doi:10.1038/nn.2105
  43. Olshausen B. A., Field D. J. (1996). Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381, 607 – 609. doi: doi:10.1038/381607a0
  44. Panzeri S., Moroni M., Safaai H., Harvey C. D. (2022). The structures and functions of correlations in neural population codes. Nat. Rev. Neurosci. 23, 551 – 567. doi: doi:10.1038/s41583-022-00606-4
  45. Panzeri S., Schultz S. R., Treves A., Rolls E. T. (1999). Correlations and the encoding of information in the nervous system. Proc. Biol. Sci. 266, 1001 – 1012. doi: doi:10.1098/rspb.1999.0736
  46. Prat-Carrabin A., Harl M. V., Gershman S. J. (2026). Fast efficient coding and sensory adaptation in gain-adaptive recurrent networks. Nat. Commun. 17: 5554. doi: doi:10.1038/s41467-026-73032-0
  47. Rao R. P. N., Ballard D. H. (1999). Predictive coding in the visual cortex: a functional interpretation of some extra-classical receptive-field effects. Nat. Neurosci. 2, 79 – 87. doi: doi:10.1038/4580
  48. Rullán Buxó C. E., Pillow J. W. (2020). Poisson balanced spiking networks. PLOS Comput. Biol. 16: e1008261. doi: doi:10.1371/journal.pcbi.1008261
  49. Rumyantsev O. I., Lecoq J. A., Hernandez O., Zhang Y., Savall J., Chrapkiewicz R.. (2020). Fundamental bounds on the fidelity of sensory cortical coding. Nature 580, 100 – 105. doi: doi:10.1038/s41586-020-2130-2
  50. Runyan C. A., Piasini E., Panzeri S., Harvey C. D. (2017). Distinct timescales of population coding across cortex. Nature 548, 92 – 96. doi: doi:10.1038/nature23020
  51. Safaai H., Wang A. Y., Kira S., Blanco Malerba S., Panzeri S., Harvey C. D. (2025). Specialized structure of neural population codes in parietal cortex outputs. Nat. Neurosci. 28(12): 2550–2560. doi: doi:10.1038/s41593-025-02095-x
  52. Shao L. R., Halvorsrud R., Borg-Graham L., Storm J. F. (1999). The role of BK-type Ca2+-dependent K+ channels in spike broadening during repetitive firing in rat hippocampal pyramidal cells. J. Physiol. 521, 135 – 146. doi: doi:10.1111/j.1469-7793.1999.00135.x
  53. Simoncelli E. P., Olshausen B. A. (2001). Natural image statistics and neural representation. Annu. Rev. Neurosci. 24, 1193 – 1216. doi: doi:10.1146/annurev.neuro.24.1.1193
  54. Storm J. F. (1987). Action potential repolarization and a fast after-hyperpolarization in rat hippocampal pyramidal cells. J. Physiol. 385, 733 – 759. doi: doi:10.1113/jphysiol.1987.sp016517
  55. Timcheck J., Kadmon J., Boahen K., Ganguli S. (2022). Optimal noise level for coding with tightly balanced networks of spiking neurons in the presence of transmission delays. PLOS Comput. Biol. 18: e1010593. doi: doi:10.1371/journal.pcbi.1010593
  56. Urdu M., Lorenz G. M., Huang C. P., Panzeri S., Koren V. (2025). “Firing rates and representational error in efficient spiking networks are bounded by design,” in Artificial Neural Networks and Machine Learning – ICANN 2025: 34th International Conference on Artificial Neural Networks, Kaunas, Lithuania, September 9–12, 2025, Proceedings, Part I (Kaunas: Springer-Verlag). doi: doi:10.1007/978-3-032-04558-4_19
  57. Valente A., Pica G., Bondanelli G., Moroni M., Runyan C. A., Morcos A.. (2021). Correlations enhance the behavioral readout of neural population activity in association cortex Nat. Neurosci. 24, 975 – 986. doi: doi:10.1038/s41593-021-00845-1
  58. Verzi S. J., Rothganger F., Parekh O. D., Quach T. T., Miner N. E., Vineyard C. M.. (2018). Computing with spikes: the advantage of fine-grained timing. Neural Comput. 30, 2660 – 2690. doi: doi:10.1162/neco_a_01113
  59. Wang Z., Wei X. X., Stocker A. A., Lee D. D. (2016). Efficient neural codes under metabolic constraints. Adv. Neural Inf. Process. Syst. 29, 4619 – 4627.
  60. Zeldenrust F., Gutkin B., Denève S. (2021). Efficient and robust coding in heterogeneous recurrent networks. PLOS Comput. Biol. 17: e1008673. doi: doi:10.1371/journal.pcbi.1008673
  61. Zhu M., Rozell C. J. (2013). Visual nonclassical receptive field effects emerge from sparse coding in a dynamical system. PLOS Comput. Biol. 9: e1003191. doi: doi:10.1371/journal.pcbi.1003191

Citation

Koren, V. & Panzeri, S. (2026). Design principles for cost functions in optimal sensory coding. Frontiers in Computational Neuroscience, Volume 20. https://doi.org/
Received
Accepted
Published
Volume
20 - 2026

Copyright

Copyright © 2026 Koren and Panzeri.

License: https://creativecommons.org/licenses/by/4.0/

*Correspondence: Veronika Koren; Stefano Panzeri

Article metrics

Views
0
Downloads
0
Citations
0
Shares
0