Graph Matching Relaxations and Amortization for Supervised Graph Prediction
This work proposes to amortize the graph matching (node alignment) problem and showcases the efficiency of this approach on toy and real world SGP problems of increasing complexity including a novel Mass-spectra to Scaffold task that is introduced.
F. Méndez, Paul Krzakala, Gabriel Melo et al.
· 0 citations