pith. sign in

Title resolution pending

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

fields

cs.LG 2

years

2025 1 2024 1

verdicts

UNVERDICTED 2

representative citing papers

Subgraph-level Universal Prompt Tuning

cs.LG · 2024-02-16 · unverdicted · novelty 6.0

SUPT assigns prompt features at the subgraph level to enable universal prompt tuning for any GNN pre-training strategy and outperforms fine-tuning in 42 of 45 full-shot and 41 of 45 few-shot graph experiments with average gains of 2.5% and 6.6%.

OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks

cs.LG · 2025-01-01 · unverdicted · novelty 5.0

OpenGLT benchmark finds no single GNN architecture dominates graph-level tasks, with subgraph-based models strongest in expressiveness, graph learning and SSL models in robustness, node and pooling models in efficiency, and graph topology partially guiding architecture choice.

citing papers explorer

Showing 2 of 2 citing papers.

  • Subgraph-level Universal Prompt Tuning cs.LG · 2024-02-16 · unverdicted · none · ref 9

    SUPT assigns prompt features at the subgraph level to enable universal prompt tuning for any GNN pre-training strategy and outperforms fine-tuning in 42 of 45 full-shot and 41 of 45 few-shot graph experiments with average gains of 2.5% and 6.6%.

  • OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks cs.LG · 2025-01-01 · unverdicted · none · ref 29

    OpenGLT benchmark finds no single GNN architecture dominates graph-level tasks, with subgraph-based models strongest in expressiveness, graph learning and SSL models in robustness, node and pooling models in efficiency, and graph topology partially guiding architecture choice.