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

Inductive Linear Probing for Few-shot Node Classification (2306.08192v1)

Published 14 Jun 2023 in cs.LG and cs.SI

Abstract: Meta-learning has emerged as a powerful training strategy for few-shot node classification, demonstrating its effectiveness in the transductive setting. However, the existing literature predominantly focuses on transductive few-shot node classification, neglecting the widely studied inductive setting in the broader few-shot learning community. This oversight limits our comprehensive understanding of the performance of meta-learning based methods on graph data. In this work, we conduct an empirical study to highlight the limitations of current frameworks in the inductive few-shot node classification setting. Additionally, we propose a simple yet competitive baseline approach specifically tailored for inductive few-shot node classification tasks. We hope our work can provide a new path forward to better understand how the meta-learning paradigm works in the graph domain.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Hirthik Mathavan (1 paper)
  2. Zhen Tan (68 papers)
  3. Nivedh Mudiam (2 papers)
  4. Huan Liu (283 papers)
Citations (1)

Summary

We haven't generated a summary for this paper yet.