arXiv (All)
open access
PISA: Prioritized Invariant Subgraph Aggregation for Out-of-Distribution Generalization on Graphs
Invariant learning on graphs aims to build predictors that rely on causal substructures rather than on environment-specific shortcuts. Current methods extract either a single invariant subgraph (CIGA) or, more recently, a set of diverse invariant subgraphs (SuGAr). We observe that the second half of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fast and Simple Densest Subgraph with Predictions#144294
- Self-Supervised Pretraining of Molecular Graph Encoders with LeJEPA#927561
- Towards Modality-imbalanced Federated Graph Learning: A Data Synthesis-based Approach#290587
- Rethinking One-Shot Federated Graph Learning: Training-Free Statistical Estimation#973757
- PEARL: Path-Entity Aligned Relational Learning with Contextual Subgraphs for Inductive Knowledge Graph Completion#822608
Record · ID 1141459
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive