Showing 1–17 of 17 results
/ Date/ Name
May 30, 2014Superconcentrators of Density 25.3Dec 17, 2018Variational Autoencoders Pursue PCA Directions (by Accident)Feb 25, 2015The Complexity of General-Valued CSPsApr 27, 2015Effectiveness of Structural Restrictions for Hybrid CSPsFeb 14, 2018L4: Practical loss-based stepsize adaptation for deep learningMar 25, 2020Deep Graph Matching via Blackbox Differentiation of Combinatorial SolversApr 27, 2016Efficient Optimization for Rank-based Loss FunctionsFeb 26, 2015Total variation on a treeFeb 9, 2016Even Delta-Matroids and the Complexity of Planar Boolean CSPsAug 14, 2020Sample-efficient Cross-Entropy Method for Real-time PlanningAug 24, 2021Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint PathsFeb 12, 2021Demystifying Inductive Biases for $β$-VAE Based ArchitecturesFeb 15, 2021Neuro-algorithmic Policies enable Fast Combinatorial GeneralizationOct 12, 2021Planning from Pixels in Environments with Combinatorially Hard Search SpacesMay 5, 2021CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming ConstraintsDec 7, 2019Optimizing Rank-based Metrics with Blackbox DifferentiationDec 4, 2019Differentiation of Blackbox Combinatorial Solvers