Informing AI Policy Assessment using Large-Scale Simulation of Interventions

• URL: http://arxiv.org/abs/2605.27395v1
• Date: Mon, 20 Apr 2026 18:47:35 GMT
• Title: Informing AI Policy Assessment using Large-Scale Simulation of Interventions
• Abstract summary: We introduce a methodology for identifying viable policy options to mitigate specified AI harms.<n>We leverage a genetic algorithm-based simulation study to explore a vast solution space of potential policy combinations.
• Score: 3.8949315211880005
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As the rapid proliferation of AI systems and harms spurs efforts in AI governance around the world, prioritizing among competing policy options has become increasingly challenging for policymakers and researchers. We introduce a methodology for identifying viable policy options to mitigate specified AI harms, helping policymakers and researchers target areas that warrant greater time and resource investment. This method combines participatory evaluation of policies, expert assessment of implementation costs, and an LLM-based assessment of perceived harm mitigation under each policy option. We leverage a genetic algorithm-based simulation study to explore a vast solution space of potential policy combinations, and examine how outcomes change under different weightings of cost, participatory input, and harm mitigation. We find that this method enables exploration of different balances between participatory and expert components, allowing policymakers and researchers to assess how much weight to assign to each. We argue that the diversity of viable policy combinations found by the genetic algorithm could be a useful starting point for deliberation. This method operationalizes existing work on participatory AI by integrating it directly into practical policy development pipelines.

Related papers

• Rethinking Policy Diversity in Ensemble Policy Gradient in Large-Scale Reinforcement Learning [38.79118914746284]
  We theoretically analyze the impact of inter-policy diversity on learning efficiency in policy ensembles.<n>We propose Coupled Policy Optimization which regulates diversity through KL constraints between policies.<n>Our results indicate that diverse exploration under appropriate regulation is key to achieving stable and sample-efficient learning.
  arXiv  Detail & Related papers  (2026-03-02T11:06:40Z)
• Advancing Science- and Evidence-based AI Policy [163.43609502905707]
  This paper tackles the problem of how to optimize the relationship between evidence and policy to address the opportunities and challenges of AI.<n>An increasing number of efforts address this problem by often either (i) contributing research into the risks of AI and their effective mitigation or (ii) advocating for policy to address these risks.
  arXiv  Detail & Related papers  (2025-08-02T23:20:58Z)
• Reinforcement Learning with Continuous Actions Under Unmeasured Confounding [14.510042451844766]
  This paper addresses the challenge of offline policy learning in reinforcement learning with continuous action spaces.<n>We develop a minimax estimator and introduce a policy-gradient-based algorithm to identify the in-class optimal policy.<n>We provide theoretical results regarding the consistency, finite-sample error bound, and regret bound of the resulting optimal policy.
  arXiv  Detail & Related papers  (2025-05-01T04:55:29Z)
• Envisioning Stakeholder-Action Pairs to Mitigate Negative Impacts of AI: A Participatory Approach to Inform Policy Making [2.981139602986498]
  The potential for negative impacts of AI has rapidly become more pervasive around the world.<n>This has intensified a need for responsible AI governance.<n> Ensuring that AI policies align with democratic expectations requires methods that prioritize the voices and needs of those impacted.
  arXiv  Detail & Related papers  (2025-01-24T22:57:18Z)
• Off-Policy Evaluation and Counterfactual Methods in Dynamic Auction Environments [0.6445605125467574]
  Off-Policy Evaluation allows researchers to assess new policies without costly experiments, speeding up the evaluation process.<n>Online experimental methods, such as A/B tests, are effective but often slow, thus delaying the policy selection and optimization process.<n>By utilizing counterfactual estimators as a preliminary step before conducting A/B tests, we aim to streamline the evaluation process.
  arXiv  Detail & Related papers  (2025-01-09T14:39:40Z)
• Reinforcement Learning with Heterogeneous Data: Estimation and Inference [84.72174994749305]
  We introduce the K-Heterogeneous Markov Decision Process (K-Hetero MDP) to address sequential decision problems with population heterogeneity. We propose the Auto-Clustered Policy Evaluation (ACPE) for estimating the value of a given policy, and the Auto-Clustered Policy Iteration (ACPI) for estimating the optimal policy in a given policy class. We present simulations to support our theoretical findings, and we conduct an empirical study on the standard MIMIC-III dataset.
  arXiv  Detail & Related papers  (2022-01-31T20:58:47Z)
• TOPS: Transition-based VOlatility-controlled Policy Search and its Global Convergence [9.607937067646617]
  This paper proposes Transition-based VOlatility-controlled Policy Search (TOPS) It is a novel algorithm that solves risk-averse problems by learning from (possibly non-consecutive) transitions instead of only consecutive trajectories. Both theoretical analysis and experimental results demonstrate a state-of-the-art level of risk-averse policy search methods.
  arXiv  Detail & Related papers  (2022-01-24T18:29:23Z)
• Building a Foundation for Data-Driven, Interpretable, and Robust Policy Design using the AI Economist [67.08543240320756]
  We show that the AI Economist framework enables effective, flexible, and interpretable policy design using two-level reinforcement learning and data-driven simulations. We find that log-linear policies trained using RL significantly improve social welfare, based on both public health and economic outcomes, compared to past outcomes.
  arXiv  Detail & Related papers  (2021-08-06T01:30:41Z)
• Policy Information Capacity: Information-Theoretic Measure for Task Complexity in Deep Reinforcement Learning [83.66080019570461]
  We propose two environment-agnostic, algorithm-agnostic quantitative metrics for task difficulty. We show that these metrics have higher correlations with normalized task solvability scores than a variety of alternatives. These metrics can also be used for fast and compute-efficient optimizations of key design parameters.
  arXiv  Detail & Related papers  (2021-03-23T17:49:50Z)
• Learning Adaptive Exploration Strategies in Dynamic Environments Through Informed Policy Regularization [100.72335252255989]
  We study the problem of learning exploration-exploitation strategies that effectively adapt to dynamic environments. We propose a novel algorithm that regularizes the training of an RNN-based policy using informed policies trained to maximize the reward in each task.
  arXiv  Detail & Related papers  (2020-05-06T16:14:48Z)
• Variational Policy Propagation for Multi-agent Reinforcement Learning [68.26579560607597]
  We propose a emphcollaborative multi-agent reinforcement learning algorithm named variational policy propagation (VPP) to learn a emphjoint policy through the interactions over agents. We prove that the joint policy is a Markov Random Field under some mild conditions, which in turn reduces the policy space effectively. We integrate the variational inference as special differentiable layers in policy such as the actions can be efficiently sampled from the Markov Random Field and the overall policy is differentiable.
  arXiv  Detail & Related papers  (2020-04-19T15:42:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.