Graph Transfer Learning via Shared Latent Geometry: Theory and Applications
Not on the map. Why?
Abstract (arXiv)
Inference and control in engineered physical systems pay a heavy physics cost at deployment: state estimators, inverse-problem solvers, model-predictive controllers, schedulers, and observers are often not closed-form and must re-solve a numerical optimization per instance, with the operator re-supplied each time. Physics-informed learning moves this cost to training, but uses a single encoder pathway whose latent geometry de-learns under fine-tuning and admits no quantitative transfer guarantee. We propose an asymmetric two-pathway architecture that resolves both issues. A teacher encoder consumes privileged dense states from a high-fidelity simulator and represents the system through operator-polynomial features stable under spectral perturbation; a student encoder learns the same latent geometry from sparse field data and operator descriptors. At deployment the teacher is discarded, and the frozen student runs in a single forward pass with a transfer certificate. The design connects to privileged-information learning, knowledge distillation, and cross-modal distillation, but targets cross-instance transfer rather than fixed-instance prediction: topology and operator may change, while the latent task does not. We establish sufficient and near-necessary transfer conditions via Wasserstein proximity between latent laws, yielding a zero-shot error bound, and develop a finite-sample certification protocol with active expansion when coverage is incomplete. The framework applies wherever a system admits an operator with reportable spectrum. On power-system estimation, it achieves zero-shot transfer to 100 unseen topologies, a 95% certificate pass rate, accuracy competitive with topology-aware Newton--Raphson, and sub-millisecond inference. These results suggest asymmetric pathways plus operator-anchored latent geometry provide a foundation for certified zero-shot inference and control.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 31 of its 46 references that are in the map. First posted on arXiv 30 May 2026.
Builds on
31 of 46 references.
References · 31
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,806
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 1,965
- 2014FitNets: Hints for Thin Deep Netscited by 1,619
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 500
- 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 409
- 2015Unifying distillation and privileged informationcited by 218
19 more
- 2022Sign and Basis Invariant Networks for Spectral Graph Representation Learningcited by 176
- 2015Cross Modal Distillation for Supervision Transfercited by 173
- 2022Handling Distribution Shifts on Graphs: An Invariance Perspectivecited by 163
- 2020Distilling Knowledge from Graph Convolutional Networkscited by 128
- 2019PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signaturescited by 125
- 2019Topological Autoencoderscited by 124
- 2020Graphon Neural Networks and the Transferability of Graph Neural Networkscited by 117
- 2020A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networkscited by 84
- 2019Stability and Generalization of Graph Convolutional Neural Networkscited by 81
- 2019Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolutioncited by 67
- 2019Optimal Power Flow Using Graph Neural Networkscited by 60
- 2022Generalization Analysis of Message Passing Neural Networks on Large Random Graphscited by 58
- 2021Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networkscited by 51
- 2020Adversarial Deep Network Embedding for Cross-network Node Classificationcited by 44
- 2019Connectivity-Optimized Representation Learning via Persistent Homologycited by 43
- 2021Transferability Properties of Graph Neural Networkscited by 42
- 2020Graphon Signal Processingcited by 37
- 2018Real-time Power System State Estimation and Forecasting via Deep Neural Networkscited by 32
- 2019Stability of Graph Neural Networks to Relative Perturbationscited by 11
Built on by
Not cited yet.