Pith. sign in

REVIEW 2 cited by

VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections

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 2403.16030 v1 pith:TK2EGCQL submitted 2024-03-24 cs.LG

classification cs.LG
keywords graphlistnodeattentioninformationmini-batchtokentraining
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Graph transformer has been proven as an effective graph learning method for its adoption of attention mechanism that is capable of capturing expressive representations from complex topological and feature information of graphs. Graph transformer conventionally performs dense attention (or global attention) for every pair of nodes to learn node representation vectors, resulting in quadratic computational costs that are unaffordable for large-scale graph data. Therefore, mini-batch training for graph transformers is a promising direction, but limited samples in each mini-batch can not support effective dense attention to encode informative representations. Facing this bottleneck, (1) we start by assigning each node a token list that is sampled by personalized PageRank (PPR) and then apply standard multi-head self-attention only on this list to compute its node representations. This PPR tokenization method decouples model training from complex graph topological information and makes heavy feature engineering offline and independent, such that mini-batch training of graph transformers is possible by loading each node's token list in batches. We further prove this PPR tokenization is viable as a graph convolution network with a fixed polynomial filter and jumping knowledge. However, only using personalized PageRank may limit information carried by a token list, which could not support different graph inductive biases for model training. To this end, (2) we rewire graphs by introducing multiple types of virtual connections through structure- and content-based super nodes that enable PPR tokenization to encode local and global contexts, long-range interaction, and heterophilous information into each node's token list, and then formalize our Virtual Connection Ranking based Graph Transformer (VCR-Graphormer).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment

    cs.LG 2024-12 conditional novelty 6.0 of 10

    ReHub keeps spoke-to-hub attention sparse by connecting each node to only k hubs per layer and reassigning those hubs via hub-hub similarity, reaching O(N) complexity with accuracy on par with its dense variant.

  2. Local Clustering on Complex Graphs and Complex Hypergraphs

    cs.SI 2024-12 conditional novelty 5.0 of 10

    GeneralACL and HyperACL find local clusters with conductance O(sqrt(optimal)) on weighted directed self-looped graphs and EDVW hypergraphs with probability at least 1/2 under two conditions.

Pith tools