Pith. sign in

REVIEW 2 cited by

DANE: Domain Adaptive Network Embedding

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 1906.00684 v2 pith:BPRUXZ7A submitted 2019-06-03 cs.LG cs.SIstat.ML

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

Recent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data. However, as previous methods usually focus on learning embeddings for a single network, they can not learn representations transferable on multiple networks. Hence, it is important to design a network embedding algorithm that supports downstream model transferring on different networks, known as domain adaptation. In this paper, we propose a novel Domain Adaptive Network Embedding framework, which applies graph convolutional network to learn transferable embeddings. In DANE, nodes from multiple networks are encoded to vectors via a shared set of learnable parameters so that the vectors share an aligned embedding space. The distribution of embeddings on different networks are further aligned by adversarial learning regularization. In addition, DANE's advantage in learning transferable network embedding can be guaranteed theoretically. Extensive experiments reflect that the proposed framework outperforms other state-of-the-art network embedding baselines in cross-network domain adaptation tasks.

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. DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation

    cs.LG 2026-04 unverdicted novelty 5.0 of 10

    DIB-OD proposes decoupling GNN representations into orthogonal invariant and redundant subspaces via information bottleneck and HSIC, but its theoretical lemmas are invalid and its reported results are internally inco...

  2. Homophily Enhanced Graph Domain Adaptation

    cs.SI 2025-05 reject novelty 4.0 of 10

    Graph domain adaptation fails more when source and target graphs have different local homophily profiles, and the proposed HGDA filters and aligns homophily, heterophily, and attribute signals to improve cross-graph n...

Pith tools