REVIEW 2 cited by
CoCo: A Coupled Contrastive Framework for Unsupervised Domain Adaptive Graph Classification
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
Although graph neural networks (GNNs) have achieved impressive achievements in graph classification, they often need abundant task-specific labels, which could be extensively costly to acquire. A credible solution is to explore additional labeled graphs to enhance unsupervised learning on the target domain. However, how to apply GNNs to domain adaptation remains unsolved owing to the insufficient exploration of graph topology and the significant domain discrepancy. In this paper, we propose Coupled Contrastive Graph Representation Learning (CoCo), which extracts the topological information from coupled learning branches and reduces the domain discrepancy with coupled contrastive learning. CoCo contains a graph convolutional network branch and a hierarchical graph kernel network branch, which explore graph topology in implicit and explicit manners. Besides, we incorporate coupled branches into a holistic multi-view contrastive learning framework, which not only incorporates graph representations learned from complementary views for enhanced understanding, but also encourages the similarity between cross-domain example pairs with the same semantics for domain alignment. Extensive experiments on popular datasets show that our CoCo outperforms these competing baselines in different settings generally.
Forward citations
Cited by 2 Pith papers
-
Sparse Causal Discovery with Generative Intervention for Unsupervised Graph Domain Adaptation
SLOGAN untangles causal from spurious graph features via an information bottleneck and a generative intervention that swaps spurious features across domains, improving graph domain adaptation accuracy on four benchmar...
-
Aggregate to Adapt: Node-Centric Aggregation for Multi-Source-Free Graph Domain Adaptation
GraphATA performs multi-source-free graph domain adaptation by giving each target node its own graph convolutional matrix, formed from a sparse, context-dependent blend of source model weights.
Discussion (0). Continue with ORCID to comment.