16 citations · 25 across the 7 of their papers we have counts for
7 papers
The Minimal Search Space for Conditional Causal Bandits
Francisco N. F. Q. Simoes, Itai Feigenbaum, Mehdi Dastani +1
Causal knowledge can be used to support decision-making problems. This has been recognized in the causal bandits literature, where a causal (multi-armed) bandit is characterized by…
Causal Layering via Conditional Entropy
Itai Feigenbaum, Devansh Arpit, Huan Wang +5
Causal discovery aims to recover information about an unobserved causal graph from the observable data it generates. Layerings are orderings of the variables which place causes bef…
Editing Arbitrary Propositions in LLMs without Subject Labels
Itai Feigenbaum, Devansh Arpit, Huan Wang +5
Large Language Model (LLM) editing modifies factual information in LLMs. Locate-and-Edit (L\&E) methods accomplish this by finding where relevant information is stored within the n…
On the Unlikelihood of D-Separation
Itai Feigenbaum, Huan Wang, Shelby Heinecke +4
Causal discovery aims to recover a causal graph from data generated by it; constraint based methods do so by searching for a d-separating conditioning set of nodes in the graph via…
Selfish Knapsack
Itai Feigenbaum, Matthew P. Johnson
We consider a selfish variant of the knapsack problem. In our version, the items are owned by agents, and each agent can misrepresent the set of items she owns---either by avoiding…
Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location
Itai Feigenbaum, Jay Sethuraman
We consider a strategic variant of the facility location problem. We would like to locate a facility on a closed interval. There are n agents located on that interval, divided into…
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Norm of Costs
Itai Feigenbaum, Jay Sethuraman, Chun Ye
We consider the problem of locating a single facility on the real line. This facility serves a set of agents, each of whom is located on the line, and incurs a cost equal to his di…