WPWilliam F. Podlaski

William F. Podlaski

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


William F. Podlaski has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An ion channel omnimodel for standardized biophysical neuron modelling

    by Chaitanya Chintaluri, William Podlaski, Panos A. Bozelos, Pedro J Gonçalves, Jan-Matthis Lueckmann, Jakob H. Macke, Tim P. Vogels

    Biophysical neuron modeling is an indispensable tool in neuroscience research, with the combination of diverse ion channel kinetics and morphologies being used to explain various single-neuron properties and responses. Despite this, there is no standard way of formulating ion channel models, making it challenging to relate models to one another and experimental data. Here, we revive the idea of a standard model for ion channels based on the Hodgkin-Huxley formulation, and apply it to a recently curated database of ion channel models. We demonstrate that this standard formulation, which we refer to as an omnimodel, accurately fits the majority of voltage-gated models in the database (over 3,000 models). It produces similar, if not identical, responses to voltage-clamp protocols in simulations where the ion channel omnimodels were used. Importantly, the standard formalism enables easy comparison of models based on parameter settings. It can also be used to make new observations about the space of ion channel kinetics found in neurons. Furthermore, it facilitates the inference of ion channel parameters from the responses to standard protocols. We provide an interactive platform to compare and select channel models, and encourage the community to use this standard formulation whenever possible, to facilitate understanding and comparison among models.

  • Open Access

    Three types of remapping with linear decoders: A population-geometric perspective

    by Guillermo Martín-Sánchez, Christian K. Machens, William F. Podlaski

    Hippocampal remapping, in which place cells form distinct activity maps across different environments, is a well-established phenomenon with a range of theoretical interpretations. Some theories propose that remapping helps to minimize interference between competing spatial memories, whereas others link it to shifts in an underlying latent state representation. However, how these interpretations of remapping relate to one another, and what types of activity changes they are compatible with, remains unclear. To unify and elucidate the mechanisms behind remapping, we here adopt a neural coding and population geometry perspective. Assuming that hippocampal population activity can be understood through a linearly-decodable latent space, we show that there are three possible mechanisms to induce remapping: (i) a true change in the mapping between neural and latent space, (ii) modulation of activity due to non-spatial mixed selectivity of place cells, or (iii) neural variability in the null space of the latent space that reflects a redundant code. We simulate and visualize examples of these remapping types in a network model, and relate the resultant remapping behavior to various models and experimental findings in the literature. Overall, our work serves as a unifying framework with which to visualize, understand, and compare the wide array of theories and experimental observations about remapping, and may serve as a testbed for understanding neural response variability under various experimental conditions.


  • Open Access

    Three types of remapping with linear decoders: a population-geometric perspective

    by Guillermo Martín-Sánchez, Christian K. Machens, William F. Podlaski

    Hippocampal remapping, in which place cells form distinct activity maps across different environments, is a well-established phenomenon with a range of theoretical interpretations. Some theories propose that remapping helps to minimize interference between competing spatial memories, whereas others link it to shifts in an underlying latent state representation. However, how these interpretations of remapping relate to one another, and what types of activity changes they are compatible with, remains unclear. To unify and elucidate the mechanisms behind remapping, we here adopt a neural coding and population geometry perspective. Assuming that hippocampal population activity can be understood through a linearly-decodable latent space, we show that there are three possible mechanisms to induce remapping: (i) a true change in the mapping between neural and latent space, (ii) modulation of activity due to non-spatial mixed selectivity of place cells, or (iii) neural variability in the null space of the latent space that reflects a redundant code. We simulate and visualize examples of these remapping types in a network model, and relate the resultant remapping behavior to various models and experimental findings in the literature. Overall, our work serves as a unifying framework with which to visualize, understand, and compare the wide array of theories and experimental observations about remapping, and may serve as a testbed for understanding neural response variability under various experimental conditions.


  • Open Access

    High Capacity and Dynamic Accessibility in Associative Memory Networks with Context-Dependent Neuronal and Synaptic Gating

    by William F. Podlaski, Everton J. Agnes, Tim P. Vogels

    Biological memory is known to be flexible—memory formation and recall depend on factors such as the behavioral context of the organism. However, this property is often ignored in associative memory models, leaving it unclear how memories can be organized and recalled when subject to contextual control. Because of the lack of a rigorous analytical framework, it is also unknown how contextual control affects memory stability, storage capacity, and information content. Here, we bring the dynamic nature of memory to the fore by introducing a novel model of associative memory, which we refer to as the context-modular memory network. In our model, stored memory patterns are associated to one of several background network states, or contexts. Memories are accessible when their corresponding context is active, and are otherwise inaccessible. Context modulates the effective network connectivity by imposing a specific configuration of neuronal and synaptic gating—gated neurons (synapses) have their activity (weights) momentarily silenced, thereby reducing interference from memories belonging to other contexts. Memory patterns are randomly and independently chosen, while neuronal and synaptic gates may be selected randomly or optimized through a process of contextual synaptic refinement. Through analytic and numerical results, we show that context-modular memory networks can exhibit both improved memory capacity and differential control of memory stability with random gating (especially for neuronal gating). For contextual synaptic refinement, we devise a method in which synapses are gated off for a given context if they destabilize the memory patterns in that context, drastically improving memory capacity and enabling even more precise control over memory stability. Notably, synaptic refinement allows for patterns to be accessible in multiple contexts, stabilizing memory patterns even for weight matrices that alone do not contain any information about the memory patterns, such as Gaussian random matrices. Overall, our model integrates recent ideas about context-dependent memory organization with classic associative memory models and proposes a rigorous theory which can act as a framework for future work. Furthermore, our work carries important implications for the understanding of biological memory storage and recall in the brain, such as highlighting an intriguing trade-off between memory capacity and accessibility.


  • Open Access

    Approximating Nonlinear Functions With Latent Boundaries in Low-Rank Excitatory-Inhibitory Spiking Networks

    by William F. Podlaski, Christian K. Machens

    Deep feedforward and recurrent neural networks have become successful functional models of the brain, but they neglect obvious biological details such as spikes and Dale’s law. Here we argue that these details are crucial in order to understand how real neural circuits operate. Towards this aim, we put forth a new framework for spike-based computation in low-rank excitatory-inhibitory spiking networks. By considering populations with rank-1 connectivity, we cast each neuron’s spiking threshold as a boundary in a low-dimensional input-output space. We then show how the combined thresholds of a population of inhibitory neurons form a stable boundary in this space, and those of a population of excitatory neurons form an unstable boundary. Combining the two boundaries results in a rank-2 excitatory-inhibitory (EI) network with inhibition-stabilized dynamics at the intersection of the two boundaries. The computation of the resulting networks can be understood as the difference of two convex functions and is thereby capable of approximating arbitrary non-linear input-output mappings. We demonstrate several properties of these networks, including noise suppression and amplification, irregular activity and synaptic balance, as well as how they relate to rate network dynamics in the limit that the boundary becomes soft. Finally, while our work focuses on small networks (5-50 neurons), we discuss potential avenues for scaling up to much larger networks. Overall, our work proposes a new perspective on spiking networks that may serve as a starting point for a mechanistic understanding of biological spike-based computation.


  • Open Access

    Approximating nonlinear functions with latent boundaries in low-rank excitatory-inhibitory spiking networks

    by William F. Podlaski, Christian K. Machens

    Deep feedforward and recurrent rate-based neural networks have become successful functional models of the brain, but they neglect obvious biological details such as spikes and Dale's law. Here we argue that these details are crucial in order to understand how real neural circuits operate. Towards this aim, we put forth a new framework for spike-based computation in low-rank excitatory-inhibitory spiking networks. By considering populations with rank-1 connectivity, we cast each neuron's spiking threshold as a boundary in a low-dimensional input-output space. We then show how the combined thresholds of a population of inhibitory neurons form a stable boundary in this space, and those of a population of excitatory neurons form an unstable boundary. Combining the two boundaries results in a rank-2 excitatory-inhibitory (EI) network with inhibition-stabilized dynamics at the intersection of the two boundaries. The computation of the resulting networks can be understood as the difference of two convex functions and is thereby capable of approximating arbitrary non-linear input-output mappings. We demonstrate several properties of these networks, including noise suppression and amplification, irregular activity and synaptic balance, as well as how they relate to rate network dynamics in the limit that the boundary becomes soft. Finally, while our work focuses on small networks (5-50 neurons), we discuss potential avenues for scaling up to much larger networks. Overall, our work proposes a new perspective on spiking networks that may serve as a starting point for a mechanistic understanding of biological spike-based computation.

  • Nonlinear computations in spiking neural networks through multiplicative synapses

    by Michele Nardin, James W. Phillips, William F. Podlaski, Sander W. Keemink

    The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing.


  • Top Cited Papers
    Open Access

    Training deep neural density estimators to identify mechanistic models of neural dynamics

    by Pedro J Gonçalves, Jan-Matthis Lueckmann, Michael Deistler, Marcel Nonnenmacher, Kaan Öcal, Giacomo Bassetto, Chaitanya Chintaluri, William F Podlaski, Sara A Haddad, Tim P Vogels, et al.

    Mechanistic modeling in neuroscience aims to explain observed phenomena in terms of underlying causes. However, determining which model parameters agree with complex and stochastic neural data presents a significant challenge. We address this challenge with a machine learning tool which uses deep neural density estimators—trained using model simulations—to carry out Bayesian inference and retrieve the full space of parameters compatible with raw data or selected data features. Our method is scalable in parameters and data features and can rapidly analyze new data after initial training. We demonstrate the power and flexibility of our approach on receptive fields, ion channels, and Hodgkin–Huxley models. We also characterize the space of circuit configurations giving rise to rhythmic activity in the crustacean stomatogastric ganglion, and use these results to derive hypotheses for underlying compensation mechanisms. Our approach will help close the gap between data-driven and theory-driven models of neural dynamics.


  • Open Access

    High capacity and dynamic accessibility in associative memory networks with context-dependent neuronal and synaptic gating

    by William F. Podlaski, Everton J. Agnes, Tim P. Vogels

    Biological memory is known to be flexible — memory formation and recall depend on factors such as the behavioral context of the organism. However, this property is often ignored in associative memory models. Here, we bring this dynamic nature of memory to the fore by introducing a novel model of associative memory, which we refer to as the context-modular memory network. In our model, stored memory patterns are associated to one of several background network states, or contexts. Memories are accessible when their corresponding context is active, and are otherwise inaccessible. Context modulates the effective network connectivity by imposing a specific configuration of neuronal and synaptic gating – gated neurons (respectively synapses) have their activity (respectively weights) momentarily silenced, thereby reducing interference from memories belonging to other contexts. Memory patterns are randomly and independently chosen, while neuronal and synaptic gates may be selected randomly or optimized through a process of contextual synaptic refinement. Through signal-to-noise and mean field analyses, we show that context-modular memory networks can exhibit substantially increased memory capacity with random neuronal gating, but not with random synaptic gating. For contextual synaptic refinement, we devise a method in which synapses are gated off for a given context if they destabilize the memory patterns in that context, drastically improving memory capacity. Notably, synaptic refinement allows for patterns to be accessible in multiple contexts, stabilizing memory patterns even for weight matrices that do not contain any information about the memory patterns such as Gaussian random matrices. Lastly, we show that context modulates the relative stability of accessible versus inaccessible memories, thereby confirming that contextual control acts as a mechanism to temporarily hide or reveal particular memories. Overall, our model integrates recent ideas about context-dependent memory organization with classic associative memory models, highlights an intriguing trade-off between memory capacity and accessibility, and carries important implications for the understanding of biological memory storage and recall in the brain.


  • Open Access

    Training deep neural density estimators to identify mechanistic models of neural dynamics

    by Pedro J. Gonçalves, Jan-Matthis Lueckmann, Michael Deistler, Marcel Nonnenmacher, Kaan Öcal, Giacomo Bassetto, Chaitanya Chintaluri, William F. Podlaski, Sara A. Haddad, Tim P. Vogels, et al.

    Mechanistic modeling in neuroscience aims to explain observed phenomena in terms of underlying causes. However, determining which model parameters agree with complex and stochastic neural data presents a significant challenge. We address this challenge with a machine learning tool which uses deep neural density estimators— trained using model simulations— to carry out Bayesian inference and retrieve the full space of parameters compatible with raw data or selected data features. Our method is scalable in parameters and data features, and can rapidly analyze new data after initial training. We demonstrate the power and flexibility of our approach on receptive fields, ion channels, and Hodgkin–Huxley models. We also characterize the space of circuit configurations giving rise to rhythmic activity in the crustacean stomatogastric ganglion, and use these results to derive hypotheses for underlying compensation mechanisms. Our approach will help close the gap between data-driven and theory-driven models of neural dynamics.