Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
ECCV 2020
Authors: Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, Vít Musil, Georg Martius
Using #blackboxbackprop, we wrap strong graph matching solvers into neural network building blocks. With additional help of a few architectural tricks, we obtain SOTA on deep graph matching benchmarks (e.g. PASCAL VOC).
#blackboxbackprop is on fire 🔥🔥🔥
— Michal Rolínek (@MichalRolinek) March 27, 2020
After ICLR 2020 (spotlight) and CVPR 2020 (oral), we are excited to present:
Deep Graph Matching via Blackbox Differentiation of
Combinatorial Solvers.https://t.co/jgQo20llnw pic.twitter.com/KAFNrHexeT