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

Nicholas B. Turk-Browne

dblp:61/5130 · DBLP profile ↗
← Back
13ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 7Databases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Systems, architecture and hardware · 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 · 77% Learning paradigms · 23%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Computational science and engineering · 60% Medical and health informatics · 40%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
continual self-supervised learning
0.612022
How Well Do Unsupervised Learning Algorithms Model Human Real-time and Life-long Learning? · NeurIPS 2022
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › self-supervised visual representation learning
self-supervised vision model
0.612022
How Well Do Unsupervised Learning Algorithms Model Human Real-time and Life-long Learning? · NeurIPS 2022
Computational science and engineering
computational cognitive science
0.612022
How Well Do Unsupervised Learning Algorithms Model Human Real-time and Life-long Learning? · NeurIPS 2022
Visualization and visual analytics › topological data analysis
persistent homology
0.412020
Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence · NeurIPS 2020
Visualization and visual analytics
topological data analysis
0.412020
Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence · NeurIPS 2020
High-performance computing
scientific computing systems
0.212015
Full correlation matrix analysis of fMRI data on Intel® Xeon Phi™ coprocessors · SC 2015
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.212022
How Well Do Unsupervised Learning Algorithms Model Human Real-time and Life-long Learning? · NeurIPS 2022
Machine learning › Learning paradigms
continual learning
0.212022
How Well Do Unsupervised Learning Algorithms Model Human Real-time and Life-long Learning? · NeurIPS 2022
Medical and health informatics › neuroimaging › neuroimaging analysis
fMRI analysis
0.112020
Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence · NeurIPS 2020
Medical and health informatics
neuroimaging
0.112020
Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence · NeurIPS 2020
Medical and health informatics › neuroimaging › neuroimaging analysis
functional connectivity analysis
0.112015
Full correlation matrix analysis of fMRI data on Intel® Xeon Phi™ coprocessors · SC 2015
Medical and health informatics › neuroimaging
neuroimaging analysis
0.112015
Full correlation matrix analysis of fMRI data on Intel® Xeon Phi™ coprocessors · SC 2015

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

self-supervised learning · 1.1negative sampling · 1.1trajectory analysis · 0.9clustering · 0.9memory mechanisms · 0.6memory mechanism · 0.6intel xeon phi coprocessor optimization · 0.4OpenMP · 0.4MPI · 0.4LibSVM · 0.4Intel MKL · 0.4
YearPublicationVenuePosition
2025 Latent Representation Learning for Multimodal Brain Activity Translation
abstract
Neuroscience employs diverse neuroimaging techniques, each offering distinct insights into brain activity, from electrophysiological recordings such as EEG, which have high temporal resolution, to hemodynamic modalities such as fMRI, which have increased spatial precision. However, integrating these heterogeneous data sources remains a challenge, which limits a comprehensive understanding of brain function. We present the Spatiotemporal Alignment of Multimodal Brain Activity (SAMBA) framework, which bridges the spatial and temporal resolution gaps across modalities by learning a unified latent space free of modality-specific biases. SAMBA introduces a novel attention-based wavelet decomposition for spectral filtering of electrophysiological recordings, graph attention networks to model functional connectivity between functional brain units, and recurrent layers to capture temporal autocorrelations in brain signal. We show that the training of SAMBA, aside from achieving translation, also learns a rich representation of brain information processing. We showcase this classify external stimuli driving brain activity from the representation learned in hidden layers of SAMBA, paving the way for broad downstream applications in neuroscience research and clinical contexts.
Arman Afrasiyabi, Dhananjay Bhaskar, Erica L. Busch, Laurent Caplette, Guillaume Lajoie, Nicholas B. Turk-Browne, Smita Krishnaswamy
ICASSP7
2022 How Well Do Unsupervised Learning Algorithms Model Human Real-time and Life-long Learning?
abstract
Humans learn from visual inputs at multiple timescales, both rapidly and flexibly acquiring visual knowledge over short periods, and robustly accumulating online learning progress over longer periods. Modeling these powerful learning capabilities is an important problem for computational visual cognitive science, and models that could replicate them would be of substantial utility in real-world computer vision settings. In this work, we establish benchmarks for both real-time and life-long continual visual learning. Our real-time learning benchmark measures a model's ability to match the rapid visual behavior changes of real humans over the course of minutes and hours, given a stream of visual inputs. Our life-long learning benchmark evaluates the performance of models in a purely online learning curriculum obtained directly from child visual experience over the course of years of development. We evaluate a spectrum of recent deep self-supervised visual learning algorithms on both benchmarks, finding that none of them perfectly match human performance, though some algorithms perform substantially better than others. Interestingly, algorithms embodying recent trends in self-supervised learning -- including BYOL, SwAV and MAE -- are substantially worse on our benchmarks than an earlier generation of self-supervised algorithms such as SimCLR and MoCo-v2. We present analysis indicating that the failure of these newer algorithms is primarily due to their inability to handle the kind of sparse low-diversity datastreams that naturally arise in the real world, and that actively leveraging memory through negative sampling -- a mechanism eschewed by these newer algorithms -- appears useful for facilitating learning in such low-diversity environments. We also illustrate a complementarity between the short and long timescales in the two benchmarks, showing how requiring a single learning algorithm to be locally context-sensitive enough to match real-time learning changes while stable enough to avoid catastrophic forgetting over the long term induces a trade-off that human-like algorithms may have to straddle. Taken together, our benchmarks establish a quantitative way to directly compare learning between neural networks models and human learners, show how choices in the mechanism by which such algorithms handle sample comparison and memory strongly impact their ability to match human learning abilities, and expose an open problem space for identifying more flexible and robust visual self-supervision algorithms.
Chengxu Zhuang, Yoon Bai, Xiaoxuan Jia, Nicholas B. Turk-Browne, Kenneth A. Norman, James J. DiCarlo, Dan Yamins
NeurIPS5
2020 Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistence
abstract
Functional magnetic resonance imaging (fMRI) is a crucial technology for gaining insights into cognitive processes in humans. Data amassed from fMRI measurements result in volumetric data sets that vary over time. However, analysing such data presents a challenge due to the large degree of noise and person-to-person variation in how information is represented in the brain. To address this challenge, we present a novel topological approach that encodes each time point in an fMRI data set as a persistence diagram of topological features, i.e. high-dimensional voids present in the data. This representation naturally does not rely on voxel-by-voxel correspondence and is robust towards noise. We show that these time-varying persistence diagrams can be clustered to find meaningful groupings between participants, and that they are also useful in studying within-subject brain state trajectories of subjects performing a particular task. Here, we apply both clustering and trajectory analysis techniques to a group of participants watching the movie 'Partly Cloudy'. We observe significant differences in both brain state trajectories and overall topological activity between adults and children watching the same movie.
Bastian Rieck, Tristan Yates, Christian Bock, Karsten M. Borgwardt, Guy Wolf, Nicholas B. Turk-Browne, Smita Krishnaswamy
NeurIPS6
2020 BrainIAK tutorials: User-friendly learning materials for advanced fMRI analysis
abstract
Advanced brain imaging analysis methods, including multivariate pattern analysis (MVPA), functional connectivity, and functional alignment, have become powerful tools in cognitive neuroscience over the past decade. These tools are implemented in custom code and separate packages, often requiring different software and language proficiencies. Although usable by expert researchers, novice users face a steep learning curve. These difficulties stem from the use of new programming languages (e.g., Python), learning how to apply machine-learning methods to high-dimensional fMRI data, and minimal documentation and training materials. Furthermore, most standard fMRI analysis packages (e.g., AFNI, FSL, SPM) focus on preprocessing and univariate analyses, leaving a gap in how to integrate with advanced tools. To address these needs, we developed BrainIAK (brainiak.org), an open-source Python software package that seamlessly integrates several cutting-edge, computationally efficient techniques with other Python packages (e.g., Nilearn, Scikit-learn) for file handling, visualization, and machine learning. To disseminate these powerful tools, we developed user-friendly tutorials (in Jupyter format; https://brainiak.org/tutorials/) for learning BrainIAK and advanced fMRI analysis in Python more generally. These materials cover techniques including: MVPA (pattern classification and representational similarity analysis); parallelized searchlight analysis; background connectivity; full correlation matrix analysis; inter-subject correlation; inter-subject functional connectivity; shared response modeling; event segmentation using hidden Markov models; and real-time fMRI. For long-running jobs or large memory needs we provide detailed guidance on high-performance computing clusters. These notebooks were successfully tested at multiple sites, including as problem sets for courses at Yale and Princeton universities and at various workshops and hackathons. These materials are freely shared, with the hope that they become part of a pool of open-source software and educational materials for large-scale, reproducible fMRI analysis and accelerated discovery.
Manoj Kumar 0025, Cameron T. Ellis, Qihong Lu, Mihai Capota, Theodore L. Willke, Peter J. Ramadge, Nicholas B. Turk-Browne, Kenneth A. Norman
PLoS Comput. Biol.8
2020 Searching through functional space reveals distributed visual, auditory, and semantic coding in the human brain
abstract
The extent to which brain functions are localized or distributed is a foundational question in neuroscience. In the human brain, common fMRI methods such as cluster correction, atlas parcellation, and anatomical searchlight are biased by design toward finding localized representations. Here we introduce the functional searchlight approach as an alternative to anatomical searchlight analysis, the most commonly used exploratory multivariate fMRI technique. Functional searchlight removes any anatomical bias by grouping voxels based only on functional similarity and ignoring anatomical proximity. We report evidence that visual and auditory features from deep neural networks and semantic features from a natural language processing model, as well as object representations, are more widely distributed across the brain than previously acknowledged and that functional searchlight can improve model-based similarity and decoding accuracy. This approach provides a new way to evaluate and constrain computational models with brain activity and pushes our understanding of human brain function further along the spectrum from strict modularity toward distributed representation.
Sreejan Kumar, Cameron T. Ellis, Thomas P. O'Connell, Marvin M. Chun, Nicholas B. Turk-Browne
PLoS Comput. Biol.5
2019 Deep Graph Similarity Learning for Brain Data Analysis
abstract
We propose an end-to-end graph similarity learning framework called Higher-order Siamese GCN for multi-subject fMRI data analysis. The proposed framework learns the brain network representations via a supervised metric-based approach with siamese neural networks using two graph convolutional networks as the twin networks. Our proposed framework performs higher-order convolutions by incorporating higher-order proximity in graph convolutional networks to characterize and learn the community structure in brain connectivity networks. To the best of our knowledge, this is the first community-preserving graph similarity learning framework for multi-subject brain network analysis. Experimental results on four real fMRI datasets demonstrate the potential use cases of the proposed framework for multi-subject brain analysis in health and neuropsychiatric disorders. Our proposed approach achieves an average AUC gain of $75$% compared to PCA, an average AUC gain of $65.5$% compared to Spectral Embedding, and an average AUC gain of $24.3$% compared to S-GCN across the four datasets, indicating promising applications in clinical investigation and brain disease diagnosis.
Guixiang Ma, Nesreen K. Ahmed, Theodore L. Willke, Dipanjan Sengupta, Michael W. Cole, Nicholas B. Turk-Browne, Philip S. Yu
CIKM6
2019 A generalization becomes suppressed over time in the context of exceptions
Karina Tachihara, Kenneth A. Norman, Nicholas B. Turk-Browne, Adele Goldberg 0002
CogSci3
2018 A mouse-tracking study of how exceptions to a probabilistic generalization are learned
Karina Tachihara, Kenneth A. Norman, Nicholas B. Turk-Browne, Adele Goldberg 0002
CogSci3
2018 Capturing Shared and Individual Information in fMRI Data
abstract
Cognitive neuroscience seeks to explain the organization of the brain, but typically focuses on aspects that are shared across people rather than those that vary across individuals. Here, we present a new method for analyzing brain imaging data that captures both shared and individual components of brain activity. Inspired by the shared response model (SRM) and the robust principal components analysis, the robust shared response model (RSRM) aligns functional topographies across humans while preserving a component of sparse, individual activity. Experimental results on adult data showed that RSRM performs as well as or better than SRM, while at the same time capturing reliable markers of individual variability. In a test case of participants with extreme variability, we found that RSRM was able to improve the accuracy more than 60% over SRM for the coding of infant fMRI data.
Javier Turek, Cameron T. Ellis, Lena J. Skalaban, Nicholas B. Turk-Browne, Theodore L. Willke
ICASSP4
2017 Noise correlations in the human brain and their impact on pattern classification
abstract
Multivariate decoding methods, such as multivoxel pattern analysis (MVPA), are highly effective at extracting information from brain imaging data. Yet, the precise nature of the information that MVPA draws upon remains controversial. Most current theories emphasize the enhanced sensitivity imparted by aggregating across voxels that have mixed and weak selectivity. However, beyond the selectivity of individual voxels, neural variability is correlated across voxels, and such noise correlations may contribute importantly to accurate decoding. Indeed, a recent computational theory proposed that noise correlations enhance multivariate decoding from heterogeneous neural populations. Here we extend this theory from the scale of neurons to functional magnetic resonance imaging (fMRI) and show that noise correlations between heterogeneous populations of voxels (i.e., voxels selective for different stimulus variables) contribute to the success of MVPA. Specifically, decoding performance is enhanced when voxels with high vs. low noise correlations (measured during rest or in the background of the task) are selected during classifier training. Conversely, voxels that are strongly selective for one class in a GLM or that receive high classification weights in MVPA tend to exhibit high noise correlations with voxels selective for the other class being discriminated against. Furthermore, we use simulations to show that this is a general property of fMRI data and that selectivity and noise correlations can have distinguishable influences on decoding. Taken together, our findings demonstrate that if there is signal in the data, the resulting above-chance classification accuracy is modulated by the magnitude of noise correlations.
Vikranth R. Bejjanki, Rava Azeredo da Silveira, Jonathan D. Cohen 0003, Nicholas B. Turk-Browne
PLoS Comput. Biol.4
2016 Real-time full correlation matrix analysis of fMRI data
abstract
Real-time functional magnetic resonance imaging (rtfMRI) is an emerging approach for studying the functioning of the human brain. Computational challenges combined with high data velocity have to this point restricted rtfMRI analyses to studying regions of the brain independently. However, given that neural processing is accomplished via functional interactions among brain regions, neuroscience could stand to benefit from rtfMRI analyses of full-brain interactions. In this paper, we extend such an offline analysis method, full correlation matrix analysis (FCMA), to enable its use in rtfMRI studies. Specifically, we introduce algorithms capable of processing real-time data for all stages of the FCMA machine learning workflow: incremental feature selection, model updating, and real-time classification. We also present an actor-model based distributed system designed to support FCMA and other rtfMRI analysis methods. Experiments show that our system successfully analyzes a stream of brain volumes and returns neurofeedback with less than 180 ms of lag. Our real-time FCMA implementation provides the same accuracy as an optimized offline FCMA toolbox while running 3.6–6.2x faster.
Yida Wang 0003, Bryn Keller, Mihai Capota, Michael J. Anderson, Narayanan Sundaram, Jonathan D. Cohen 0003, Kai Li 0001, Nicholas B. Turk-Browne, Theodore L. Willke
IEEE BigData8
2015 Common object representations for visual recognition and production
Judith E. Fan, Dan Yamins, Nicholas B. Turk-Browne
CogSci3
2015 Full correlation matrix analysis of fMRI data on Intel® Xeon Phi™ coprocessors
abstract
Full correlation matrix analysis (FCMA) is an unbiased approach for exhaustively studying interactions among brain regions in functional magnetic resonance imaging (fMRI) data from human participants. In order to answer neuroscientific questions efficiently, we are developing a closed-loop analysis system with FCMA on a cluster of nodes with Intel® Xeon Phi™ coprocessors. Here we propose several ideas for data-driven algorithmic modification to improve the performance on the coprocessor. Our experiments with real datasets show that the optimized single-node code runs 5x-16x faster than the baseline implementation using the well-known Intel® MKL and LibSVM libraries, and that the cluster implementation achieves near linear speedup on 5760 cores.
Yida Wang 0003, Michael J. Anderson, Jonathan D. Cohen 0003, Alexander Heinecke, Kai Li 0001, Nadathur Satish, Narayanan Sundaram, Nicholas B. Turk-Browne, Theodore L. Willke
SC8