Pith. sign in

REVIEW 1 cited by

Information Gain Propagation: a new way to Graph Active Learning with Soft Labels

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

arxiv 2203.01093 v1 pith:G2DQKV3M submitted 2022-03-02 cs.LG

classification cs.LG
keywords activelabelinglabelsmethodsnodesoracledomainexact
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph Neural Networks (GNNs) have achieved great success in various tasks, but their performance highly relies on a large number of labeled nodes, which typically requires considerable human effort. GNN-based Active Learning (AL) methods are proposed to improve the labeling efficiency by selecting the most valuable nodes to label. Existing methods assume an oracle can correctly categorize all the selected nodes and thus just focus on the node selection. However, such an exact labeling task is costly, especially when the categorization is out of the domain of individual expert (oracle). The paper goes further, presenting a soft-label approach to AL on GNNs. Our key innovations are: i) relaxed queries where a domain expert (oracle) only judges the correctness of the predicted labels (a binary question) rather than identifying the exact class (a multi-class question), and ii) new criteria of maximizing information gain propagation for active learner with relaxed queries and soft labels. Empirical studies on public datasets demonstrate that our method significantly outperforms the state-of-the-art GNN-based AL methods in terms of both accuracy and labeling cost.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. RANA: Robust Active Learning for Noisy Network Alignment

    cs.LG 2025-07 reject novelty 5.0 of 10

    An active learning method for network alignment that selects node pairs with a noise-aware confidence score and denoises labels via model self-labeling and twin node pair queries.

Pith tools