Pith. sign in

REVIEW 1 cited by

Distributionally Robust Policy Learning with Wasserstein Distance

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.04637 v2 pith:JYX4JR75 submitted 2022-05-10 econ.EM

classification econ.EM
keywords populationtargetdatadistributionallyestimationrobustambiguityapplication
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The effects of treatments are often heterogeneous, depending on the observable characteristics, and it is necessary to exploit such heterogeneity to devise individualized treatment rules (ITRs). Existing estimation methods of such ITRs assume that the available experimental or observational data are derived from the target population in which the estimated policy is implemented. However, this assumption often fails in practice because of limited useful data. In this case, policymakers must rely on the data generated in the source population, which differs from the target population. Unfortunately, existing estimation methods do not necessarily work as expected in the new setting, and strategies that can achieve a reasonable goal in such a situation are required. This study examines the application of distributionally robust optimization (DRO), which formalizes an ambiguity about the target population and adapts to the worst-case scenario in the set. It is shown that DRO with Wasserstein distance-based characterization of ambiguity provides simple intuitions and a simple estimation method. I then develop an estimator for the distributionally robust ITR and evaluate its theoretical performance. An empirical application shows that the proposed approach outperforms the naive approach in the target population.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Who With Whom? Learning Optimal Matching Policies

    econ.EM 2025-07 conditional novelty 6.0 of 10

    An entropy-regularized optimal transport method learns welfare-optimal two-sided matching policies with estimated costs, supported by a non-asymptotic regret bound and calibrated simulations suggesting about one perce...

Pith tools