Transfer Learning in Large-scale Gaussian Graphical Models with False Discovery Rate Control

• URL: http://arxiv.org/abs/2010.11037v1
• Date: Wed, 21 Oct 2020 14:39:14 GMT
• Title: Transfer Learning in Large-scale Gaussian Graphical Models with False Discovery Rate Control
• Authors: Sai Li and T. Tony Cai and Hongzhe Li
• Abstract summary: An estimation algorithm, Trans-CLIME, is proposed and shown to attain a faster convergence rate than the minimax rate in the single study setting. A significant decrease in prediction errors and a significant increase in power for link detection are observed.
• Score: 6.230751621285322
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Transfer learning for high-dimensional Gaussian graphical models (GGMs) is studied with the goal of estimating the target GGM by utilizing the data from similar and related auxiliary studies. The similarity between the target graph and each auxiliary graph is characterized by the sparsity of a divergence matrix. An estimation algorithm, Trans-CLIME, is proposed and shown to attain a faster convergence rate than the minimax rate in the single study setting. Furthermore, a debiased Trans-CLIME estimator is introduced and shown to be element-wise asymptotically normal. It is used to construct a multiple testing procedure for edge detection with false discovery rate control. The proposed estimation and multiple testing procedures demonstrate superior numerical performance in simulations and are applied to infer the gene networks in a target brain tissue by leveraging the gene expressions from multiple other brain tissues. A significant decrease in prediction errors and a significant increase in power for link detection are observed.

Related papers

• Trans-Glasso: A Transfer Learning Approach to Precision Matrix Estimation [30.82913179485628]
  We propose Trans-Glasso, a two-step transfer learning method for precision matrix estimation. We show that Trans-Glasso achieves minimax optimality under certain conditions. We validate Trans-Glasso in applications to gene networks across brain tissues and protein networks for various cancer subtypes.
  arXiv  Detail & Related papers  (2024-11-23T18:30:56Z)
• Convergence of Implicit Gradient Descent for Training Two-Layer Physics-Informed Neural Networks [3.680127959836384]
  implicit gradient descent (IGD) outperforms the common gradient descent (GD) in handling certain multi-scale problems. We show that IGD converges a globally optimal solution at a linear convergence rate.
  arXiv  Detail & Related papers  (2024-07-03T06:10:41Z)
• False Discovery Rate Control for Gaussian Graphical Models via Neighborhood Screening [1.7924920920347915]
  We introduce a nodewise variable selection approach to graph learning and provably control the false discovery rate of the selected edge set at a self-estimated level. A novel fusion method of the individual neighborhoods outputs an undirected graph estimate.
  arXiv  Detail & Related papers  (2024-01-18T13:46:41Z)
• GE-AdvGAN: Improving the transferability of adversarial samples by gradient editing-based adversarial generative model [69.71629949747884]
  Adversarial generative models, such as Generative Adversarial Networks (GANs), are widely applied for generating various types of data. In this work, we propose a novel algorithm named GE-AdvGAN to enhance the transferability of adversarial samples.
  arXiv  Detail & Related papers  (2024-01-11T16:43:16Z)
• Normality Learning-based Graph Anomaly Detection via Multi-Scale Contrastive Learning [61.57383634677747]
  Graph anomaly detection (GAD) has attracted increasing attention in machine learning and data mining. Here, we propose a normality learning-based GAD framework via multi-scale contrastive learning networks (NLGAD for abbreviation) Notably, the proposed algorithm improves the detection performance (up to 5.89% AUC gain) compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-09-12T08:06:04Z)
• HFN: Heterogeneous Feature Network for Multivariate Time Series Anomaly Detection [2.253268952202213]
  We propose a novel semi-supervised anomaly detection framework based on a heterogeneous feature network (HFN) for MTS. We first combine the embedding similarity subgraph generated by sensor embedding and feature value similarity subgraph generated by sensor values to construct a time-series heterogeneous graph. This approach fuses the state-of-the-art technologies of heterogeneous graph structure learning (HGSL) and representation learning.
  arXiv  Detail & Related papers  (2022-11-01T05:01:34Z)
• Multi-task Learning for Gaussian Graphical Regressions with High Dimensional Covariates [5.726899123970559]
  We propose a multi-task learning estimator for fitting Gaussian graphical regression models. For computation, we consider an efficient augmented Lagrangian algorithm, which solves subproblems with a semi-smooth Newton method. We show that the error rate of the multi-task learning based estimates has much improvement over that of the separate node-wise lasso estimates.
  arXiv  Detail & Related papers  (2022-05-21T20:48:51Z)
• Riemannian classification of EEG signals with missing values [67.90148548467762]
  This paper proposes two strategies to handle missing data for the classification of electroencephalograms. The first approach estimates the covariance from imputed data with the $k$-nearest neighbors algorithm; the second relies on the observed data by leveraging the observed-data likelihood within an expectation-maximization algorithm. As results show, the proposed strategies perform better than the classification based on observed data and allow to keep a high accuracy even when the missing data ratio increases.
  arXiv  Detail & Related papers  (2021-10-19T14:24:50Z)
• Statistical control for spatio-temporal MEG/EEG source imaging with desparsified multi-task Lasso [102.84915019938413]
  Non-invasive techniques like magnetoencephalography (MEG) or electroencephalography (EEG) offer promise of non-invasive techniques. The problem of source localization, or source imaging, poses however a high-dimensional statistical inference challenge. We propose an ensemble of desparsified multi-task Lasso (ecd-MTLasso) to deal with this problem.
  arXiv  Detail & Related papers  (2020-09-29T21:17:16Z)
• Improved Slice-wise Tumour Detection in Brain MRIs by Computing Dissimilarities between Latent Representations [68.8204255655161]
  Anomaly detection for Magnetic Resonance Images (MRIs) can be solved with unsupervised methods. We have proposed a slice-wise semi-supervised method for tumour detection based on the computation of a dissimilarity function in the latent space of a Variational AutoEncoder. We show that by training the models on higher resolution images and by improving the quality of the reconstructions, we obtain results which are comparable with different baselines.
  arXiv  Detail & Related papers  (2020-07-24T14:02:09Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.