The effect of emotional faces on reward-related probability learning in depressed patients

BACKGROUND

Existing research indicates that individuals with Major Depressive Disorder (MDD) exhibit a bias toward salient negative stimuli. However, the impact of such biased stimuli on concurrent cognitive and affective processes in individuals with depression remains inadequately understood. This study aimed to investigate the effects of salient environmental stimuli, specifically emotional faces, on reward-associated processes in MDD.

METHODS

Thirty-three patients with recurrent MDD and thirty-two healthy controls (HC) matched for age, sex, and education were included in the study. We used a reward-related associative learning (RRAL) task primed with emotional (happy, sad, neutral) faces to investigate the effect of salient stimuli on reward-related learning and decision-making in functional magnetic resonance imaging (fMRI). Participants were instructed to ignore emotional faces during the task. The fMRI data were analyzed using a full-factorial general linear model (GLM) in Statistical Parametric Mapping (SPM12).

RESULTS

In depressed patients, cues primed with sad faces were associated with reduced amygdala activation. However, both HC and MDD group exhibited reduced ventral striatal activity while learning reward-related cues and receiving rewards.

LIMITATIONS

The patients'medication usage was not standardized.

CONCLUSIONS

This study underscores the functional alteration of the amygdala in response to cognitive tasks presented with negative emotionally salient stimuli in the environment of MDD patients. The observed alterations in amygdala activity suggest potential interconnected effects with other regions of the prefrontal cortex. Understanding the intricate neural connections and their disruptions in depression is crucial for unraveling the complex pathophysiology of the disorder.

Genetic underpinnings of brain structural connectome for young adults

With distinct advantages in power over behavioral phenotypes, brain imaging traits have become emerging endophenotypes to dissect molecular contributions to behaviors and neuropsychiatric illnesses. Among different imaging features, brain structural connectivity (i.e., structural connectome) which summarizes the anatomical connections between different brain regions is one of the most cutting edge while under-investigated traits; and the genetic influence on the structural connectome variation remains highly elusive. Relying on a landmark imaging genetics study for young adults, we develop a biologically plausible brain network response shrinkage model to comprehensively characterize the relationship between high dimensional genetic variants and the structural connectome phenotype. Under a unified Bayesian framework, we accommodate the topology of brain network and biological architecture within the genome; and eventually establish a mechanistic mapping between genetic biomarkers and the associated brain sub-network units. An efficient expectation-maximization algorithm is developed to estimate the model and ensure computing feasibility. In the application to the Human Connectome Project Young Adult (HCP-YA) data, we establish the genetic underpinnings which are highly interpretable under functional annotation and brain tissue eQTL analysis, for the brain white matter tracts connecting the hippocampus and two cerebral hemispheres. We also show the superiority of our method in extensive simulations.

Outlier detection for multi-network data

MOTIVATION

It has become routine in neuroscience studies to measure brain networks for different individuals using neuroimaging. These networks are typically expressed as adjacency matrices, with each cell containing a summary of connectivity between a pair of brain regions. There is an emerging statistical literature describing methods for the analysis of such multi-network data in which nodes are common across networks but the edges vary. However, there has been essentially no consideration of the important problem of outlier detection. In particular, for certain subjects, the neuroimaging data are so poor quality that the network cannot be reliably reconstructed. For such subjects, the resulting adjacency matrix may be mostly zero or exhibit a bizarre pattern not consistent with a functioning brain. These outlying networks may serve as influential points, contaminating subsequent statistical analyses. We propose a simple Outlier DetectIon for Networks (ODIN) method relying on an influence measure under a hierarchical generalized linear model for the adjacency matrices. An efficient computational algorithm is described, and ODIN is illustrated through simulations and an application to data from the UK Biobank.

RESULTS

ODIN was successful in identifying moderate to extreme outliers. Removing such outliers can significantly change inferences in downstream applications.

AVAILABILITY AND IMPLEMENTATION

ODIN has been implemented in both Python and R and these implementations along with other code are publicly available at github.com/pritamdey/ODIN-python and github.com/pritamdey/ODIN-r, respectively.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Generalized Connectivity Matrix Response Regression with Applications in Brain Connectivity Studies

Multiple-subject network data are fast emerging in recent years, where a separate connectivity matrix is measured over a common set of nodes for each individual subject, along with subject covariates information. In this article, we propose a new generalized matrix response regression model, where the observed network is treated as a matrix-valued response and the subject covariates as predictors. The new model characterizes the population-level connectivity pattern through a low-rank intercept matrix, and the effect of subject covariates through a sparse slope tensor. We develop an efficient alternating gradient descent algorithm for parameter estimation, and establish the non-asymptotic error bound for the actual estimator from the algorithm, which quantifies the interplay between the computational and statistical errors. We further show the strong consistency for graph community recovery, as well as the edge selection consistency. We demonstrate the efficacy of our method through simulations and two brain connectivity studies.

Clustering of heterogeneous populations of networks

Statistical methods for reconstructing networks from repeated measurements typically assume that all measurements are generated from the same underlying network structure. This need not be the case, however. People's social networks might be different on weekdays and weekends, for instance. Brain networks may differ between healthy patients and those with dementia or other conditions. Here we describe a Bayesian analysis framework for such data that allows for the fact that network measurements may be reflective of multiple possible structures. We define a finite mixture model of the measurement process and derive a Gibbs sampling procedure that samples exactly from the full posterior distribution of model parameters. The end result is a clustering of the measured networks into groups with similar structure. We demonstrate the method on both real and synthetic network populations.

Latent space models for multiplex networks with shared structure

Latent space models are frequently used for modelling single-layer networks and include many popular special cases, such as the stochastic block model and the random dot product graph. However, they are not well-developed for more complex network structures, which are becoming increasingly common in practice. Here we propose a new latent space model for multiplex networks: multiple, heterogeneous networks observed on a shared node set. Multiplex networks can represent a network sample with shared node labels, a network evolving over time, or a network with multiple types of edges. The key feature of our model is that it learns from data how much of the network structure is shared between layers and pools information across layers as appropriate. We establish identifiability, develop a fitting procedure using convex optimization in combination with a nuclear norm penalty, and prove a guarantee of recovery for the latent positions as long as there is sufficient separation between the shared and the individual latent subspaces. We compare the model to competing methods in the literature on simulated networks and on a multiplex network describing the worldwide trade of agricultural products.