Transductive Generalization via Optimal Transport and Its Application to Graph Node Classification

ArXi:2603.09257v1 Announce Type: new Many existing transductive bounds rely on classical complexity measures that are computationally intractable and often misaligned with empirical behavior. In this work, we establish new representation-based generalization bounds in a distribution-free transductive setting, where learned representations are dependent, and test features are accessible during