Abstract
Learning personalized decision policies that generalize to the target population is of great relevance. Since training data is often not representative of the target population, standard policy learning methods may yield policies that do not generalize target population. To address this challenge, we propose a novel framework for learning policies that generalize to the target population. For this, we characterize the difference between the training data and the target population as a sample selection bias using a selection variable. Over an uncertainty set around this selection variable, we optimize the minimax value of a policy to achieve the best worst-case policy value on the target population. In order to solve the minimax problem, we derive an efficient algorithm based on a convex-concave procedure and prove convergence for parametrized spaces of policies such as logistic policies. We prove that, if the uncertainty set is well-specified, our policies generalize to the target population as they can not do worse than on the training data. Using simulated data and a clinical trial, we demonstrate that, compared to standard policy learning methods, our framework improves the generalizability of policies substantially.
Dokumententyp: | Konferenzbeitrag (Paper) |
---|---|
Keywords: | Machine Learning (stat.ML); Machine Learning (cs.LG); FOS: Computer and information sciences; FOS: Computer and information sciences; Artificial Intelligence; AI, Künstliche Intelligenz; KI |
Fakultät: | Betriebswirtschaft > Institute of Artificial Intelligence (AI) in Management |
Themengebiete: | 000 Informatik, Informationswissenschaft, allgemeine Werke > 000 Informatik, Wissen, Systeme |
Sprache: | Englisch |
Dokumenten ID: | 94977 |
Datum der Veröffentlichung auf Open Access LMU: | 09. Mrz. 2023, 08:20 |
Letzte Änderungen: | 09. Mrz. 2023, 08:20 |