← Search

Michal Rolínek

2 accepted papers

2020

Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers

ECCV 2020poster

Building on recent progress at the intersection of combinatorial optimization and deep learning, we propose an end-to-end trainable architecture for deep graph matching that contains unmodified combinatorial solvers. Using the presence of heavily optimized combinatorial solvers together with some im…

2018

Efficient Optimization for Rank-Based Loss Functions

CVPR 2018poster

The accuracy of information retrieval systems is often measured using complex loss functions such as the average precision (AP) or the normalized discounted cumulative gain (NDCG). Given a set of positive and negative samples, the parameters of a retrieval system can be estimated by minimizing these…

Cited by 62SourcePDFScholar