Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2503.18722 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915655023853568 |
|---|---|
| author | Liu, Shixiang Zhang, Yanhang Li, Zhifan Yin, Jianxin |
| author_facet | Liu, Shixiang Zhang, Yanhang Li, Zhifan Yin, Jianxin |
| contents | Multi-sourced datasets are common in studies of variable interactions, for example, individual-level fMRI integration, cross-domain recommendation, etc, where each source induces a related but distinct dependency structure. Joint learning of multiple graphical models (i.e., multiple precision matrices) has emerged as an important tool in analyzing such data. Unlike separate learning, joint learning can leverage shared structural patterns across graphs to yield more accurate results. In this paper, we present an efficient and adaptive method named MIGHT (\textbf{M}ulti-task \textbf{I}terative \textbf{G}raphical \textbf{H}ard \textbf{T}hresholding) to estimate multiple graphs jointly. We reformulate the joint model into a series of multi-task learning problems through a column-by-column manner, and solve these problems using a dynamic regularized algorithm based on iterative hard thresholding. This framework is inherently parallelizable and therefore efficient in computation. Theoretically, we derive the non-asymptotic error bound for the resulting estimator. Furthermore, the proposed algorithm is adaptive to heterogeneous column-wise signal strengths: for nodes with strong signals, our estimator achieves improved error bounds and selection consistency adaptively, and also exhibits asymptotic normality -- properties rarely explored in existing joint learning methods. The performance of our method is illustrated through numerical simulations and real data analysis on a cancer gene-expression RNA-seq dataset. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_18722 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Learning Joint Graphical Model with Computational Efficiency, Dynamic Regularization, and Adaptation Liu, Shixiang Zhang, Yanhang Li, Zhifan Yin, Jianxin Methodology Multi-sourced datasets are common in studies of variable interactions, for example, individual-level fMRI integration, cross-domain recommendation, etc, where each source induces a related but distinct dependency structure. Joint learning of multiple graphical models (i.e., multiple precision matrices) has emerged as an important tool in analyzing such data. Unlike separate learning, joint learning can leverage shared structural patterns across graphs to yield more accurate results. In this paper, we present an efficient and adaptive method named MIGHT (\textbf{M}ulti-task \textbf{I}terative \textbf{G}raphical \textbf{H}ard \textbf{T}hresholding) to estimate multiple graphs jointly. We reformulate the joint model into a series of multi-task learning problems through a column-by-column manner, and solve these problems using a dynamic regularized algorithm based on iterative hard thresholding. This framework is inherently parallelizable and therefore efficient in computation. Theoretically, we derive the non-asymptotic error bound for the resulting estimator. Furthermore, the proposed algorithm is adaptive to heterogeneous column-wise signal strengths: for nodes with strong signals, our estimator achieves improved error bounds and selection consistency adaptively, and also exhibits asymptotic normality -- properties rarely explored in existing joint learning methods. The performance of our method is illustrated through numerical simulations and real data analysis on a cancer gene-expression RNA-seq dataset. |
| title | Learning Joint Graphical Model with Computational Efficiency, Dynamic Regularization, and Adaptation |
| topic | Methodology |
| url | https://arxiv.org/abs/2503.18722 |