Pith. sign in

REVIEW 1 cited by

Complete the Missing Half: Augmenting Aggregation Filtering with Diversification for Graph Convolutional Networks

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 2008.08844 v4 pith:TBQJN6IO submitted 2020-08-20 cs.LG stat.ML

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

The core operation of current Graph Neural Networks (GNNs) is the aggregation enabled by the graph Laplacian or message passing, which filters the neighborhood node information. Though effective for various tasks, in this paper, we show that they are potentially a problematic factor underlying all GNN methods for learning on certain datasets, as they force the node representations similar, making the nodes gradually lose their identity and become indistinguishable. Hence, we augment the aggregation operations with their dual, i.e. diversification operators that make the node more distinct and preserve the identity. Such augmentation replaces the aggregation with a two-channel filtering process that, in theory, is beneficial for enriching the node representations. In practice, the proposed two-channel filters can be easily patched on existing GNN methods with diverse training strategies, including spectral and spatial (message passing) methods. In the experiments, we observe desired characteristics of the models and significant performance boost upon the baselines on 9 node classification tasks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Novel Approaches to Artificial Intelligence Development Based on the Nearest Neighbor Method

    cs.AI 2025-08 conditional novelty 2.0 of 10

    A hierarchical k-NN search tree based on self-organizing maps retrieves MNIST neighbors about 800 times faster than exhaustive search, with error rising from 3.69% to 5.64%, and the same structure is shown on a toy tr...

Pith tools