Try a new search

Format these results:

Searched for:

person:rhr246

in-biosketch:yes

Total Results:

18


A probabilistic approach to discovering dynamic full-brain functional connectivity patterns

Manning, Jeremy R; Zhu, Xia; Willke, Theodore L; Ranganath, Rajesh; Stachenfeld, Kimberly; Hasson, Uri; Blei, David M; Norman, Kenneth A
Recent research shows that the covariance structure of functional magnetic resonance imaging (fMRI) data - commonly described as functional connectivity - can change as a function of the participant's cognitive state (for review see Turk-Browne, 2013). Here we present a Bayesian hierarchical matrix factorization model, termed hierarchical topographic factor analysis (HTFA), for efficiently discovering full-brain networks in large multi-subject neuroimaging datasets. HTFA approximates each subject's network by first re-representing each brain image in terms of the activities of a set of localized nodes, and then computing the covariance of the activity time series of these nodes. The number of nodes, along with their locations, sizes, and activities (over time) are learned from the data. Because the number of nodes is typically substantially smaller than the number of fMRI voxels, HTFA can be orders of magnitude more efficient than traditional voxel-based functional connectivity approaches. In one case study, we show that HTFA recovers the known connectivity patterns underlying a collection of synthetic datasets. In a second case study, we illustrate how HTFA may be used to discover dynamic full-brain activity and connectivity patterns in real fMRI data, collected as participants listened to a story. In a third case study, we carried out a similar series of analyses on fMRI data collected as participants viewed an episode of a television show. In these latter case studies, we found that the HTFA-derived activity and connectivity patterns can be used to reliably decode which moments in the story or show the participants were experiencing. Further, we found that these two classes of patterns contained partially non-overlapping information, such that decoders trained on combinations of activity-based and dynamic connectivity-based features performed better than decoders trained on activity or connectivity patterns alone. We replicated this latter result with two additional (previously developed) methods for efficiently characterizing full-brain activity and connectivity patterns.
PMID: 29448074
ISSN: 1095-9572
CID: 3243602

Correlated Random Measures

Ranganath, Rajesh; Blei, David M.
We develop correlated random measures, random measures where the atom weights can exhibit a flexible pattern of dependence, and use them to develop powerful hierarchical Bayesian nonparametric models. Hierarchical Bayesian nonparametric models are usually built from completely random measures, a Poisson-process-based construction in which the atom weights are independent. Completely random measures imply strong independence assumptions in the corresponding hierarchical model, and these assumptions are often misplaced in real-world settings. Correlated random measures address this limitation. They model correlation within the measure by using a Gaussian process in concert with the Poisson process. With correlated random measures, for example, we can develop a latent feature model for which we can infer both the properties of the latent features and their dependency pattern. We develop several other examples as well. We study a correlated random measure model of pairwise count data. We derive an efficient variational inference algorithm and show improved predictive performance on large datasets of documents, web clicks, and electronic health records. Supplementary materials for this article are available online.
ISI:000438960500041
ISSN: 0162-1459
CID: 3243652

Identifying potentially induced seismicity and assessing statistical significance in Oklahoma and California

McClure, Mark; Gibson, Riley; Chiu, Kit-Kwan; Ranganath, Rajesh
We develop a statistical method for identifying induced seismicity from large data sets and apply the method to decades of wastewater disposal and seismicity data in California and Oklahoma. The study regions are divided into grid blocks. We use a longitudinal study design, seeking associations between seismicity and wastewater injection volume along time series within each grid block. In each grid block, we find the maximum likelihood estimate for a model parameter that relates induced seismicity hazard to total volume of wastewater injected each year. To assess significance, we compute likelihood ratio test statistics in each grid block and each state, California and Oklahoma. Resampling with permutation and random temporal offset of injection data is used to estimate p values from the likelihood ratio statistics. We focus on assessing whether observed associations between injection and seismicity occur more often than would be expected by chance; we do not attempt to quantify the overall incidence of induced seismicity. The study is designed so that, under reasonable assumptions, the associations can be formally interpreted as demonstrating causality. Wastewater disposal is associated with other activities that can induce seismicity, such as reservoir depletion. Therefore, our results should be interpreted as finding seismicity induced by wastewater disposal and all other associated activities. In Oklahoma, the analysis finds with extremely high confidence that seismicity associated with wastewater disposal has occurred. In California, the analysis finds moderate evidence that seismicity associated with wastewater disposal has occurred, but the result is not strong enough to be conclusive.
ISI:000399660300033
ISSN: 2169-9313
CID: 3243632

Automatic Differentiation Variational Inference

Kucukelbir, Alp; Tran, Dustin; Ranganath, Rajesh; Gelman, Andrew; Blei, David M.
Probabilistic modeling is iterative. A scientist posits a simple model, fits it to her data, refines it according to her analysis, and repeats. However, fitting complex models to large data is a bottleneck in this process. Deriving algorithms for new models can be both mathematically and computationally challenging, which makes it difficult to efficiently cycle through the steps. To this end, we develop automatic differentiation variational inference (ADVI). Using our method, the scientist only provides a probabilistic model and a dataset, nothing else. ADVI automatically derives an efficient variational inference algorithm, freeing the scientist to refine and explore many models. ADVI supports a broad class of models-no conjugacy assumptions are required. We study ADVI across ten modern probabilistic models and apply it to a dataset with millions of observations. We deploy ADVI as part of Stan, a probabilistic programming system.
ISI:000399838100001
ISSN: 1532-4435
CID: 3243642

Risk prediction for chronic kidney disease progression using heterogeneous electronic health record data and time series analysis

Perotte, Adler; Ranganath, Rajesh; Hirsch, Jamie S; Blei, David; Elhadad, NoƩmie
BACKGROUND:As adoption of electronic health records continues to increase, there is an opportunity to incorporate clinical documentation as well as laboratory values and demographics into risk prediction modeling. OBJECTIVE:The authors develop a risk prediction model for chronic kidney disease (CKD) progression from stage III to stage IV that includes longitudinal data and features drawn from clinical documentation. METHODS:The study cohort consisted of 2908 primary-care clinic patients who had at least three visits prior to January 1, 2013 and developed CKD stage III during their documented history. Development and validation cohorts were randomly selected from this cohort and the study datasets included longitudinal inpatient and outpatient data from these populations. Time series analysis (Kalman filter) and survival analysis (Cox proportional hazards) were combined to produce a range of risk models. These models were evaluated using concordance, a discriminatory statistic. RESULTS:A risk model incorporating longitudinal data on clinical documentation and laboratory test results (concordance 0.849) predicts progression from state III CKD to stage IV CKD more accurately when compared to a similar model without laboratory test results (concordance 0.733, P<.001), a model that only considers the most recent laboratory test results (concordance 0.819, P < .031) and a model based on estimated glomerular filtration rate (concordance 0.779, P < .001). CONCLUSIONS:A risk prediction model that takes longitudinal laboratory test results and clinical documentation into consideration can predict CKD progression from stage III to stage IV more accurately than three models that do not take all of these variables into consideration.
PMCID:4482276
PMID: 25896647
ISSN: 1527-974x
CID: 3243592

Topographic factor analysis: a Bayesian model for inferring brain networks from neural data

Manning, Jeremy R; Ranganath, Rajesh; Norman, Kenneth A; Blei, David M
The neural patterns recorded during a neuroscientific experiment reflect complex interactions between many brain regions, each comprising millions of neurons. However, the measurements themselves are typically abstracted from that underlying structure. For example, functional magnetic resonance imaging (fMRI) datasets comprise a time series of three-dimensional images, where each voxel in an image (roughly) reflects the activity of the brain structure(s)-located at the corresponding point in space-at the time the image was collected. FMRI data often exhibit strong spatial correlations, whereby nearby voxels behave similarly over time as the underlying brain structure modulates its activity. Here we develop topographic factor analysis (TFA), a technique that exploits spatial correlations in fMRI data to recover the underlying structure that the images reflect. Specifically, TFA casts each brain image as a weighted sum of spatial functions. The parameters of those spatial functions, which may be learned by applying TFA to an fMRI dataset, reveal the locations and sizes of the brain structures activated while the data were collected, as well as the interactions between those structures.
PMCID:4012983
PMID: 24804795
ISSN: 1932-6203
CID: 3243582

Detecting friendly, flirtatious, awkward, and assertive speech in speed-dates

Ranganath, Rajesh; Jurafsky, Dan; McFarland, Daniel A.
Automatically detecting human social intentions and attitudes from spoken conversation is an important task for speech processing and social computing. We describe a system for detecting interpersonal stance: whether a speaker is flirtatious,friendly, awkward, or assertive. We make use of a new spoken corpus of over 1000 4-min speed-dates. Participants rated themselves and their interlocutors for these interpersonal stances, allowing us to build detectors for style both as interpreted by the speaker and as perceived by the hearer. We use lexical, prosodic, and dialog features in an SVM classifier to detect very clear styles (the strongest 10% in each stance) with up to 75% accuracy on previously seen speakers (50% baseline) and up to 59% accuracy on new speakers (48% baseline). A feature analysis suggests that flirtation is marked by joint focus on the woman as a target of the conversation, awkwardness by decreased speaker involvement, and friendliness by a conversational style including other-directed laughter and appreciations. Our work has implications for our understanding of interpersonal stance, their linguistic expression, and their automatic extraction. (C) 2012 Elsevier Ltd. All rights reserved.
ISI:000311524800006
ISSN: 0885-2308
CID: 3243622

Unsupervised Learning of Hierarchical Representations with Convolutional Deep Belief Networks

Lee, Honglak; Grosse, Roger; Ranganath, Rajesh; Ng, Andrew Y.
There has been much interest in unsupervised learning of hierarchical generative models such as deep belief networks (DBNs); however, scaling such models to full-sized, high-dimensional images remains a difficult problem. To address this problem, we present the convolutional deep belief network, a hierarchical generative model that scales to realistic image sizes. This model is translation-invariant and supports efficient bottom-up and top-down probabilistic inference. Key to our approach is probabilistic max-pooling, a novel technique that shrinks the representations of higher layers in a probabilistically sound way. Our experiments show that the algorithm learns useful high-level visual features, such as object parts, from unlabeled images of objects and natural scenes. We demonstrate excellent performance on several visual recognition tasks and show that our model can perform hierarchical (bottom-up and top-down) inference over full-sized images.
ISI:000296022500023
ISSN: 0001-0782
CID: 3243612