Search Results for author: Pashootan Vaezipoor

Found 4 papers, 1 papers with code

Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework

no code implementations16 Oct 2021 Elias B. Khalil, Pashootan Vaezipoor, Bistra Dilkina

In Mixed Integer Linear Programming (MIP), a (strong) backdoor is a "small" subset of an instance's integer variables with the following property: in a branch-and-bound procedure, the instance can be solved to global optimality by branching only on the variables in the backdoor.

LTL2Action: Generalizing LTL Instructions for Multi-Task RL

1 code implementation13 Feb 2021 Pashootan Vaezipoor, Andrew Li, Rodrigo Toro Icarte, Sheila Mcilraith

We address the problem of teaching a deep reinforcement learning (RL) agent to follow instructions in multi-task environments.


Learning Branching Heuristics for Propositional Model Counting

no code implementations7 Jul 2020 Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu, Chris J. Maddison, Roger Grosse, Edward Lee, Sanjit A. Seshia, Fahiem Bacchus

Propositional model counting or #SAT is the problem of computing the number of satisfying assignments of a Boolean formula and many discrete probabilistic inference problems can be translated into a model counting problem to be solved by #SAT solvers.

Cannot find the paper you are looking for? You can Submit a new open access paper.