Metabolic cost of information processing in Poisson variational autoencoders
Hadi Vafaii, Jacob L. Yates
TL;DR
This work develops an energy-aware theory of computation by analyzing variational inference under Poisson latent variables. It shows that the Poisson KL term couples information rate to metabolic rate, yielding a 'silence is cheap' objective that promotes sparsity and reduces baseline firing, a property not shared by Gaussian VAEs. The authors derive closed-form, tractable expressions for reconstruction and KL terms, contrast P-VAE with a Gaussian-rectified variant (G-ReLU-VAE), and empirically demonstrate that increasing the KL weight $\beta$ meaningfully reduces metabolic cost and increases sparsity in the Poisson model while preserving reconstruction quality. The results establish Poisson VI as a principled foundation for energy-constrained computation, with implications for energy-aware algorithm design and neuromorphic hardware.
Abstract
Computation in biological systems is fundamentally energy-constrained, yet standard theories of computation treat energy as freely available. Here, we argue that variational free energy minimization under a Poisson assumption offers a principled path toward an energy-aware theory of computation. Our key observation is that the Kullback-Leibler (KL) divergence term in the Poisson free energy objective becomes proportional to the prior firing rates of model neurons, yielding an emergent metabolic cost term that penalizes high baseline activity. This structure couples an abstract information-theoretic quantity -- the *coding rate* -- to a concrete biophysical variable -- the *firing rate* -- which enables a trade-off between coding fidelity and energy expenditure. Such a coupling arises naturally in the Poisson variational autoencoder (P-VAE) -- a brain-inspired generative model that encodes inputs as discrete spike counts and recovers a spiking form of *sparse coding* as a special case -- but is absent from standard Gaussian VAEs. To demonstrate that this metabolic cost structure is unique to the Poisson formulation, we compare the P-VAE against Grelu-VAE, a Gaussian VAE with ReLU rectification applied to latent samples, which controls for the non-negativity constraint. Across a systematic sweep of the KL term weighting coefficient $β$ and latent dimensionality, we find that increasing $β$ monotonically increases sparsity and reduces average spiking activity in the P-VAE. In contrast, Grelu-VAE representations remain unchanged, confirming that the effect is specific to Poisson statistics rather than a byproduct of non-negative representations. These results establish Poisson variational inference as a promising foundation for a resource-constrained theory of computation.
