Demo Data from EDBT 2026 / reviewers in the wild / expert
Sandeep R. Datta
dblp:191/6720
· DBLP profile ↗
4ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 since 2021
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.
| Artificial intelligence
4 papers |
Probabilistic and Bayesian machine learning · 72% Deep learning architectures and training · 21% Representation and self-supervised learning · 7% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 65% Medical and health informatics · 35% |
Topics — the 13 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model |
0.6 | 1 | 2022 | Distinguishing discrete and continuous behavioral variability using warped autoregressive HMMs · NeurIPS 2022 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
latent variable model |
0.5 | 2 | 2019 | BehaveNet: nonlinear embedding and Bayesian neural decoding of behavioral videos · NeurIPS 2019 Composing graphical models with neural networks for structured representations and fast inference · NIPS 2016 |
Machine learning › Deep learning architectures and training
autoencoder |
0.4 | 1 | 2019 | BehaveNet: nonlinear embedding and Bayesian neural decoding of behavioral videos · NeurIPS 2019 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › hidden markov model
autoregressive hidden markov model |
0.4 | 1 | 2019 | BehaveNet: nonlinear embedding and Bayesian neural decoding of behavioral videos · NeurIPS 2019 |
Machine learning › Deep learning architectures and training › autoencoder
convolutional autoencoder |
0.4 | 1 | 2019 | BehaveNet: nonlinear embedding and Bayesian neural decoding of behavioral videos · NeurIPS 2019 |
Bioinformatics and computational biology › computational neuroscience
neural decoding |
0.4 | 1 | 2019 | BehaveNet: nonlinear embedding and Bayesian neural decoding of behavioral videos · NeurIPS 2019 |
Medical and health informatics › neuroimaging
neuroimaging analysis |
0.4 | 1 | 2019 | BehaveNet: nonlinear embedding and Bayesian neural decoding of behavioral videos · NeurIPS 2019 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process |
0.3 | 1 | 2018 | Learning a latent manifold of odor representations from neural responses in piriform cortex · NeurIPS 2018 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › latent gaussian model
gaussian process latent variable model |
0.3 | 1 | 2018 | Learning a latent manifold of odor representations from neural responses in piriform cortex · NeurIPS 2018 |
Bioinformatics and computational biology › neuroscience › neuroinformatics
neural data analysis |
0.3 | 1 | 2018 | Learning a latent manifold of odor representations from neural responses in piriform cortex · NeurIPS 2018 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models |
0.2 | 1 | 2016 | Composing graphical models with neural networks for structured representations and fast inference · NIPS 2016 |
Machine learning › Representation and self-supervised learning
structured representation |
0.2 | 1 | 2016 | Composing graphical models with neural networks for structured representations and fast inference · NIPS 2016 |
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference |
0.2 | 1 | 2016 | Composing graphical models with neural networks for structured representations and fast inference · NIPS 2016 |
Methods — techniques the papers use, named apart from their topics
convolutional autoencoder · 0.8bayesian decoding · 0.8autoregressive hidden markov model · 0.8nonlinear tuning curve · 0.7gaussian process latent variable model · 0.7co-smoothing · 0.7warped autoregressive HMM · 0.6depth-camera recordings · 0.6recognition networks · 0.2message passing · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Distinguishing discrete and continuous behavioral variability using warped autoregressive HMMsabstractA core goal in systems neuroscience and neuroethology is to understand how neural circuits generate naturalistic behavior. One foundational idea is that complex naturalistic behavior may be composed of sequences of stereotyped behavioral syllables, which combine to generate rich sequences of actions. To investigate this, a common approach is to use autoregressive hidden Markov models (ARHMMs) to segment video into discrete behavioral syllables. While these approaches have been successful in extracting syllables that are interpretable, they fail to account for other forms of behavioral variability, such as differences in speed, which may be better described as continuous in nature. To overcome these limitations, we introduce a class of warped ARHMMs (WARHMM). As is the case in the ARHMM, behavior is modeled as a mixture of autoregressive dynamics. However, the dynamics under each discrete latent state (i.e. each behavioral syllable) are additionally modulated by a continuous latent ``warping variable.'' We present two versions of warped ARHMM in which the warping variable affects the dynamics of each syllable either linearly or nonlinearly. Using depth-camera recordings of freely moving mice, we demonstrate that the failure of ARHMMs to account for continuous behavioral variability results in duplicate cluster assignments. WARHMM achieves similar performance to the standard ARHMM while using fewer behavioral syllables. Further analysis of behavioral measurements in mice demonstrates that WARHMM identifies structure relating to response vigor. Julia Costacurta, Lea Duncker, Blue Sheffer, Winthrop Gillis, Caleb Weinreb, Jeffrey E. Markowitz, Sandeep R. Datta, Alex H. Williams, Scott W. Linderman |
NeurIPS | 7 |
| 2019 | BehaveNet: nonlinear embedding and Bayesian neural decoding of behavioral videosabstractA fundamental goal of systems neuroscience is to understand the relationship between neural activity and behavior. Behavior has traditionally been characterized by low-dimensional, task-related variables such as movement speed or response times. More recently, there has been a growing interest in automated analysis of high-dimensional video data collected during experiments. Here we introduce a probabilistic framework for the analysis of behavioral video and neural activity. This framework provides tools for compression, segmentation, generation, and decoding of behavioral videos. Compression is performed using a convolutional autoencoder (CAE), which yields a low-dimensional continuous representation of behavior. We then use an autoregressive hidden Markov model (ARHMM) to segment the CAE representation into discrete "behavioral syllables." The resulting generative model can be used to simulate behavioral video data. Finally, based on this generative model, we develop a novel Bayesian decoding approach that takes in neural activity and outputs probabilistic estimates of the full-resolution behavioral video. We demonstrate this framework on two different experimental paradigms using distinct behavioral and neural recording technologies. Eleanor Batty, Matthew R. Whiteway, Shreya Saxena, Dan Biderman, Taiga Abe, Simon Musall, Winthrop Gillis, Jeffrey E. Markowitz, Anne Churchland, John P. Cunningham, Sandeep R. Datta, Scott W. Linderman, Liam Paninski |
NeurIPS | 11 |
| 2018 | Learning a latent manifold of odor representations from neural responses in piriform cortexabstractA major difficulty in studying the neural mechanisms underlying olfactory perception is the lack of obvious structure in the relationship between odorants and the neural activity patterns they elicit. Here we use odor-evoked responses in piriform cortex to identify a latent manifold specifying latent distance relationships between olfactory stimuli. Our approach is based on the Gaussian process latent variable model, and seeks to map odorants to points in a low-dimensional embedding space, where distances between points in the embedding space relate to the similarity of population responses they elicit. The model is specified by an explicit continuous mapping from a latent embedding space to the space of high-dimensional neural population firing rates via nonlinear tuning curves, each parametrized by a Gaussian process. Population responses are then generated by the addition of correlated, odor-dependent Gaussian noise. We fit this model to large-scale calcium fluorescence imaging measurements of population activity in layers 2 and 3 of mouse piriform cortex following the presentation of a diverse set of odorants. The model identifies a low-dimensional embedding of each odor, and a smooth tuning curve over the latent embedding space that accurately captures each neuron's response to different odorants. The model captures both signal and noise correlations across more than 500 neurons. We validate the model using a cross-validation analysis known as co-smoothing to show that the model can accurately predict the responses of a population of held-out neurons to test odorants. Anqi Wu, Stan L. Pashkovski, Sandeep R. Datta, Jonathan W. Pillow |
NeurIPS | 3 |
| 2016 | Composing graphical models with neural networks for structured representations and fast inferenceabstractWe propose a general modeling and inference framework that combines the complementary strengths of probabilistic graphical models and deep learning methods. Our model family composes latent graphical models with neural network observation likelihoods. For inference, we use recognition networks to produce local evidence potentials, then combine them with the model distribution using efficient message-passing algorithms. All components are trained simultaneously with a single stochastic variational inference objective. We illustrate this framework by automatically segmenting and categorizing mouse behavior from raw depth video, and demonstrate several other example models. Matthew J. Johnson 0002, David Duvenaud, Alexander B. Wiltschko, Ryan P. Adams, Sandeep R. Datta |
NIPS | 5 |