Matthew T. Kaufman

dblp:196/6506 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-8072-023XORCID · verified

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

Artificial intelligence and machine learning · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Representation and self-supervised learning · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › dynamical system representation
latent dynamics
0.512021
Deep inference of latent dynamics with spatio-temporal super-resolution using selective backpropagation through time · NeurIPS 2021
Machine learning › Representation and self-supervised learning › computational neuroscience
neural population dynamics
0.512021
Deep inference of latent dynamics with spatio-temporal super-resolution using selective backpropagation through time · NeurIPS 2021
Machine learning › Representation and self-supervised learning › representation learning
sequential autoencoder
0.512021
Deep inference of latent dynamics with spatio-temporal super-resolution using selective backpropagation through time · NeurIPS 2021
Bioinformatics and computational biology › neuroscience › neuroinformatics › neural data analysis
calcium imaging analysis
0.312017
OnACID: Online Analysis of Calcium Imaging Data in Real Time · NIPS 2017
Bioinformatics and computational biology
computational neuroscience
0.312017
OnACID: Online Analysis of Calcium Imaging Data in Real Time · NIPS 2017
Bioinformatics and computational biology
electrophysiology
0.112021
Deep inference of latent dynamics with spatio-temporal super-resolution using selective backpropagation through time · NeurIPS 2021
Bioinformatics and computational biology › computational neuroscience
neural decoding
0.112021
Deep inference of latent dynamics with spatio-temporal super-resolution using selective backpropagation through time · NeurIPS 2021

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

spatio-temporal super-resolution · 1.0selective backpropagation through time · 1.0deep generative model · 1.0online dictionary learning · 0.3
YearPublicationVenuePosition
2021 Deep inference of latent dynamics with spatio-temporal super-resolution using selective backpropagation through time
abstract
Modern neural interfaces allow access to the activity of up to a million neurons within brain circuits. However, bandwidth limits often create a trade-off between greater spatial sampling (more channels or pixels) and the temporal frequency of sampling. Here we demonstrate that it is possible to obtain spatio-temporal super-resolution in neuronal time series by exploiting relationships among neurons, embedded in latent low-dimensional population dynamics. Our novel neural network training strategy, selective backpropagation through time (SBTT), enables learning of deep generative models of latent dynamics from data in which the set of observed variables changes at each time step. The resulting models are able to infer activity for missing samples by combining observations with learned latent dynamics. We test SBTT applied to sequential autoencoders and demonstrate more efficient and higher-fidelity characterization of neural population dynamics in electrophysiological and calcium imaging data. In electrophysiology, SBTT enables accurate inference of neuronal population dynamics with lower interface bandwidths, providing an avenue to significant power savings for implanted neuroelectronic interfaces. In applications to two-photon calcium imaging, SBTT accurately uncovers high-frequency temporal structure underlying neural population activity, substantially outperforming the current state-of-the-art. Finally, we demonstrate that performance could be further improved by using limited, high-bandwidth sampling to pretrain dynamics models, and then using SBTT to adapt these models for sparsely-sampled data.
Andrew R. Sedler, Harrison A. Grier, Nauman Ahad, Mark A. Davenport, Matthew T. Kaufman, Andrea Giovannucci, Chethan Pandarinath
NeurIPS6
2017 OnACID: Online Analysis of Calcium Imaging Data in Real Time
abstract
Optical imaging methods using calcium indicators are critical for monitoring the activity of large neuronal populations in vivo. Imaging experiments typically generate a large amount of data that needs to be processed to extract the activity of the imaged neuronal sources. While deriving such processing algorithms is an active area of research, most existing methods require the processing of large amounts of data at a time, rendering them vulnerable to the volume of the recorded data, and preventing real-time experimental interrogation. Here we introduce OnACID, an Online framework for the Analysis of streaming Calcium Imaging Data, including i) motion artifact correction, ii) neuronal source extraction, and iii) activity denoising and deconvolution. Our approach combines and extends previous work on online dictionary learning and calcium imaging data analysis, to deliver an automated pipeline that can discover and track the activity of hundreds of cells in real time, thereby enabling new types of closed-loop experiments. We apply our algorithm on two large scale experimental datasets, benchmark its performance on manually annotated data, and show that it outperforms a popular offline approach.
Andrea Giovannucci, Johannes Friedrich, Matthew T. Kaufman, Anne Churchland, Dmitri B. Chklovskii, Liam Paninski, Eftychios A. Pnevmatikakis
NIPS3
2016 Tensor Analysis Reveals Distinct Population Structure that Parallels the Different Computational Roles of Areas M1 and V1
abstract
Cortical firing rates frequently display elaborate and heterogeneous temporal structure. One often wishes to compute quantitative summaries of such structure-a basic example is the frequency spectrum-and compare with model-based predictions. The advent of large-scale population recordings affords the opportunity to do so in new ways, with the hope of distinguishing between potential explanations for why responses vary with time. We introduce a method that assesses a basic but previously unexplored form of population-level structure: when data contain responses across multiple neurons, conditions, and times, they are naturally expressed as a third-order tensor. We examined tensor structure for multiple datasets from primary visual cortex (V1) and primary motor cortex (M1). All V1 datasets were 'simplest' (there were relatively few degrees of freedom) along the neuron mode, while all M1 datasets were simplest along the condition mode. These differences could not be inferred from surface-level response features. Formal considerations suggest why tensor structure might differ across modes. For idealized linear models, structure is simplest across the neuron mode when responses reflect external variables, and simplest across the condition mode when responses reflect population dynamics. This same pattern was present for existing models that seek to explain motor cortex responses. Critically, only dynamical models displayed tensor structure that agreed with the empirical M1 data. These results illustrate that tensor structure is a basic feature of the data. For M1 the tensor structure was compatible with only a subset of existing models.
Jeffrey S. Seely, Matthew T. Kaufman, Stephen I. Ryu, Krishna V. Shenoy, John P. Cunningham, Mark M. Churchland
PLoS Comput. Biol.2