Learning the Graph and the Embedding Together: Classifier-Independent Rewiring for Heterophilic Node Classification
An affinity-guided rewiring method that estimates the graph and the node representation together and alternates, in the spirit of expectation maximisation, between training a lightweight graph neural network on the current graph and re-weighting candidate edges under a modularity objective with a pseudo-label homophily...