Metraipolis › archive › dc_192cbefd2a0a
NodeJEPA: Structure-Conditioned Latent Prediction for Node-Level Graph Self-Supervised Learning — arXiv:2608.04381
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04381
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:14:13.018Z
- SHA-256 of the archived text
15e59f1b224c1476a3ba7e3c1eb3d095616f3bed3323a800f90855d19243cbbc- Stable URL of this page
https://metraipolis.com/documento/dc_192cbefd2a0a
How to cite
NodeJEPA: Structure-Conditioned Latent Prediction for Node-Level Graph Self-Supervised Learning — arXiv:2608.04381 — arXiv (en), https://arxiv.org/abs/2608.04381 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_192cbefd2a0a (Metraipolis archive dc_192cbefd2a0a, sha256 15e59f1b224c1476a3ba7e3c1eb3d095616f3bed3323a800f90855d19243cbbc)
BibTeX
@misc{dc192cbefd2a0a,
title = {NodeJEPA: Structure-Conditioned Latent Prediction for Node-Level Graph Self-Supervised Learning — arXiv:2608.04381},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04381},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_192cbefd2a0a; sha256 15e59f1b224c1476a3ba7e3c1eb3d095616f3bed3323a800f90855d19243cbbc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04381. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Self-supervised learning on graphs is largely shaped by contrastive methods that depend on carefully designed augmentations, and by generative methods that reconstruct node attributes in the input space. Both paradigms can entangle representations with low-level input statistics rather than with relational structure. Joint-embedding predictive architectures (JEPA) instead learn by predicting latent targets rather than reconstructing inputs. Recent work has explored this idea for graph-level representation learning, but how to design JEPA-style objectives for node-level tasks, and which structural signals the predictor should condition on, remains less clear. We present NodeJEPA, a joint-embedding predictive architecture for node-level graph self-supervised learning. NodeJEPA masks structure-aware k-hop ego-subgraphs and trains a context encoder to predict the latent representations of the masked nodes. These targets come from an EMA-updated target encoder with stop-gradient. A structure-conditioned predictor integrates spectral and centrality descriptors through cross-attention. Variance, covariance, and Laplacian spectral regularizers help stabilize the embedding geometry, and an optional curriculum gradually increases masking difficulty during training. Because prediction occurs in latent space, NodeJEPA does not rely on input reconstruction or hand-crafted graph augmentations. We evaluate NodeJEPA on standard node classification benchmarks under linear probing and fine-tuning protocols, and conduct ablations on masking, prediction, and regularization design choices. Our study offers a practical recipe for node-level JEPA-style latent prediction on graphs, and clarifies when structural conditioning helps representation learning. Code, configurations, and evaluation scripts are publicly available at this https URL . Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-06 in cs.AI). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2608.04381 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T11:02:13.503Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).