Research map / Graph learning / GNN architectures
GMV: A Unified and Efficient Graph Multi-View Learning Framework
Qipeng zhu, Jie Chen, Jian Pu, Junping Zhang
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes GMV, a graph multi-view learning framework that uses the lottery ticket hypothesis to activate diverse sub-networks within a single GNN for graph classification.
Problem
GNNs for graph classification often generalize poorly and overfit; existing multi-view approaches are costly in compute.
Approach
Integrates multi-view learning into GNNs by leveraging the lottery ticket hypothesis to activate diverse sub-networks within a single GNN through a novel training pipeline, avoiding training multiple separate models.
Experimental setup
Builds on: lottery ticket hypothesis
Closest papers by meaning
- MultiNet: Adaptive Multi-Viewed Subgraph Convolutional Networks for Graph Classification (NeurIPS 2025 · similarity 0.88)
- A Manifold Perspective on the Statistical Generalization of Graph Neural Networks (ICML 2025 · similarity 0.87)
- Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024 · similarity 0.87)
- HeterGP: Bridging Heterogeneity in Graph Neural Networks with Multi-View Prompting (AAAI 2025 · similarity 0.87)
- Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellence (ICML 2025 · similarity 0.87)
- Towards Bridging Generalization and Expressivity of Graph Neural Networks (ICLR 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
