REVIEW 3 cited by
A Survey of Few-Shot Learning on Graphs: from Meta-Learning to Pre-Training and Prompt Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Graph representation learning, a critical step in graph-centric tasks, has seen significant advancements. Earlier techniques often operate in an end-to-end setting, which heavily rely on the availability of ample labeled data. This constraint has spurred the emergence of few-shot learning on graphs, where only a few labels are available for each task. Given the extensive literature in this field, this survey endeavors to synthesize recent developments, provide comparative insights, and identify future directions. We systematically categorize existing studies based on two major taxonomies: (1) Problem taxonomy, which explores different types of data scarcity problems and their applications, and (2) Technique taxonomy, which details key strategies for addressing these data-scarce few-shot problems. The techniques can be broadly categorized into meta-learning, pre-training, and hybrid approaches, with a finer-grained classification in each category to aid readers in their method selection process. Within each category, we analyze the relationships among these methods and compare their strengths and limitations. Finally, we outline prospective directions for few-shot learning on graphs to catalyze continued innovation in this field. The website for this survey can be accessed by \url{https://github.com/smufang/fewshotgraph}.
Forward citations
Cited by 3 Pith papers
-
Graph Positional Autoencoders as Self-supervised Learners
A dual-path graph autoencoder that reconstructs node features and Laplacian-eigenvector distances reports strong self-supervised results on heterophilic and molecular benchmarks, with some overstatement in the margins...
-
GCoT: Chain-of-Thought Prompt Learning for Graphs
GCoT improves few-shot graph classification by iteratively generating node-specific prompts from intermediate encoder states, mimicking chain-of-thought reasoning for text-free graphs.
-
CoEvoT: Co-Evolving Chain-of-Thought Prompting for Graph-LLM Reasoning
Intermediate LLM thoughts are fed back to rewrite graph token embeddings each step, improving cross-dataset graph-LLM classification and link prediction.
Discussion (0). Continue with ORCID to comment.