Papers for

public policy analysts

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Chatbots give stable judgments on presidents actions and reforms

Robustness of Chatbot LLM Judgments of Presidential Actions and Hypothetical Reforms

Abstract: Chatbots are increasingly consulted about public affairs, and their judgments of policies are useful only if they are robust. We measure this robustness in the setting of an ordinary user, through consumer chat interfaces. For 30 days, five chatbot configurations (Mistral, Gemini Flash, Claude Sonnet, and Claude Opus at two effort settings) were asked twice a day to score the long-term effect on the United States of 40 actions of the last four presidential administrations and of 15 hypothetical reforms, each with a confidence and a short comment. The judgments are robust: all configurations agree on the sign and the ranking of the administrations' mean scores, and two different configurations asked on the same day give opposite signs to the same action in about 4% of cases. Responses from different days differ more than same-day responses, but the difference grows slowly over the month, except where the service itself changed. We identify three such changes, which shifted the judgments while leaving little or no trace in the interface. Treating the comments as a retrieval task, we find them specific to each item and consistent across runs and chatbots, with lexical and embedding similarities agreeing. We release the dataset of 16,500 judgments.

Thu 29 OctComputation and LanguageComputers and Society
The gist
Chatbots are often asked about political decisions and policies, but their answers need to be consistent to be trustworthy. The authors tested five popular chatbot setups over a month, asking them about past presidential actions and possible reforms, and found they mostly agreed on whether these were good or bad and how they ranked overall. They also discovered that answers were more consistent when given on the same day than across days, except when the chatbot service was updated. The authors are sharing a large set of these chatbot judgments for others to use.
Open → 2610.39398v1

Estimation method gauges value of personalized policies in adaptive trials

Inference on the Value of Policy Improvement in Adaptive Experiments

Abstract: In this paper, we develop an asymptotically normal estimator for the value of policy improvement (VPI) under adaptively collected data. This value, which is defined as the gap between the value of the best treatment policy in a class and that of a baseline policy, gauges whether or not it is worth deploying a personalized treatment policy. Building an estimator for the VPI is naturally more difficult than estimating the value of a fixed policy. This is because, in addition to contending with the correlated data and decaying propensities associated with adaptive experiments, any estimator must also handle the non-regularity, or lack of pathwise differentiability, of the underlying estimand when the optimal policy is non-unique. Our proposed estimator works by sequentially fitting a weighted empirical welfare maximizing policy on historical data and then evaluating it using inverse propensity weighting on future samples. We neither assume that the optimal policy is unique nor make a margin assumption on the underlying heterogeneous treatment effects. A key difficulty in analyzing our estimator is showing that the regret incurred through policy learning is asymptotically smaller than the standard error of the estimator. We accomplish this by showing faster regret rates for policy learning under decaying propensities, which may be of independent interest. We not only evaluate the coverage of our estimator on a mix of synthetic and semi-synthetic data, but also employ it to estimate the VPI in an adaptive experiment evaluating the efficacy of job assistance programs in Jordan due to Caria et al. Although our estimates are generally more conservative than their hierarchical Bayesian analysis, which assumes that the optimal policy is unique, we still corroborate the benefits of personalization amongst Syrian refugees.

Sun 11 OctMachine Learning
The gist
This paper tackles the challenge of measuring how much better personalized treatments are compared to a standard approach in experiments where treatments adapt over time. The authors propose a new statistical method that accurately estimates this improvement without assuming the best treatment policy is unique or simple. They tested their method on various data sets and a real-world job assistance study in Jordan, confirming that personalized policies provide benefits. Their approach is more cautious but reliable than some existing methods.
Open → 2610.15789v1

Policy learning balances expected welfare and sampling risk with stability

Stable Policy Learning

Abstract: In evidence-based policymaking, typically one experimental sample is observed, then a learned policy recommendation is implemented at scale. Policies learned from the experimental data can perform well in expected welfare, yet random sampling in the experiment can produce recommendations with poor welfare outcomes. In this paper, we ask: how should policy learning algorithms balance expected welfare against sampling risk? Our main contribution is to show that algorithmic stability plays a central role in characterizing and navigating the tradeoff. Intuitively, if a policy learning algorithm's recommendation remains stable when one experimental unit is replaced, then that algorithm has limited sampling risk. We propose a method for policy learning called policy-vote bagging, which learns treatment decisions on many subsamples then averages their votes into treatment probabilities. Relative to using one subsample, averaging across subsamples preserves expected welfare and improves expected utility for a risk-averse researcher. We derive sharp bounds linking estimation accuracy, subsample size, and welfare variation, including an exact guarantee under CARA utility.

Wed 16 SeptMachine Learning
The gist
Making good policy decisions based on data from experiments can be tricky because the results might change if someone else takes part in the experiment. This randomness means that even good policies might sometimes perform poorly. The paper shows that if the policy recommendations don’t change much when one person in the data is swapped out, then those recommendations are more reliable. To do this, the authors propose a way to generate policies by combining decisions from many smaller groups within the experiment, which makes the recommendations more stable and better for cautious decision makers.
Open → 2609.19418v1