Paul Masset
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Paul Masset has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
- Adam Kepecs
Department of Neuroscience and Department of Psychiatry, Washington University in St. Louis, St. Louis, MO, USA
7 shared publications - Venkatesh N. Murthy
Harvard University
7 shared publications - Jacob A. Zavatone-Veth
Harvard University
6 shared publications - Demba Ba
Harvard John A. Paulson School of Engineering and Applied Sciences and Kempner Institute for the Study of Natural and Artificial Intelligence, Harvard University, Cambridge, MA 02134
5 shared publications - Naoshige Uchida
Harvard University
5 shared publications - Cengiz Pehlevan
Harvard University
4 shared publications
Latest Publications
- Open Access
- 30 July 2026
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 22 (7) , e1014577
Combining sampling and attractor dynamics in spiking models of head direction systems
Neural populations can maintain stable representations of navigation-related variables while integrating uncertain sensory signals. Experimental evidence showed that the precision of head-direction (HD) representations in flies and mice depends on the reliability of sensory cues, highlighting the influence of input uncertainty in attractor-based neural circuits. How do neural dynamics maintain stability while computing under uncertainty? Here, we propose a spiking neural network that unifies two principles — stability through attraction and uncertainty through fluctuation — and reinterpret the HD circuit as an uncertainty-aware integrator rather than a deterministic compass. Specifically, the network uses sampling-based probabilistic inference, where a neural population represents input uncertainty by rapidly fluctuating among likely hypotheses about the world while preserving a stable representation of head direction along an attractor manifold. This formulation suggests why a classical HD “bump” becomes less precise, namely due to rapid fluctuations, reflecting the uncertainty in angular velocity inputs. Our implementation yields experimentally testable predictions: correlated subthreshold voltage fluctuations, multi-timescale nonlinear interaction patterns, and characteristic statistics of bump movement. By combining probabilistic inference with attractor dynamics within one single circuit, our framework suggests how neural populations across species can represent an estimate and its uncertainty through fluctuations while maintaining stability, which could be a general principle for uncertainty-aware computation in noisy biological systems.
- 30 July 2026
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 22 (7) , e1014577
Open AccessCombining sampling and attractor dynamics in spiking models of head direction systems
Neural populations can maintain stable representations of navigation-related variables while integrating uncertain sensory signals. Experimental evidence showed that the precision of head-direction (HD) representations in flies and mice depends on the reliability of sensory cues, highlighting the influence of input uncertainty in attractor-based neural circuits. How do neural dynamics maintain stability while computing under uncertainty? Here, we propose a spiking neural network that unifies two principles — stability through attraction and uncertainty through fluctuation — and reinterpret the HD circuit as an uncertainty-aware integrator rather than a deterministic compass. Specifically, the network uses sampling-based probabilistic inference, where a neural population represents input uncertainty by rapidly fluctuating among likely hypotheses about the world while preserving a stable representation of head direction along an attractor manifold. This formulation suggests why a classical HD “bump” becomes less precise, namely due to rapid fluctuations, reflecting the uncertainty in angular velocity inputs. Our implementation yields experimentally testable predictions: correlated subthreshold voltage fluctuations, multi-timescale nonlinear interaction patterns, and characteristic statistics of bump movement. By combining probabilistic inference with attractor dynamics within one single circuit, our framework suggests how neural populations across species can represent an estimate and its uncertainty through fluctuations while maintaining stability, which could be a general principle for uncertainty-aware computation in noisy biological systems.
- 20 May 2026
- Published by MIT Press in Neural Computation
- Vol. 38 (6) , 897-951
Implicit Generative Modeling by Kernel Similarity Matching
Understanding how the brain encodes stimuli has been a fundamental problem in computational neuroscience. Insights into this problem have led to the design and development of artificial neural networks that learn representations by incorporating brain-like learning abilities. Recently, learning representations by capturing similarity among input samples has been studied (Pehlevan et al., 2018) to tackle this problem. This approach, however, has thus far been used only to learn downstream features from an input and has not been studied in the context of a generative paradigm, where one can map the representations back to the input space, incorporating not only bottom-up interactions (stimuli→latent) but also learning features in a top-down manner (latent→stimuli). We investigate a kernel similarity matching framework for generative modeling. Starting with a modified sparse coding objective for learning representations proposed in prior works (Olshausen & Field, 1996; Tolooshams & Ba, 2022), we demonstrate that representation learning in this context is equivalent to maximizing similarity between the input kernel and a latent kernel. We show that an implicit generative model arises from learning the kernel structure in the latent space and show how the framework can be adapted to learn manifold structures, potentially providing insights as to how task representations can be encoded in the brain. To solve the objective, we propose a novel alternate direction method of multipliers (ADMM)–based algorithm and discuss the interpretation of the optimization process. Finally, we discuss how this representation learning problem can lead toward a biologically plausible architecture to learn the model parameters that ties together representation learning using similarity matching (a bottom-up approach) with predictive coding (a top-down approach).
- 20 May 2026
- Published by MIT Press in Neural Computation
- Vol. 38 (6) , 897-951
Implicit Generative Modeling by Kernel Similarity Matching
Understanding how the brain encodes stimuli has been a fundamental problem in computational neuroscience. Insights into this problem have led to the design and development of artificial neural networks that learn representations by incorporating brain-like learning abilities. Recently, learning representations by capturing similarity among input samples has been studied (Pehlevan et al., 2018) to tackle this problem. This approach, however, has thus far been used only to learn downstream features from an input and has not been studied in the context of a generative paradigm, where one can map the representations back to the input space, incorporating not only bottom-up interactions (stimuli→latent) but also learning features in a top-down manner (latent→stimuli). We investigate a kernel similarity matching framework for generative modeling. Starting with a modified sparse coding objective for learning representations proposed in prior works (Olshausen & Field, 1996; Tolooshams & Ba, 2022), we demonstrate that representation learning in this context is equivalent to maximizing similarity between the input kernel and a latent kernel. We show that an implicit generative model arises from learning the kernel structure in the latent space and show how the framework can be adapted to learn manifold structures, potentially providing insights as to how task representations can be encoded in the brain. To solve the objective, we propose a novel alternate direction method of multipliers (ADMM)–based algorithm and discuss the interpretation of the optimization process. Finally, we discuss how this representation learning problem can lead toward a biologically plausible architecture to learn the model parameters that ties together representation learning using similarity matching (a bottom-up approach) with predictive coding (a top-down approach).
- Open Access
- 29 April 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Perception and neural representation of intermittent odor stimuli in mice
Odor cues in nature are sparse and fluctuating due to turbulent transport. To investigate how animals perceive these intermittent cues, we developed a behavioral task in which mice made binary decisions based on the total number of discrete odor pulses presented stochastically over several seconds. Mice quickly learned this task, placing higher perceptual weight to stimuli arriving during inhalation than exhalation, a phase dependency that strongly correlated with the magnitude of responses in olfactory sensory neurons. Neurons in the anterior piriform cortex responded to odor pulses with varying degrees of dependence on respiration phase. Single cortical neurons responded stochastically and transiently to odor pulses, leading to a representation that carries signatures of sensory evidence, but not its accumulation. Our study reveals that mice can integrate intermittent odor signals across dozens of breaths and that respiratory modulation imposes limits on sensory information acquisition that cortical circuits cannot overcome to improve behavior.
- 29 April 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Open AccessPerception and neural representation of intermittent odor stimuli in mice
Odor cues in nature are sparse and fluctuating due to turbulent transport. To investigate how animals perceive these intermittent cues, we developed a behavioral task in which mice made binary decisions based on the total number of discrete odor pulses presented stochastically over several seconds. Mice quickly learned this task, placing higher perceptual weight to stimuli arriving during inhalation than exhalation, a phase dependency that strongly correlated with the magnitude of responses in olfactory sensory neurons. Neurons in the anterior piriform cortex responded to odor pulses with varying degrees of dependence on respiration phase. Single cortical neurons responded stochastically and transiently to odor pulses, leading to a representation that carries signatures of sensory evidence, but not its accumulation. Our study reveals that mice can integrate intermittent odor signals across dozens of breaths and that respiratory modulation imposes limits on sensory information acquisition that cortical circuits cannot overcome to improve behavior.
- Open Access
Simultaneous detection and estimation in olfactory sensing
The mammalian olfactory system shows an exceptional ability for rapid and accurate decoding of both the identity and concentration of odorants. Previous works have used the theory of compressed sensing to elucidate the algorithmic basis for this capability: decoding odor information from the responses of a restricted repertoire of receptors is possible because only a few relevant odorants are present in any given sensory scene. However, existing circuit models for olfactory decoding still cannot contend with the complexity of naturalistic olfactory scenes; they are limited to detection of a handful of odorants. Here, we propose a model for olfactory compressed sensing inspired by simultaneous localization and mapping algorithms in navigation, in which the set of present odors and their concentrations are inferred separately. We implement this split inference in a biologically-plausible recurrent circuit by introducing separate dynamics matched to the distinct nature of presence and concentration, and drawing on the framework of Mirrored Langevin Dynamics. This model can accurately infer presence and concentration at scale. Moreover, its circuit structure can be mapped onto the primary cell types of the olfactory bulb, giving a possible normative account for functional differences between mitral and tufted cells. Our approach offers a general path towards circuit algorithms for probabilistic inference—in olfactory sensing and beyond—that both perform well in naturalistic environments and make experimentally-testable predictions for neural response dynamics.
Open AccessSimultaneous detection and estimation in olfactory sensing
The mammalian olfactory system shows an exceptional ability for rapid and accurate decoding of both the identity and concentration of odorants. Previous works have used the theory of compressed sensing to elucidate the algorithmic basis for this capability: decoding odor information from the responses of a restricted repertoire of receptors is possible because only a few relevant odorants are present in any given sensory scene. However, existing circuit models for olfactory decoding still cannot contend with the complexity of naturalistic olfactory scenes; they are limited to detection of a handful of odorants. Here, we propose a model for olfactory compressed sensing inspired by simultaneous localization and mapping algorithms in navigation, in which the set of present odors and their concentrations are inferred separately. We implement this split inference in a biologically-plausible recurrent circuit by introducing separate dynamics matched to the distinct nature of presence and concentration, and drawing on the framework of Mirrored Langevin Dynamics. This model can accurately infer presence and concentration at scale. Moreover, its circuit structure can be mapped onto the primary cell types of the olfactory bulb, giving a possible normative account for functional differences between mitral and tufted cells. Our approach offers a general path towards circuit algorithms for probabilistic inference—in olfactory sensing and beyond—that both perform well in naturalistic environments and make experimentally-testable predictions for neural response dynamics.
- Open Access
- 4 June 2025
- Published by Springer Nature in Nature
- Vol. 642 (8068) , 682-690
Multi-timescale reinforcement learning in the brain
To thrive in complex environments, animals and artificial agents must learn to act adaptively to maximize fitness and rewards. Such adaptive behaviour can be learned through reinforcement learning1, a class of algorithms that has been successful at training artificial agents2,3,4,5 and at characterizing the firing of dopaminergic neurons in the midbrain6,7,8. In classical reinforcement learning, agents discount future rewards exponentially according to a single timescale, known as the discount factor. Here we explore the presence of multiple timescales in biological reinforcement learning. We first show that reinforcement agents learning at a multitude of timescales possess distinct computational benefits. Next, we report that dopaminergic neurons in mice performing two behavioural tasks encode reward prediction error with a diversity of discount time constants. Our model explains the heterogeneity of temporal discounting in both cue-evoked transient responses and slower timescale fluctuations known as dopamine ramps. Crucially, the measured discount factor of individual neurons is correlated across the two tasks, suggesting that it is a cell-specific property. Together, our results provide a new paradigm for understanding functional heterogeneity in dopaminergic neurons and a mechanistic basis for the empirical observation that humans and animals use non-exponential discounts in many situations9,10,11,12, and open new avenues for the design of more-efficient reinforcement learning algorithms.
- 4 June 2025
- Published by Springer Nature in Nature
- Vol. 642 (8068) , 682-690
Open AccessMulti-timescale reinforcement learning in the brain
To thrive in complex environments, animals and artificial agents must learn to act adaptively to maximize fitness and rewards. Such adaptive behaviour can be learned through reinforcement learning1, a class of algorithms that has been successful at training artificial agents2,3,4,5 and at characterizing the firing of dopaminergic neurons in the midbrain6,7,8. In classical reinforcement learning, agents discount future rewards exponentially according to a single timescale, known as the discount factor. Here we explore the presence of multiple timescales in biological reinforcement learning. We first show that reinforcement agents learning at a multitude of timescales possess distinct computational benefits. Next, we report that dopaminergic neurons in mice performing two behavioural tasks encode reward prediction error with a diversity of discount time constants. Our model explains the heterogeneity of temporal discounting in both cue-evoked transient responses and slower timescale fluctuations known as dopamine ramps. Crucially, the measured discount factor of individual neurons is correlated across the two tasks, suggesting that it is a cell-specific property. Together, our results provide a new paradigm for understanding functional heterogeneity in dopaminergic neurons and a mechanistic basis for the empirical observation that humans and animals use non-exponential discounts in many situations9,10,11,12, and open new avenues for the design of more-efficient reinforcement learning algorithms.
- Open Access
Combining Sampling Methods with Attractor Dynamics in Spiking Models of Head-Direction Systems
Uncertainty is a fundamental aspect of the natural environment, requiring the brain to infer and integrate noisy signals to guide behavior effectively. Sampling-based inference has been proposed as a mechanism for dealing with uncertainty, particularly in early sensory processing. However, it is unclear how to reconcile sampling-based methods with operational principles of higher-order brain areas, such as attractor dynamics of persistent neural representations. In this study, we present a spiking neural network model for the head-direction (HD) system that combines sampling-based inference with attractor dynamics. To achieve this, we derive the required spiking neural network dynamics and interactions to perform sampling from a large family of probability distributions—including variables encoded with Poisson noise. We then propose a method that allows the network to update its estimate of the current head direction by integrating angular velocity samples—derived from noisy inputs—with a pull towards a circular manifold, thereby maintaining consistent attractor dynamics. This model makes specific, testable predictions about the HD system that can be examined in future neurophysiological experiments: it predicts correlated subthreshold voltage fluctuations; distinctive short- and long-term firing correlations among neurons; and characteristic statistics of the movement of the neural activity “bump” representing the head direction. Overall, our approach extends previous theories on probabilistic sampling with spiking neurons, offers a novel perspective on the computations responsible for orientation and navigation, and supports the hypothesis that sampling-based methods can be combined with attractor dynamics to provide a viable framework for studying neural dynamics across the brain.
Open AccessCombining Sampling Methods with Attractor Dynamics in Spiking Models of Head-Direction Systems
Uncertainty is a fundamental aspect of the natural environment, requiring the brain to infer and integrate noisy signals to guide behavior effectively. Sampling-based inference has been proposed as a mechanism for dealing with uncertainty, particularly in early sensory processing. However, it is unclear how to reconcile sampling-based methods with operational principles of higher-order brain areas, such as attractor dynamics of persistent neural representations. In this study, we present a spiking neural network model for the head-direction (HD) system that combines sampling-based inference with attractor dynamics. To achieve this, we derive the required spiking neural network dynamics and interactions to perform sampling from a large family of probability distributions—including variables encoded with Poisson noise. We then propose a method that allows the network to update its estimate of the current head direction by integrating angular velocity samples—derived from noisy inputs—with a pull towards a circular manifold, thereby maintaining consistent attractor dynamics. This model makes specific, testable predictions about the HD system that can be examined in future neurophysiological experiments: it predicts correlated subthreshold voltage fluctuations; distinctive short- and long-term firing correlations among neurons; and characteristic statistics of the movement of the neural activity “bump” representing the head direction. Overall, our approach extends previous theories on probabilistic sampling with spiking neurons, offers a novel perspective on the computations responsible for orientation and navigation, and supports the hypothesis that sampling-based methods can be combined with attractor dynamics to provide a viable framework for studying neural dynamics across the brain.
- Open Access
Perception and neural representation of intermittent odor stimuli in mice
Odor cues in nature are sparse and highly fluctuating due to turbulent transport. To investigate how animals perceive these intermittent cues, we developed a behavioral task in which head-restrained mice made binary decisions based on the total number of discrete odor pulses presented stochastically over several seconds. Mice readily learned this task, and their performance was well-described by widely used decision models. Logistic regression of binary choices against the timing of odor pulses within the respiratory cycle revealed that mice placed higher perceptual weight to stimuli arriving during inhalation than exhalation, a phase dependency that strongly correlated with the magnitude of responses in olfactory sensory neurons. The population response of anterior piriform cortex (APCx) neurons to odor pulses was also modulated by respiration phase, although individual neurons displayed varying levels of phase-dependence. Single APCx neurons responded stochastically and transiently to odor pulses, leading to a representation that carries signatures of sensory evidence, but not its accumulation. Our study reveals that mice can integrate intermittent odor signals across dozens of breaths, but respiratory modulation of sensory inputs imposes limits on information acquisition that cortical circuits cannot overcome to improve behavior.
Open AccessPerception and neural representation of intermittent odor stimuli in mice
Odor cues in nature are sparse and highly fluctuating due to turbulent transport. To investigate how animals perceive these intermittent cues, we developed a behavioral task in which head-restrained mice made binary decisions based on the total number of discrete odor pulses presented stochastically over several seconds. Mice readily learned this task, and their performance was well-described by widely used decision models. Logistic regression of binary choices against the timing of odor pulses within the respiratory cycle revealed that mice placed higher perceptual weight to stimuli arriving during inhalation than exhalation, a phase dependency that strongly correlated with the magnitude of responses in olfactory sensory neurons. The population response of anterior piriform cortex (APCx) neurons to odor pulses was also modulated by respiration phase, although individual neurons displayed varying levels of phase-dependence. Single APCx neurons responded stochastically and transiently to odor pulses, leading to a representation that carries signatures of sensory evidence, but not its accumulation. Our study reveals that mice can integrate intermittent odor signals across dozens of breaths, but respiratory modulation of sensory inputs imposes limits on information acquisition that cortical circuits cannot overcome to improve behavior.
- Open Access
Bounded optimality of time investments in rats, mice, and humans
Time is our scarcest resource. Allocating time optimally presents a universal challenge for all organisms because the future benefits of time investments are uncertain. We developed a normative framework for assessing bounded optimality in time allocation, emphasizing the accuracy of future predictions, independent of subjective costs and benefits. In a common decision task across humans, rats, and mice, we varied uncertainty by titrating ambiguous sensory evidence and measured the time each subject was willing to invest post-decision. We observed that all species and subjects invested more time when they were more likely to be correct, which reflected a statistical confidence of uncertain evidence. Time allocation strategy approached the lower bound of optimality, indicating an accurate decision-by-decision assessment of confidence in the likelihood that waiting will pay off – independent of the subjective payoff values and time costs. We demonstrate that an elementary algorithm based on a drift-diffusion process algorithm can implement this optimal time investment strategy. These results illuminate the computational mechanisms governing rational time investment, showing that humans, rats, and mice can maximize payoffs via confidence-guided time allocation. Highlights Computational and behavioral framework to assess bounded optimality of investments. Humans, rats, and mice invest more time to obtain more likely payoffs, in proportion to statistical confidence. Time investment was close to optimal model predictions, reflecting bounded optimality of investments under uncertainty. Bounded-optimal time investment may be an evolutionary ancient adaptive behavioral strategy.
Open AccessBounded optimality of time investments in rats, mice, and humans
Time is our scarcest resource. Allocating time optimally presents a universal challenge for all organisms because the future benefits of time investments are uncertain. We developed a normative framework for assessing bounded optimality in time allocation, emphasizing the accuracy of future predictions, independent of subjective costs and benefits. In a common decision task across humans, rats, and mice, we varied uncertainty by titrating ambiguous sensory evidence and measured the time each subject was willing to invest post-decision. We observed that all species and subjects invested more time when they were more likely to be correct, which reflected a statistical confidence of uncertain evidence. Time allocation strategy approached the lower bound of optimality, indicating an accurate decision-by-decision assessment of confidence in the likelihood that waiting will pay off – independent of the subjective payoff values and time costs. We demonstrate that an elementary algorithm based on a drift-diffusion process algorithm can implement this optimal time investment strategy. These results illuminate the computational mechanisms governing rational time investment, showing that humans, rats, and mice can maximize payoffs via confidence-guided time allocation. Highlights Computational and behavioral framework to assess bounded optimality of investments. Humans, rats, and mice invest more time to obtain more likely payoffs, in proportion to statistical confidence. Time investment was close to optimal model predictions, reflecting bounded optimality of investments under uncertainty. Bounded-optimal time investment may be an evolutionary ancient adaptive behavioral strategy.
- Open Access
Interpretable deep learning for deconvolutional analysis of neural signals
The widespread adoption of deep learning to build models that capture the dynamics of neural populations is typically based on “black-box” approaches that lack an interpretable link between neural activity and network parameters. Here, we propose to apply algorithm unrolling, a method for interpretable deep learning, to design the architecture of sparse deconvolutional neural networks and obtain a direct interpretation of network weights in relation to stimulus-driven single-neuron activity through a generative model. We characterize our method, referred to as deconvolutional unrolled neural learning (DUNL), and show its versatility by applying it to deconvolve single-trial local signals across multiple brain areas and recording modalities. To exemplify use cases of our decomposition method, we uncover multiplexed salience and reward prediction error signals from midbrain dopamine neurons in an unbiased manner, perform simultaneous event detection and characterization in somatosensory thalamus recordings, and characterize the heterogeneity of neural responses in the piriform cortex and in the striatum during unstructured, naturalistic experiments. Our work leverages the advances in interpretable deep learning to gain a mechanistic understanding of neural activity.
Open AccessInterpretable deep learning for deconvolutional analysis of neural signals
The widespread adoption of deep learning to build models that capture the dynamics of neural populations is typically based on “black-box” approaches that lack an interpretable link between neural activity and network parameters. Here, we propose to apply algorithm unrolling, a method for interpretable deep learning, to design the architecture of sparse deconvolutional neural networks and obtain a direct interpretation of network weights in relation to stimulus-driven single-neuron activity through a generative model. We characterize our method, referred to as deconvolutional unrolled neural learning (DUNL), and show its versatility by applying it to deconvolve single-trial local signals across multiple brain areas and recording modalities. To exemplify use cases of our decomposition method, we uncover multiplexed salience and reward prediction error signals from midbrain dopamine neurons in an unbiased manner, perform simultaneous event detection and characterization in somatosensory thalamus recordings, and characterize the heterogeneity of neural responses in the piriform cortex and in the striatum during unstructured, naturalistic experiments. Our work leverages the advances in interpretable deep learning to gain a mechanistic understanding of neural activity.