DeepAI AI Chat
Log In Sign Up

A Fast Iterative Algorithm for High-dimensional Differential Network

by   Zhou Tang, et al.
Shanghai Jiao Tong University

Differential network is an important tool to capture the changes of conditional correlations under two sample cases. In this paper, we introduce a fast iterative algorithm to recover the differential network for high-dimensional data. The computation complexity of our algorithm is linear in the sample size and the number of parameters, which is optimal in the sense that it is of the same order as computing two sample covariance matrices. The proposed method is appealing for high-dimensional data with a small sample size. The experiments on simulated and real data sets show that the proposed algorithm outperforms other existing methods.


page 1

page 2

page 3

page 4


An efficient ADMM algorithm for high dimensional precision matrix estimation via penalized quadratic loss

The estimation of high dimensional precision matrices has been a central...

Kendall's tau in high-dimensional genomic parsimony

High-dimensional data models, often with low sample size, abound in many...

High Dimensional Data Enrichment: Interpretable, Fast, and Data-Efficient

High dimensional structured data enriched model describes groups of obse...

Human-in-the-loop Active Covariance Learning for Improving Prediction in Small Data Sets

Learning predictive models from small high-dimensional data sets is a ke...

Dynamic Principal Subspaces with Sparsity in High Dimensions

Principal component analysis (PCA) is a versatile tool to reduce the dim...

Learning Markov Network Structure using Brownian Distance Covariance

In this paper, we present a simple non-parametric method for learning th...

Sketching Meets Random Projection in the Dual: A Provable Recovery Algorithm for Big and High-dimensional Data

Sketching techniques have become popular for scaling up machine learning...