75 citations · 276 across the 23 of their papers we have counts for
5 papers · 1 filter
Backpropagation through Combinatorial Algorithms: Identity with Projection Works
Subham Sekhar Sahoo, Anselm Paulus, Marin Vlastelica +3
Embedding discrete solvers as differentiable layers has given modern deep learning architectures combinatorial expressivity and discrete reasoning capabilities. The derivative of t…
CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints
Anselm Paulus, Michal Rolínek, Vít Musil +2
Bridging logical and algorithmic reasoning with modern machine learning techniques is a fundamental challenge with potentially transformative impact. On the algorithmic side, many…
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
Michal Rolínek, Paul Swoboda, Dominik Zietlow +3
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 contai…
Optimizing Rank-based Metrics with Blackbox Differentiation
Michal Rolínek, Vít Musil, Anselm Paulus +3
Rank-based metrics are some of the most widely used criteria for performance evaluation of computer vision models. Despite years of effort, direct optimization for these metrics re…
Differentiation of Blackbox Combinatorial Solvers
Marin Vlastelica, Anselm Paulus, Vít Musil +2
Achieving fusion of deep learning with combinatorial algorithms promises transformative changes to artificial intelligence. One possible approach is to introduce combinatorial buil…