19 citations · 66 across the 10 of their papers we have counts for
10 papers
Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
Arnaud Deza, Chang Liu, Pashootan Vaezipoor +1
It is known that the multiplication of an matrix with an matrix can be performed using fewer multiplications than what the naive approach suggests.…
LLMs and the Abstraction and Reasoning Corpus: Successes, Failures, and the Importance of Object-based Representations
Yudong Xu, Wenhao Li, Pashootan Vaezipoor +2
Can a Large Language Model (LLM) solve simple abstract reasoning problems? We explore this broad question through a systematic analysis of GPT on the Abstraction and Reasoning Corp…
Noisy Symbolic Abstractions for Deep RL: A case study with Reward Machines
Andrew C. Li, Zizhao Chen, Pashootan Vaezipoor +3
Natural and formal languages provide an effective mechanism for humans to specify instructions and reward functions. We investigate how to generate policies via RL when reward func…
Learning to Follow Instructions in Text-Based Games
Mathieu Tuli, Andrew C. Li, Pashootan Vaezipoor +3
Text-based games present a unique class of sequential decision making problem in which agents interact with a partially observable, simulated environment via actions and observatio…
Challenges to Solving Combinatorially Hard Long-Horizon Deep RL Tasks
Andrew C. Li, Pashootan Vaezipoor, Rodrigo Toro Icarte +1
Deep reinforcement learning has shown promise in discrete domains requiring complex reasoning, including games such as Chess, Go, and Hanabi. However, this type of reasoning is les…
Augment with Care: Contrastive Learning for Combinatorial Problems
Haonan Duan, Pashootan Vaezipoor, Max B. Paulus +2
Supervised learning can improve the design of state-of-the-art solvers for combinatorial problems, but labelling large numbers of combinatorial instances is often impractical due t…
Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework
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,…
LTL2Action: Generalizing LTL Instructions for Multi-Task RL
Pashootan Vaezipoor, Andrew Li, Rodrigo Toro Icarte +1
We address the problem of teaching a deep reinforcement learning (RL) agent to follow instructions in multi-task environments. Instructions are expressed in a well-known formal lan…
Learning Branching Heuristics for Propositional Model Counting
Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu +4
Propositional model counting, or #SAT, is the problem of computing the number of satisfying assignments of a Boolean formula. Many problems from different application areas, includ…
Lifted Unit Propagation for Effective Grounding
Pashootan Vaezipoor, David Mitchell, Maarten Mariën
A grounding of a formula over a given finite domain is a ground formula which is equivalent to on that domain. Very effective propositional solvers have made grounding-base…