Michal Rolínek

According to our database1, Michal Rolínek authored at least 21 papers between 2013 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Demystifying Inductive Biases for β-VAE Based Architectures.
CoRR, 2021

Planning from Pixels in Environments with Combinatorially Hard Search Spaces.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Demystifying Inductive Biases for (Beta-)VAE Based Architectures.
Proceedings of the 38th International Conference on Machine Learning, 2021

CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints.
Proceedings of the 38th International Conference on Machine Learning, 2021

Neuro-algorithmic Policies Enable Fast Combinatorial Generalization.
Proceedings of the 38th International Conference on Machine Learning, 2021

Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths.
Proceedings of the 2021 IEEE/CVF International Conference on Computer Vision, 2021

2020
Differentiation of Blackbox Combinatorial Solvers.
Proceedings of the 8th International Conference on Learning Representations, 2020

Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers.
Proceedings of the Computer Vision - ECCV 2020, 2020

Optimizing Rank-Based Metrics With Blackbox Differentiation.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

Sample-efficient Cross-Entropy Method for Real-time Planning.
Proceedings of the 4th Conference on Robot Learning, 2020

2019
Even Delta-Matroids and the Complexity of Planar Boolean CSPs.
ACM Trans. Algorithms, 2019

Variational Autoencoders Pursue PCA Directions (by Accident).
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018
Superconcentrators of Density 25.3.
Ars Comb., 2018

L4: Practical loss-based stepsize adaptation for deep learning.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Efficient Optimization for Rank-Based Loss Functions.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition, 2018

2017
The Complexity of General-Valued CSPs.
SIAM J. Comput., 2017

2016
Total Variation on a Tree.
SIAM J. Imaging Sci., 2016

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
IACR Cryptol. ePrint Arch., 2016

2015
Effectiveness of Structural Restrictions for Hybrid CSPs.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2013
107 Geometry Problems - From The AwesomeMath Year-Round Program.
XYZ Press, ISBN: 978-0-9799269-7-6, 2013

106 Geometry Problems - From The AwesomeMath Summer Program.
XYZ Press, ISBN: 978-0-9799269-4-5, 2013


  Loading...