Follow
Michal Rolínek
Michal Rolínek
Quant Finance, Second Foundation
Verified email at second-foundation.eu - Homepage
Title
Cited by
Cited by
Year
Differentiation of blackbox combinatorial solvers
MV Pogančić, A Paulus, V Musil, G Martius, M Rolinek
International Conference on Learning Representations, 2019
261*2019
Variational autoencoders pursue pca directions (by accident)
M Rolinek, D Zietlow, G Martius
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 2019
1582019
The complexity of general-valued CSPs
V Kolmogorov, A Krokhin, M Rolínek
SIAM Journal on Computing 46 (3), 1087-1110, 2017
1012017
Deep graph matching via blackbox differentiation of combinatorial solvers
M Rolínek, P Swoboda, D Zietlow, A Paulus, V Musil, G Martius
Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23 …, 2020
932020
Optimizing rank-based metrics with blackbox differentiation
M Rolínek, V Musil, A Paulus, M Vlastelica, C Michaelis, G Martius
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 2020
902020
Sample-efficient cross-entropy method for real-time planning
C Pinneri, S Sawant, S Blaes, J Achterhold, J Stueckler, M Rolinek, ...
Conference on Robot Learning, 1049-1065, 2021
772021
L4: Practical loss-based stepsize adaptation for deep learning
M Rolinek, G Martius
Advances in Neural Information Processing Systems, 6433-6443, 2018
632018
Comboptnet: Fit the right np-hard problem by learning integer programming constraints
A Paulus, M Rolínek, V Musil, B Amos, G Martius
International Conference on Machine Learning, 8443-8453, 2021
562021
Efficient Optimization for Rank-based Loss Functions
P Mohapatra, M Rolinek, CV Jawahar, V Kolmogorov, MP Kumar
CVPR 2018, 2016
472016
Total variation on a tree
V Kolmogorov, T Pock, M Rolinek
SIAM Journal on Imaging Sciences 9 (2), 605-636, 2016
402016
Making higher order mot scalable: An efficient approximate solver for lifted disjoint paths
A Hornakova, T Kaiser, P Swoboda, M Rolinek, B Rosenhahn, ...
Proceedings of the IEEE/CVF International Conference on Computer Vision …, 2021
332021
Demystifying inductive biases for (beta-) VAE based architectures
D Zietlow, M Rolinek, G Martius
International Conference on Machine Learning, 12945-12954, 2021
252021
On the memory-hardness of data-independent password-hashing functions
J Alwen, P Gaži, C Kamath, K Klein, G Osang, K Pietrzak, L Reyzin, ...
Cryptology ePrint Archive, 2016
172016
Effectiveness of structural restrictions for hybrid CSPs
V Kolmogorov, M Rolínek, R Takhanov
International Symposium on Algorithms and Computation, 566-577, 2015
152015
Discrete planning with end-to-end trained neuro-algorithmic policies
M Vlastelica, M Rolinek, G Martius
ICML, 2020
14*2020
Even delta-matroids and the complexity of planar Boolean CSPs
A Kazda, V Kolmogorov, M Rolínek
ACM Transactions on Algorithms (TALG) 15 (2), 1-33, 2018
132018
The Miquel points, pseudocircumcenter, and Euler-Poncelet point of a complete quadrilateral
M Rolínek, LA Dung
Forum Geometricorum 14, 145–153, 2014
82014
107 Geometry Problems from AwesomeMath Year Round Program
T Andreescu, M Rolinek, J Tkadlec
XYZ Press, 2013
72013
Planning from pixels in environments with combinatorially hard search spaces
M Bagatella, M Olšák, M Rolínek, G Martius
Advances in Neural Information Processing Systems 34, 24707-24718, 2021
32021
Superconcentrators of Density 25.3
V Kolmogorov, M Rolinek
arXiv preprint arXiv:1405.7828, 2014
3*2014
The system can't perform the operation now. Try again later.
Articles 1–20