Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Häusser

dblp:14/735 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0002-2673-8957ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4Applied, interdisciplinary, general and emerging computing · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Artificial intelligence
4 papers
Probabilistic and Bayesian machine learning · 54% Representation and self-supervised learning · 26% Generative modeling · 14%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
neuroscience
0.522017
Model-based Bayesian inference of neural activity and connectivity from all-optical interrogation of a neural circuit · NIPS 2017
Inferring neural population dynamics from multiple partial recordings of the same neural circuit · NIPS 2013
Bioinformatics and computational biology › computational neuroscience › brain connectivity analysis
neural connectivity inference
0.312017
Model-based Bayesian inference of neural activity and connectivity from all-optical interrogation of a neural circuit · NIPS 2017
Machine learning › Probabilistic and Bayesian machine learning › dynamical system
latent dynamical system
0.212013
Inferring neural population dynamics from multiple partial recordings of the same neural circuit · NIPS 2013
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model
0.212013
Inferring neural population dynamics from multiple partial recordings of the same neural circuit · NIPS 2013
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding
0.212013
Extracting regions of interest from biological images with convolutional sparse block coding · NIPS 2013
Bioinformatics and computational biology › computational neuroscience
neural population dynamics
0.212013
Inferring neural population dynamics from multiple partial recordings of the same neural circuit · NIPS 2013
Image and video processing › biomedical image analysis
biological image analysis
0.212013
Extracting regions of interest from biological images with convolutional sparse block coding · NIPS 2013
Image and video processing › sparse representation
convolutional sparse coding
0.212013
Extracting regions of interest from biological images with convolutional sparse block coding · NIPS 2013
Machine learning › Generative modeling
variational autoencoder
0.112017
Model-based Bayesian inference of neural activity and connectivity from all-optical interrogation of a neural circuit · NIPS 2017
Machine learning › Deep learning architectures and training › biologically plausible learning
synaptic plasticity
0.012003
Plasticity Kernels and Temporal Statistics · NIPS 2003

Methods — techniques the papers use, named apart from their topics

variational autoencoder · 0.6spike-and-slab prior · 0.6generalized linear model · 0.6bayesian inference · 0.6statistical methods · 0.3latent dynamical system · 0.3convolutional matching pursuit · 0.3K-SVD · 0.3z-score transform · 0.0filtering · 0.0
YearPublicationVenuePosition
2017 Model-based Bayesian inference of neural activity and connectivity from all-optical interrogation of a neural circuit
abstract
Population activity measurement by calcium imaging can be combined with cellular resolution optogenetic activity perturbations to enable the mapping of neural connectivity in vivo. This requires accurate inference of perturbed and unperturbed neural activity from calcium imaging measurements, which are noisy and indirect, and can also be contaminated by photostimulation artifacts. We have developed a new fully Bayesian approach to jointly inferring spiking activity and neural connectivity from in vivo all-optical perturbation experiments. In contrast to standard approaches that perform spike inference and analysis in two separate maximum-likelihood phases, our joint model is able to propagate uncertainty in spike inference to the inference of connectivity and vice versa. We use the framework of variational autoencoders to model spiking activity using discrete latent variables, low-dimensional latent common input, and sparse spike-and-slab generalized linear coupling between neurons. Additionally, we model two properties of the optogenetic perturbation: off-target photostimulation and photostimulation transients. Using this model, we were able to fit models on 30 minutes of data in just 10 minutes. We performed an all-optical circuit mapping experiment in primary visual cortex of the awake mouse, and use our approach to predict neural connectivity between excitatory neurons in layer 2/3. Predicted connectivity is sparse and consistent with known correlations with stimulus tuning, spontaneous correlation and distance.
Laurence Aitchison, Lloyd Russell, Adam M. Packer, Jinyao Yan, Philippe Castonguay, Michael Häusser, Srinivas C. Turaga
NIPS6
2016 Inverse Stochastic Resonance in Cerebellar Purkinje Cells
abstract
Purkinje neurons play an important role in cerebellar computation since their axons are the only projection from the cerebellar cortex to deeper cerebellar structures. They have complex internal dynamics, which allow them to fire spontaneously, display bistability, and also to be involved in network phenomena such as high frequency oscillations and travelling waves. Purkinje cells exhibit type II excitability, which can be revealed by a discontinuity in their f-I curves. We show that this excitability mechanism allows Purkinje cells to be efficiently inhibited by noise of a particular variance, a phenomenon known as inverse stochastic resonance (ISR). While ISR has been described in theoretical models of single neurons, here we provide the first experimental evidence for this effect. We find that an adaptive exponential integrate-and-fire model fitted to the basic Purkinje cell characteristics using a modified dynamic IV method displays ISR and bistability between the resting state and a repetitive activity limit cycle. ISR allows the Purkinje cell to operate in different functional regimes: the all-or-none toggle or the linear filter mode, depending on the variance of the synaptic input. We propose that synaptic noise allows Purkinje cells to quickly switch between these functional regimes. Using mutual information analysis, we demonstrate that ISR can lead to a locally optimal information transfer between the input and output spike train of the Purkinje cell. These results provide the first experimental evidence for ISR and suggest a functional role for ISR in cerebellar information processing.
Anatoly Buchin, Sarah Rieubland, Michael Häusser, Boris Gutkin, Arnd Roth
PLoS Comput. Biol.3
2013 Extracting regions of interest from biological images with convolutional sparse block coding
abstract
Biological tissue is often composed of cells with similar morphologies replicated throughout large volumes and many biological applications rely on the accurate identification of these cells and their locations from image data. Here we develop a generative model that captures the regularities present in images composed of repeating elements of a few different types. Formally, the model can be described as convolutional sparse block coding. For inference we use a variant of convolutional matching pursuit adapted to block-based representations. We extend the K-SVD learning algorithm to subspaces by retaining several principal vectors from the SVD decomposition instead of just one. Good models with little cross-talk between subspaces can be obtained by learning the blocks incrementally. We perform extensive experiments on simulated images and the inference algorithm consistently recovers a large proportion of the cells with a small number of false positives. We fit the convolutional model to noisy GCaMP6 two-photon images of spiking neurons and to Nissl-stained slices of cortical tissue and show that it recovers cell body locations without supervision. The flexibility of the block-based representation is reflected in the variability of the recovered cell shapes.
Marius Pachitariu, Adam M. Packer, Noah Pettit, Henry Dalgleish, Michael Häusser, Maneesh Sahani
NIPS5
2013 Inferring neural population dynamics from multiple partial recordings of the same neural circuit
abstract
Simultaneous recordings of the activity of large neural populations are extremely valuable as they can be used to infer the dynamics and interactions of neurons in a local circuit, shedding light on the computations performed. It is now possible to measure the activity of hundreds of neurons using 2-photon calcium imaging. However, many computations are thought to involve circuits consisting of thousands of neurons, such as cortical barrels in rodent somatosensory cortex. Here we contribute a statistical method for stitching" together sequentially imaged sets of neurons into one model by phrasing the problem as fitting a latent dynamical system with missing observations. This method allows us to substantially expand the population-sizes for which population dynamics can be characterized---beyond the number of simultaneously imaged neurons. In particular, we demonstrate using recordings in mouse somatosensory cortex that this method makes it possible to predict noise correlations between non-simultaneously recorded neuron pairs."
Srinivas C. Turaga, Lars Buesing, Adam M. Packer, Henry Dalgleish, Noah Pettit, Michael Häusser, Jakob H. Macke
NIPS6
2010 One Rule to Grow Them All: A General Theory of Neuronal Branching and Its Practical Application
abstract
Understanding the principles governing axonal and dendritic branching is essential for unravelling the functionality of single neurons and the way in which they connect. Nevertheless, no formalism has yet been described which can capture the general features of neuronal branching. Here we propose such a formalism, which is derived from the expression of dendritic arborizations as locally optimized graphs. Inspired by Ramón y Cajal's laws of conservation of cytoplasm and conduction time in neural circuitry, we show that this graphical representation can be used to optimize these variables. This approach allows us to generate synthetic branching geometries which replicate morphological features of any tested neuron. The essential structure of a neuronal tree is thereby captured by the density profile of its spanning field and by a single parameter, a balancing factor weighing the costs for material and conduction time. This balancing factor determines a neuron's electrotonic compartmentalization. Additions to this rule, when required in the construction process, can be directly attributed to developmental processes or a neuron's computational role within its neural circuit. The simulations presented here are implemented in an open-source software package, the "TREES toolbox," which provides a general set of tools for analyzing, manipulating, and generating dendritic structure, including a tool to create synthetic members of any particular cell group and an approach for a model-based supervised automatic morphological reconstruction from fluorescent image stacks. These approaches provide new insights into the constraints governing dendritic architectures. They also provide a novel framework for modelling and analyzing neuronal branching structures and for constructing realistic synthetic neural networks.
Hermann Cuntz, Friedrich Forstner, Alexander Borst, Michael Häusser
PLoS Comput. Biol.4
2010 A New Approach for Determining Phase Response Curves Reveals that Purkinje Cells Can Act as Perfect Integrators
abstract
Cerebellar Purkinje cells display complex intrinsic dynamics. They fire spontaneously, exhibit bistability, and via mutual network interactions are involved in the generation of high frequency oscillations and travelling waves of activity. To probe the dynamical properties of Purkinje cells we measured their phase response curves (PRCs). PRCs quantify the change in spike phase caused by a stimulus as a function of its temporal position within the interspike interval, and are widely used to predict neuronal responses to more complex stimulus patterns. Significant variability in the interspike interval during spontaneous firing can lead to PRCs with a low signal-to-noise ratio, requiring averaging over thousands of trials. We show using electrophysiological experiments and simulations that the PRC calculated in the traditional way by sampling the interspike interval with brief current pulses is biased. We introduce a corrected approach for calculating PRCs which eliminates this bias. Using our new approach, we show that Purkinje cell PRCs change qualitatively depending on the firing frequency of the cell. At high firing rates, Purkinje cells exhibit single-peaked, or monophasic PRCs. Surprisingly, at low firing rates, Purkinje cell PRCs are largely independent of phase, resembling PRCs of ideal non-leaky integrate-and-fire neurons. These results indicate that Purkinje cells can act as perfect integrators at low firing rates, and that the integration mode of Purkinje cells depends on their firing rate.
Elena Phoka, Hermann Cuntz, Arnd Roth, Michael Häusser
PLoS Comput. Biol.4
2003 Plasticity Kernels and Temporal Statistics
abstract
Computational mysteries surround the kernels relating the magnitude and sign of changes in efficacy as a function of the time difference between pre- and post-synaptic activity at a synapse. One important idea34 is that kernels result from fil(cid:173) tering, ie an attempt by synapses to eliminate noise corrupting learning. This idea has hitherto been applied to trace learning rules; we apply it to experimentally-defined kernels, using it to reverse-engineer assumed signal statistics. We also extend it to consider the additional goal for filtering of weighting learning according to statistical surprise, as in the Z-score transform. This provides a fresh view of observed kernels and can lead to different, and more natural, signal statistics.
Peter Dayan, Michael Häusser
NIPS2