Pith. sign in

REVIEW 2 cited by

Learning treatment effects while treating those in need

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 2407.07596 v2 pith:UDYMZL6F submitted 2024-07-10 cs.LG stat.MEstat.ML

classification cs.LGstat.MEstat.ML
keywords targetinglearningservicesneedoftenpublictreatmentalgorithmic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many social programs attempt to allocate scarce resources to people with the greatest need. Indeed, public services increasingly use algorithmic risk assessments motivated by this goal. However, targeting the highest-need recipients often conflicts with attempting to evaluate the causal effect of the program as a whole, as the best evaluations would be obtained by randomizing the allocation. We propose a framework to design randomized allocation rules which optimally balance targeting high-need individuals with learning treatment effects, presenting policymakers with a Pareto frontier between the two goals. We give sample complexity guarantees for the policy learning problem and provide a computationally efficient strategy to implement it. We then collaborate with the human services department of Allegheny County, Pennsylvania to evaluate our methods on data from real service delivery settings. Optimized policies can substantially mitigate the tradeoff between learning and targeting. For example, it is often possible to obtain 90% of the optimal utility in targeting high-need individuals while ensuring that the average treatment effect can be estimated with less than 2 times the samples that a randomized controlled trial would require. Mechanisms for targeting public services often focus on measuring need as accurately as possible. However, our results suggest that algorithmic systems in public services can be most impactful if they incorporate program evaluation as an explicit goal alongside targeting.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. The Value of Prediction in Identifying the Worst-Off

    cs.CY 2025-01 conditional novelty 6.0 of 10

    Expanding screening capacity often improves identification of the worst-off more than improving prediction accuracy, except when predictions are very bad or nearly perfect.

  2. Dependent Randomized Rounding for Budget Constrained Experimental Design

    stat.ML 2025-06 reject novelty 5.0 of 10

    Swap rounding for budget-constrained designs is shown to be flawed as written: the pseudocode breaks marginal preservation and the variance decomposition omits indirect covariances.

Pith tools