Identifying Best Interventions through Online Importance Sampling

By Rajat Sen, Karthikeyan Shanmugam, A. Dimakis, Sanjay Shakkottai. 2017

82 citations recorded by the source corpus.

Motivated by applications in computational advertising and systems biology, we consider the problem of identifying the best out of several possible soft interventions at a source node V in an acyclic causal directed graph, to maximize the expected value of a target node Y (located downstream of V). Our setting imposes a fixed total budget for sampling under various interventions, along with cost constraints on different types of interventions. We pose this as a best arm identification bandit problem with K arms where each arm is a soft intervention at V, and leverage the information leakage among the arms to provide the first gap dependent error and simple regret bounds for this problem. Our results are a significant improvement over the traditional best arm identification results. We empirically show that our algorithms outperform the state of the art in the Flow Cytometry data-set, and also apply our algorithm for model interpretation of the Inception-v3 deep net that classifies images.

Subfields: Artificial Intelligence, Management Science and Operations Research

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Chelsea Finn
  3. Matthew Botvinick
  4. Yoshua Bengio
  5. Peter W. Battaglia
  6. Pieter Abbeel
  7. Dinesh Jayaraman
  8. Yuxi Li

In Management Science and Operations Research

  1. Dinesh Jayaraman
  2. Pim de Haan
  3. Pedro A. Ortega
  4. Zeb Kurth-Nelson
  5. David Raposo
  6. Sergey Levine
  7. Peter W. Battaglia
  8. Edward Hughes

Citations in the corpus