research
∙
10/12/2021
Planning from Pixels in Environments with Combinatorially Hard Search Spaces
The ability to form complex plans based on raw visual input is a litmus ...
share
research
∙
08/24/2021
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths
We present an efficient approximate message passing solver for the lifte...
research
∙
05/05/2021
CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints
Bridging logical and algorithmic reasoning with modern machine learning ...
research
∙
02/15/2021
Neuro-algorithmic Policies enable Fast Combinatorial Generalization
Although model-based and model-free approaches to learning the control o...
research
∙
02/12/2021
Demystifying Inductive Biases for β-VAE Based Architectures
The performance of β-Variational-Autoencoders (β-VAEs) and their variant...
research
∙
08/14/2020
Sample-efficient Cross-Entropy Method for Real-time Planning
Trajectory optimizers for model-based reinforcement learning, such as th...
research
∙
03/25/2020
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
Building on recent progress at the intersection of combinatorial optimiz...
research
∙
12/07/2019
Optimizing Rank-based Metrics with Blackbox Differentiation
Rank-based metrics are some of the most widely used criteria for perform...
research
∙
12/04/2019
Differentiation of Blackbox Combinatorial Solvers
Achieving fusion of deep learning with combinatorial algorithms promises...
research
∙
12/17/2018
Variational Autoencoders Pursue PCA Directions (by Accident)
The Variational Autoencoder (VAE) is a powerful architecture capable of ...
research
∙
02/26/2015
