Search bioRxivSearch

Biology subjects

Pillow, J. W.

Publications and source records attributed to Pillow, J. W..

11 recordsLinked to original sources

Discrete stepping and nonlinear ramping dynamics underlie spiking responses of LIP neurons during decision-making

Neurons in macaque area LIP exhibit gradual ramping in their trial-averaged spike responses during sensory decision-making. However, recent work has sparked debate over whether single-trial LIP spike trains are better described by discrete \"stepping\" or continuous drift-diffusion (\"ramping\") dynamics. Here we address this controversy using powerful model-based analyses of LIP spike responses. We extended latent dynamical models of LIP spike trains to incorporate non-Poisson spiking, baseline firing rates, and various nonlinear relationships between the latent variable and firing rate. Moreover, we used advanced model-comparison methods, including cross-validation and a fully Bayesian information criterion, to evaluate and compare models. These analyses revealed that when non-Poisson spiking was incorporated into existing stepping and ramping models, a majority of neurons remained better described by stepping dynamics, even when conditioning on evidence level or choice. However, an extended ramping model with a non-zero baseline and a compressive output nonlinearity accounted for roughly as many neurons as the stepping model. The latent dynamics inferred under this model exhibited high diffusion variance for many neurons, making them qualitatively different than slowly-evolving continuous dynamics. These findings generalized to alternative tasks, suggesting that a robust fraction of LIP neurons are better described by each model class.

neuroscience

Representational structure or task structure? Bias in neural representational similarity analysis and a Bayesian method for reducing bias

The activity of neural populations in the brains of humans and animals can exhibit vastly different spatial patterns when faced with different tasks or environmental stimuli. The degree of similarity between these neural activity patterns in response to different events is used to characterize the representational structure of cognitive states in a neural population. The dominant methods of investigating this similarity structure first estimate neural activity patterns from noisy neural imaging data using linear regression, and then examine the similarity between the estimated patterns. Here, we show that this approach introduces spurious bias structure in the resulting similarity matrix, in particular when applied to fMRI data. This problem is especially severe when the signal-to-noise ratio is low and in cases where experimental conditions cannot be fully randomized in a task. We propose Bayesian Representational Similarity Analysis (BRSA), an alternative method for computing representational similarity, in which we treat the covariance structure of neural activity patterns as a hyper-parameter in a generative model of the neural data. By marginalizing over the unknown activity patterns, we can directly estimate this covariance structure from imaging data. This method offers significant reductions in bias and allows estimation of neural representational similarity with previously unattained levels of precision at low signal-to-noise ratio. The probabilistic framework allows for jointly analyzing data from a group of participants. The method can also simultaneously estimate a signal-to-noise ratio map that shows where the learned representational structure is supported more strongly. Both this map and the learned covariance matrix can be used as a structured prior for maximum a posteriori estimation of neural activity patterns, which can be further used for fMRI decoding. We make our tool freely available in Brain Imaging Analysis Kit (BrainIAK).\n\nAuthor summaryWe show the severity of the bias introduced when performing representational similarity analysis (RSA) based on neural activity pattern estimated within imaging runs. Our Bayesian RSA method significantly reduces the bias and can learn a shared representational structure across multiple participants. We also demonstrate its extension as a new multi-class decoding tool.

neuroscience

Error-correcting dynamics in visual working memory

Working memory is critical to cognition, decoupling behavior from the immediate world. Yet, it is imperfect; internal noise introduces errors into memory representations (1, 2). Such errors accumulate over time (3-5) and increase with the number of items simultaneously held in working memory (6-10). Here, we show that error-correcting attractor dynamics mitigate the impact of noise on working memory. These dynamics pull memories towards a few stable representations in mnemonic space, inducing a bias in memory representations but reducing the effect of noise. Model-based and model-free analyses show attractor dynamics account for the frequency, bias, and precision of working memory reports in both humans and monkeys. Furthermore, attractor dynamics were optimized to the context; they adapted to the statistics of the environment, such that memories drifted towards contextually-predicted values. Our results suggest attractor dynamics mediate errors in working memory by counteracting noise and integrating contextual information into memories.

neuroscience

Inferring synaptic inputs from spikes with a conductance-based neural encoding model

A popular approach to the study of information processing in the nervous system is to char-acterize neural responses in terms of a cascade of linear and nonlinear stages: a linear filter to describe the neurons stimulus integration properties, followed by a rectifying nonlinearity to convert filter output to spike rate. However, real neurons integrate stimuli via the modula-tion of nonlinear excitatory and inhibitory synaptic conductances. Here we introduce a bio-physically inspired point process model with conductance-based inputs. The model provides a novel interpretation of the popular Poisson generalized linear model (GLM) as a special kind of conductance-based model, where excitatory and inhibitory conductances are modulated in a \"push-pull\" manner so that total conductance remains constant. We relax this constraint to obtain a more general and flexible \"conductance-based encoding model\" (CBEM), which can exhibit stimulus-dependent fluctuations in gain and dynamics. We fit the model to spike trains of macaque retinal ganglion cells and show that, remarkably, we can accurately infer underlying inhibitory and excitatory conductances, using comparisons to intracellularly measured conductances. Using extracellular data, we corroborate the intracellular finding that synaptic excitation temporally precedes inhibition in retina. We show that the CBEM outperforms the classic GLM at predicting retinal ganglion cell responses to full-field stimuli, generalizes better across contrast levels, and captures inhibition-dependent response properties to spatially structured stimuli. The CBEM provides a powerful tool for gaining insights into the intracellular variables governing spiking, and forges an important link between extracellular characterization methods and biophysically detailed response models.

neuroscience

Adaptive stimulus selection for multi-alternative psychometric functions with lapses

Psychometric functions (PFs) quantify how external stimuli affect behavior and play an important role in building models of sensory and cognitive processes. Adaptive stimulus selection methods seek to select stimuli that are maximally informative about the PF given data observed so far in an experiment and thereby reduce the number of trials required to estimate the PF. Here we develop new adaptive stimulus selection methods for flexible PF models in tasks with two or more alternatives. We model the PF with a multinomial logistic regression mixture model that incorporates realistic aspects of psychophysical behavior, including lapses and multiple alternatives for the response. We propose an information-theoretic criterion for stimulus selection and develop computationally efficient methods for inference and stimulus selection based on semi-adaptive Markov Chain Monte Carlo (MCMC) sampling. We apply these methods to data from macaque monkeys performing a multi-alternative motion discrimination task, and show in simulated experiments that our method can achieve a substantial speed-up over random designs. These advances will reduce the data needed to build accurate models of multi-alternative PFs and can be extended to high-dimensional PFs that would be infeasible to characterize with standard methods.

animal behavior and cognition

Running reduces firing but improves coding in rodent higher-order visual cortex

Running profoundly alters stimulus-response properties in mouse primary visual cortex (V1), but its effects in higher-order visual cortex remain unknown. Here we systematically investigated how locomotion modulates visual responses across six visual areas and three cortical layers using a massive dataset from the Allen Brain Institute. Although running has been shown to increase firing in V1, we found that it suppressed firing in higher-order visual areas. Despite this reduction in gain, visual responses during running could be decoded more accurately than visual responses during stationary periods. We show that this effect was not attributable to changes in noise correlations, and propose that it instead arises from increased reliability of single neuron responses during running.

neuroscience

Scalable Bayesian inference for high-dimensional neural receptive fields

We examine the problem of rapidly and efficiently estimating a neurons linear receptive field (RF) from responses to high-dimensional stimuli. This problem poses important statistical and computational challenges. Statistical challenges arise from the need for strong regularization when using correlated stimuli in high-dimensional parameter spaces, while computational challenges arise from extensive time and memory costs associated with evidence-optimization and inference in high-dimensional settings. Here we focus on novel methods for scaling up automatic smoothness determination (ASD), an empirical Bayesian method for RF estimation, to high-dimensional settings. First, we show that using a zero-padded Fourier domain representation and a \"coarse-to-fine\" evidence optimization strategy gives substantial improvements in speed and memory, while maintaining exact numerical accuracy. We then introduce a suite of scalable approximate methods that exploit Kronecker and Toeplitz structure in the stimulus autocovariance, which can be related to the method of expected log-likelihoods [1]. When applied together, these methods reduce the cost of estimating an RF with tensor order D and d coefficients per tensor dimension from O(d3D) time and O(d2D) space for standard ASD to O(Dd log d) time and O(Dd) space. We show that evidence optimization for a linear RF with 160K coefficients using 5K samples of data can be carried out on a laptop in < 2s.

neuroscience

Bayesian Efficient Coding

The efficient coding hypothesis, which proposes that neurons are optimized to maximize information about the environment, has provided a guiding theoretical framework for sensory and systems neuroscience. More recently, a theory known as the Bayesian Brain hypothesis has focused on the brains ability to integrate sensory and prior sources of information in order to perform Bayesian inference. Although pieces of a connection between these two hypotheses have appeared in prior work, a general formulation that treats the optimality criterion as an arbitrary functional of the posterior distribution - and thereby admits both information-theoretic and non-information-theoretic objectives within a single formalism - has remained largely implicit. Here we make this formulation explicit, developing a Bayesian theory of efficient coding that defines Bayesian efficient codes in terms of four basic ingredients: (1) a stimulus prior distribution; (2) an encoding model; (3) a capacity constraint, specifying a neural resource limit; and (4) a loss functional, quantifying the desirability or undesirability of various posterior distributions. Classic efficient codes arise as the special case in which the loss functional is the posterior entropy, leading to a code that maximizes mutual information, but alternate loss functionals give solutions that differ dramatically from information-maximizing codes. Within this framework we introduce covtropy, a novel family of posterior-functional losses parameterized by a single exponent, and use it to show that decorrelation of sensory inputs - optimal under classic efficient codes in low-noise settings - can be disadvantageous for objectives that penalize large errors. We then reanalyze Laughlins seminal data on contrast coding in the blowfly large monopolar cell, and find that the measured response nonlinearity is better explained by minimizing Lp reconstruction error with p = 1/2 than by infomax, overturning a forty-year-old interpretation. Bayesian efficient coding thus enlarges the family of normatively optimal codes and provides a more general framework for understanding the design principles of sensory systems. Author summarySensory neurons work under tight budgets. They represent a rich, noisy world with limited spikes, limited dynamic range, and limited energy. Two long-standing ideas address this problem. One, called efficient coding, asks why neurons encode signals in the ways they do: which signals to amplify, which to filter out. A second, the Bayesian brain hypothesis, asks how the brain turns those signals into a percept: how to combine sensory evidence with prior knowledge to form a best guess about the world. We develop a framework that asks both questions at once. An optimal sensory code in our framework is specified by four interlocking ingredients: a prior description of the world, a model of how neurons respond to it, a limit on the resources they can spend, and a rule for what counts as a good internal representation. Classical information-maximizing codes emerge as one special case, one corner of a much larger family of Bayesian efficient codes. Applying this framework to Laughlins 1981 blowfly experiment, long held up as the textbook example of information maximization, we find that the flys neurons are better explained by minimizing decoding error than by maximizing information.

neuroscience

Dethroning the Fano Factor: a flexible, model-based approach to partitioning neural variability

Neurons in many brain areas exhibit high trial-to-trial variability, with spike counts that are over-dispersed relative to a Poisson distribution. Recent work (Goris et al., 2014) has proposed to explain this variability in terms of a multiplicative interaction between a stochastic gain variable and a stimulus-dependent Poisson firing rate, which produces quadratic relationships between spike count mean and variance. Here we examine this quadratic assumption and propose a more flexible family of models that can account for a more diverse set of mean-variance relationships. Our model contains additive Gaussian noise that is transformed nonlinearly to produce a Poisson spike rate. Different choices of the nonlinear function can give rise to qualitatively different mean-variance relationships, ranging from sub-linear to linear to multiplicative. Intriguingly, a rectified squaring nonlinearity produces a linear mean-variance function, corresponding to responses with constant Fano factor. We describe a computationally efficient method for fitting this model to data, and demonstrate that a majority of neurons in a V1 population are better described by a model with non-quadratic relationship between mean and variance. Lastly, we develop an application to Bayesian adaptive stimulus selection in closed-loop neurophysiology experiments, which shows that accounting for overdispersion can lead to dramatic improvements in adaptive tuning curve estimation.

neuroscience

No cause for pause: new analyses of ramping and stepping dynamics in LIP (Rebuttal to Response to Reply to Comment on Latimer et al. 2015)

We recently presented a statistical comparison between two models of latent dynamics in macaque lateral intraparietal (LIP) area spike trains--a continuous ramping (diffusion-to-bound) model, and a discrete stepping model--and found that a substantial fraction of neurons (recorded in two different studies) were better supported by the stepping model (Latimer et al., 2015). Here, we respond to a recent challenge to the validity of these findings that focuses primarily on the possibility of a lower bound on LIP firing rates (Zylberberg & Shadlen, 2016). The paper in question proposed alternate formulations of the ramping model, and argued (via indirect analyses) that half the neurons in the population were better explained by the new model; if correct, this would lead to an even split in the number of neurons better explained by each model. These analyses, while interesting, do not alter the conclusions of our original paper. Here, we review the criticisms raised by Zylberberg & Shadlen and report several new analyses using models with lower bounds. First, we show that the stepping model continued to provide a better description of LIP spike trains when fit using only an early period of each trial. Second, we performed a direct model comparison between our stepping model and a ramping-with-baseline model proposed by Zylberberg & Shadlen; we found that (in a pleasing moment of agreement) roughly half the neurons were better explained by each model. Interestingly, inspection of the cells that switched classifications revealed that many did not strictly exhibit the classical ramping PSTHs that motivated these analyses in the first place. We also examined two other issues raised in recent discussions of LIP: (1) We show that a non-integrating model is consistent with some core aspects of behavioral data previously offered as evidence for continuous integration; and (2) We examine analyses based on the response covariance (\"CorCE\"), and show that it does not reliably distinguish ramping and stepping dynamics for our dataset. Taken together, these discussions highlight the value of data-driven characterizations of both neural and behavioral dynamics with appropriate statistical tools.

neuroscience

Discovering event structure in continuous narrative perception and memory

SummaryDuring realistic, continuous perception, humans automatically segment experiences into discrete events. Using a novel model of neural event dynamics, we investigate how cortical structures generate event representations during continuous narratives, and how these events are stored and retrieved from long-term memory. Our data-driven approach enables identification of event boundaries and event correspondences across datasets without human-generated stimulus annotations, and reveals that different regions segment narratives at different timescales. We also provide the first direct evidence that narrative event boundaries in high-order areas (overlapping the default mode network) trigger encoding processes in the hippocampus, and that this encoding activity predicts pattern reinstatement during recall. Finally, we demonstrate that these areas represent abstract, multimodal situation models, and show anticipatory event reinstatement as subjects listen to a familiar narrative. Our results provide strong evidence that brain activity is naturally structured into semantically meaningful events, which are stored in and retrieved from long-term memory.

neuroscience