Approximations of shannonmutual information for discrete variables with applications to neural population coding

Wentao Huang, Kechen Zhang

Research output: Contribution to journalArticlepeer-review

Abstract

Although Shannon mutual information has been widely used, its effective calculation is often difficult for many practical problems, including those in neural population coding. Asymptotic formulas based on Fisher information sometimes provide accurate approximations to the mutual information but this approach is restricted to continuous variables because the calculation of Fisher information requires derivatives with respect to the encoded variables. In this paper, we consider information-theoretic bounds and approximations of the mutual information based on Kullback-Leibler divergence and Rényi divergence. We propose several information metrics to approximate Shannon mutual information in the context of neural population coding. While our asymptotic formulas all work for discrete variables, one of them has consistent performance and high accuracy regardless of whether the encoded variables are discrete or continuous. We performed numerical simulations and confirmed that our approximation formulas were highly accurate for approximating the mutual information between the stimuli and the responses of a large neural population. These approximation formulas may potentially bring convenience to the applications of information theory tomany practical and theoretical problems.

Original languageEnglish (US)
JournalUnknown Journal
StatePublished - Mar 4 2019

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'Approximations of shannonmutual information for discrete variables with applications to neural population coding'. Together they form a unique fingerprint.

Cite this