Research map / Graph learning / GNN architectures
IGNN-Solver: A Graph Neural Solver for Implicit Graph Neural Networks
Junchao Lin, Zenan Ling, Zhanbo Feng, Jingwen Xu, Minxuan Liao, Feng Zhou, Tianqi Hou, Zhenyu Liao, Robert C. Qiu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace Anderson Acceleration with learned graph neural solver | IGNN-Solver · Reddit | accuracy: 92.30 -> 93.91 | Improved |
| use tiny GNN instead of plain neural network as solver predictor (ablation) | IGNN-Solver · Flickr | accuracy: 78.55 -> 80.14 | Improved |
| use tiny GNN instead of plain neural network as solver predictor (ablation) | IGNN-Solver · Reddit | accuracy: 92.42 -> 93.91 | Improved |
| use generalized learned solver instead of original Anderson Acceleration (ablation) | IGNN-Solver · Amazon-all | accuracy: 83.44 -> 84.50 | Improved |
| add IGNN-Solver to IGNN | IGNN · Amazon-all | inference speed: 8x faster inference | Improved |
| add IGNN-Solver to IGNN | IGNN · all datasets | inference speed: at least 1.5x acceleration | Improved |
| add IGNN-Solver training overhead | IGNN · Amazon-all | training time: 3 hours vs 1.6 minutes | No clear effect |
| add the initializer (ablation) | IGNN-Solver · Citeseer | convergence | Improved |
| add alpha loss (ablation) | IGNN-Solver · Citeseer | convergence | Improved |
| use monotonically increasing convergence loss weights instead of constant or last-step only (ablation) | IGNN-Solver · Citeseer | convergence | Improved |
| use TCN or GRU instead of NN as solver layer (ablation) | IGNN-Solver · Citeseer | relative residual | Hurt |
Earlier methods this paper compares with
Named baselines from earlier accepted papers in this paper's results tables: better than 1 of 1 on most shared results.
- EIGNN — EIGNN: Efficient Infinite-Depth Graph Neural Networks (NeurIPS 2021) · better on 1 of 1 shared result
Matched by method name in results tables read by AI. Authors' own tables tend to favour the newer method, and a comparison can be missed when a method is renamed.
Closest papers by meaning
- Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness (ICML 2024 · similarity 0.87)
- How Graph Neural Networks Learn: Lessons from Training Dynamics (ICML 2024 · similarity 0.86)
- Generative Graph Pattern Machine (NeurIPS 2025 · similarity 0.86)
- Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning (ICLR 2025 · similarity 0.86)
- AdapterGNN: Parameter-Efficient Fine-Tuning Improves Generalization in GNNs (AAAI 2024 · similarity 0.86)
- Implicit Subgraph Neural Network (ICML 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.
