Graph Meets Deep Unfolding: An Interpretable Mutual-benefit Multi-view Learning Network
Renjie Lin, Hongzhi He, Yilin Wu, Shide Du, Le Zhang
Abstract
Significant efforts have been focused on enhancing the utilization of multiple node features and topological structures in multi-view graph learning through explicit model-driven and implicit deep learning-based methodologies. The former excels in embedding prior knowledge, thereby offering theoretical interpretability but is limited in application flexibility due to manual parameter selection. In contrast, the latter leverages automatic differentiation, providing greater flexibility but lacking theoretical interpretability due to their opaque nature. Motivated by these observations, we propose an interpretable deep unfolding network for mutual-benefit multi-view graph learning, aiming to combine the strengths of both approaches. Specifically, we employ the Alternating Direction Method of Multipliers (ADMM) to solve a multi-view graph learning model with sparse and low-rank constraints. This solution is then integrated into deep unfolding networks to enhance interpretability. Furthermore, we convert optimization conditions into implicit losses and utilize automatic differentiation to update parameters, reducing the need for manual tuning and increasing flexibility. This integration optimizes multi-view learning for a graph representation that balances interpretability and flexibility. Empirical evaluations on six diverse datasets demonstrate the effectiveness and superiority of the proposed method over state-of-the-art approaches.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1bd0fbf6-c2d3-4c48-bccb-75f51ee86115Builds on14
- Efficient Orthogonal Multi-view Subspace ClusteringMan-Sheng Chen, Chang-Dong Wang, Dong Huang, Jian-Huang Lai et al.KDD 2022 · 102 citations
- Deep Safe Multi-view Clustering: Reducing the Risk of Clustering Performance Degradation Caused by View IncreaseHuayi Tang, Yong LiuCVPR 2022 · 69 citations
- Stationary Diffusion State Neural Estimation for Multiview ClusteringChenghua Liu, Zhuolin Liao, Yixuan Ma, Kun ZhanAAAI 2022 · 65 citations
- A Non-parametric Graph Clustering Framework for Multi-View DataShengju Yu, Siwei Wang, Zhibin Dong, Wenxuan Tu et al.AAAI 2024 · 33 citations
- FairGP: A Scalable and Fair Graph Transformer Using Graph PartitioningRenqiang Luo, Huafei Huang, Ivan Lee, Chengpei Xu et al.AAAI 2025 · 20 citations
Related papers
- OIMGC-Net: Optimization-inspired Interpretable Multi-view Graph Clustering NetworkRenjie Lin, Jiacheng Li, Shide Du, Shiping Wang et al.ACM MM 2025
- OpenViewer: Openness-Aware Multi-View LearningShide Du, Zihan Fang, Yanchao Tan, Changwei Wang et al.AAAI 2025 · 5 citations
- Towards Multi-view Consistent Graph DiffusionJielong Lu, Zhihao Wu, Zhaoliang Chen, Zhiling Cai et al.ACM MM 2024 · 18 citations
- Uncertainty-Aware Pseudo-Labeling and Dual Graph Driven Network for Incomplete Multi-View Multi-Label ClassificationWulin Xie, Xiaohuan Lu, Yadong Liu, Jiang Long et al.ACM MM 2024 · 17 citations
- Graph Triple Attention Networks: A Decoupled PerspectiveXiaotang Wang, Yun Zhu, Haizhou Shi, Yongchao Liu et al.KDD 2025 · 1 citation
