TL;DR
This paper introduces a new method for learning treatment assignment policies from observational data, optimizing for constraints like fairness or simplicity, with strong theoretical guarantees on policy performance.
Contribution
It proposes a semiparametrically efficient estimation-based approach for policy learning that handles binary and continuous treatments using observational data with causal effect identification.
Findings
Algorithm achieves asymptotic regret guarantees.
Method applies to various causal effect identification strategies.
Supports policies with application-specific constraints.
Abstract
In many areas, practitioners seek to use observational data to learn a treatment assignment policy that satisfies application-specific constraints, such as budget, fairness, simplicity, or other functional form constraints. For example, policies may be restricted to take the form of decision trees based on a limited set of easily observable individual characteristics. We propose a new approach to this problem motivated by the theory of semiparametrically efficient estimation. Our method can be used to optimize either binary treatments or infinitesimal nudges to continuous treatments, and can leverage observational data where causal effects are identified using a variety of strategies, including selection on observables and instrumental variables. Given a doubly robust estimator of the causal effect of assigning everyone to treatment, we develop an algorithm for choosing whom to treat,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
