Efficient learning of differential network in multi-source non-paranormal graphical models
<|reference_start|>Efficient learning of differential network in multi-source non-paranormal graphical models: This paper addresses learning of sparse structural changes or differential network between two classes of non-paranormal graphical models. We assume a multi-source and heterogeneous dataset is available for each class, where the covariance matrices are identical for all non-paranormal graphical models. The differential network, which are encoded by the difference precision matrix, can then be decoded by optimizing a lasso penalized D-trace loss function. To this aim, an efficient approach is proposed that outputs the exact solution path, outperforming the previous methods that only sample from the solution path in pre-selected regularization parameters. Notably, our proposed method has low computational complexity, especially when the differential network are sparse. Our simulations on synthetic data demonstrate a superior performance for our strategy in terms of speed and accuracy compared to an existing method. Moreover, our strategy in combining datasets from multiple sources is shown to be very effective in inferring differential network in real-world problems. This is backed by our experimental results on drug resistance in tumor cancers. In the latter case, our strategy outputs important genes for drug resistance which are already confirmed by various independent studies.<|reference_end|>
@article{nikahd2024efficient,
    title={Efficient learning of differential network in multi-source
  non-paranormal graphical models},
    author={Mojtaba Nikahd and Seyed Abolfazl Motahari},
    journal={arXiv preprint arXiv:2410.02496},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.02496},
    primaryClass={cs.LG}
}