Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Task-Equivariant Graph Few-shot Learning (2305.18758v4)

Published 30 May 2023 in cs.LG and cs.AI

Abstract: Although Graph Neural Networks (GNNs) have been successful in node classification tasks, their performance heavily relies on the availability of a sufficient number of labeled nodes per class. In real-world situations, not all classes have many labeled nodes and there may be instances where the model needs to classify new classes, making manual labeling difficult. To solve this problem, it is important for GNNs to be able to classify nodes with a limited number of labeled nodes, known as few-shot node classification. Previous episodic meta-learning based methods have demonstrated success in few-shot node classification, but our findings suggest that optimal performance can only be achieved with a substantial amount of diverse training meta-tasks. To address this challenge of meta-learning based few-shot learning (FSL), we propose a new approach, the Task-Equivariant Graph few-shot learning (TEG) framework. Our TEG framework enables the model to learn transferable task-adaptation strategies using a limited number of training meta-tasks, allowing it to acquire meta-knowledge for a wide range of meta-tasks. By incorporating equivariant neural networks, TEG can utilize their strong generalization abilities to learn highly adaptable task-specific strategies. As a result, TEG achieves state-of-the-art performance with limited training meta-tasks. Our experiments on various benchmark datasets demonstrate TEG's superiority in terms of accuracy and generalization ability, even when using minimal meta-training data, highlighting the effectiveness of our proposed approach in addressing the challenges of meta-learning based few-shot node classification. Our code is available at the following link: https://github.com/sung-won-kim/TEG

PDF HTML Abstract
Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Bookmark Chat Bubble Oval Streamline Icon: https://streamlinehq.com Chat (Pro)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. Cormorant: Covariant molecular neural networks. Advances in neural information processing systems 32 (2019).
  2. Aleksandar Bojchevski and Stephan Günnemann. 2017. Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. arXiv preprint arXiv:1707.03815 (2017).
  3. Meta-baseline: Exploring simple meta-learning for few-shot learning. In Proceedings of the IEEE/CVF International Conference on Computer Vision. 9062–9071.
  4. Taco Cohen and Max Welling. 2016a. Group equivariant convolutional networks. In International conference on machine learning. PMLR, 2990–2999.
  5. Taco S Cohen and Max Welling. 2016b. Steerable cnns. arXiv preprint arXiv:1612.08498 (2016).
  6. Graph prototypical networks for few-shot learning on attributed networks. In Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 295–304.
  7. Model-agnostic meta-learning for fast adaptation of deep networks. In International conference on machine learning. PMLR, 1126–1135.
  8. Kexin Huang and Marinka Zitnik. 2020. Graph meta learning via local subgraphs. Advances in Neural Information Processing Systems 33 (2020), 5862–5874.
  9. Heterogeneous Graph Learning for Multi-modal Medical Data Analysis. arXiv preprint arXiv:2211.15158 (2022).
  10. Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016).
  11. Equivariant flows: sampling configurations for multi-body systems with symmetric energies. arXiv preprint arXiv:1910.00753 (2019).
  12. Equivariant flows: exact likelihood generative learning for symmetric densities. In International conference on machine learning. PMLR, 5361–5370.
  13. Grafn: Semi-supervised node classification on graph with few labels via non-parametric distribution assignment. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2243–2248.
  14. Relational self-supervised learning on graphs. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management. 1054–1063.
  15. Augmentation-free self-supervised learning on graphs. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36. 7372–7380.
  16. Classifying and Understanding Financial Data Using Graph Neural Network.
  17. Meta-sgd: Learning to learn quickly for few-shot learning. arXiv preprint arXiv:1707.09835 (2017).
  18. Learning to propagate for graph meta-learning. Advances in Neural Information Processing Systems 32 (2019).
  19. Few-shot node classification on attributed networks with graph meta-learning. In Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. 471–481.
  20. Relative and absolute location embedding for few-shot node classification on graph. In Proceedings of the AAAI conference on artificial intelligence, Vol. 35. 4267–4275.
  21. Inferring networks of substitutable and complementary products. In Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. 785–794.
  22. Relevance of rotationally equivariant convolutions for predicting molecular properties. arXiv preprint arXiv:2008.08461 (2020).
  23. On first-order meta-learning algorithms. arXiv preprint arXiv:1803.02999 (2018).
  24. Exploring context and content links in social media: A latent space method. IEEE Transactions on Pattern Analysis and Machine Intelligence 34, 5 (2011), 850–862.
  25. Sachin Ravi and Hugo Larochelle. 2016. Optimization as a model for few-shot learning. (2016).
  26. Sachin Ravi and Hugo Larochelle. 2017. Optimization as a Model for Few-Shot Learning. In International Conference on Learning Representations. https://openreview.net/forum?id=rJY0-Kcll
  27. Equivariant hamiltonian flows. arXiv preprint arXiv:1909.13739 (2019).
  28. David W Romero and Jean-Baptiste Cordonnier. 2020. Group equivariant stand-alone self-attention for vision. arXiv preprint arXiv:2010.00977 (2020).
  29. E (n) equivariant graph neural networks. In International conference on machine learning. PMLR, 9323–9332.
  30. An overview of microsoft academic service (mas) and applications. In Proceedings of the 24th international conference on world wide web. 243–246.
  31. Prototypical networks for few-shot learning. Advances in neural information processing systems 30 (2017).
  32. Learning to compare: Relation network for few-shot learning. In Proceedings of the IEEE conference on computer vision and pattern recognition. 1199–1208.
  33. Tadanet: Task-adaptive network for graph-enriched meta-learning. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1789–1799.
  34. Transductive Linear Probing: A Novel Framework for Few-Shot Node Classification. arXiv preprint arXiv:2212.05606 (2022).
  35. Arnetminer: extraction and mining of academic social networks. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. 990–998.
  36. Bootstrapped representation learning on graphs. In ICLR 2021 Workshop on Geometrical and Topological Representation Learning.
  37. Rethinking few-shot image classification: a good embedding is all you need?. In Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XIV 16. Springer, 266–282.
  38. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017).
  39. Matching networks for one shot learning. Advances in neural information processing systems 29 (2016).
  40. Graph few-shot learning with task-specific structures. arXiv preprint arXiv:2210.12130 (2022).
  41. Task-adaptive few-shot node classification. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 1910–1919.
  42. Maurice Weiler and Gabriele Cesa. 2019. General e (2)-equivariant steerable cnns. Advances in Neural Information Processing Systems 32 (2019).
  43. A comprehensive survey on graph neural networks. IEEE transactions on neural networks and learning systems 32, 1 (2020), 4–24.
  44. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018).
  45. Position-aware graph neural networks. In International conference on machine learning. PMLR, 7134–7143.
  46. Hybrid graph neural networks for few-shot learning. In Proceedings of the AAAI conference on artificial intelligence, Vol. 36. 3179–3187.
  47. Latent feature learning in social media network. In Proceedings of the 21st ACM international conference on Multimedia. 253–262.
  48. Graph embedding on biomedical networks: methods, applications and evaluations. Bioinformatics 36, 4 (2020), 1241–1251.
  49. Da Zhang and Mansur Kabuka. 2019. Multimodal deep representation learning for protein interaction identification and protein family classification. BMC bioinformatics 20, 16 (2019), 1–14.
  50. Meta-gnn: On few-shot node classification in graph meta-learning. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. 2357–2360.
  51. Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020).
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Sungwon Kim (32 papers)
  2. Junseok Lee (30 papers)
  3. Namkyeong Lee (21 papers)
  4. Wonjoong Kim (6 papers)
  5. Seungyoon Choi (4 papers)
  6. Chanyoung Park (83 papers)
Citations (5)
View on Semantic Scholar