Which Rules Matter Now? Policy-Centroid Routing Before an Intelligent System Acts

• URL: http://arxiv.org/abs/2608.30757v1
• Date: Mon, 31 Aug 2026 13:24:47 GMT
• Title: Which Rules Matter Now? Policy-Centroid Routing Before an Intelligent System Acts
• Abstract summary: Policy-centroid routing creates a layer before adjudication.<n>Several regimes may trigger at once.<n>The paper develops six falsifiable propositions and seven follow-on studies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Before an intelligent system can decide whether an action is allowed, it must first know which rules the action has approached. A single proposed action can implicate several policy regimes at once. Their requirements may stack, overlap, or qualify one another, yet many remain written in natural language while the action itself arrives as an incomplete description of intent. The first problem is not judgment. It is attention. Policy-centroid routing creates a layer before adjudication. It compresses expressions within each policy regime into one or more representative centroids, places the proposed action in the same semantic space, applies a declared measure, and routes every regime crossing a declared threshold to authoritative review. Several regimes may trigger at once. The output is a review agenda, not permission, prohibition, legality, breach, compliance, certification, or enforcement. The paper develops six falsifiable propositions and seven follow-on studies comparing the hypothesis with structured workflows, lexical and semantic retrieval, hierarchical and direct classification, and selective prediction under matched review burden. The studies are designed to identify where policy geometry recovers applicable regimes, where compression loses rare or overlapping obligations, and where the mechanism should abstain. The paper includes a synthetic worked example and reports no empirical efficacy result.

Related papers

• Why2Speak: Faithful Reasoning for Abstaining Action Policies [0.19336815376402716]
  We compare direct decision policies, reasoning policies, supervised fine-tuning, and reinforcement learning.<n>We find a capability-auditability tradeoff: the strongest direct policy achieves higher quality but exposes no reasoning to inspect.<n>Supervised fine-tuning either suppresses reasoning or preserves it without improving decision quality, while reinforcement learning also fails to improve the reasoning policy.
  arXiv  Detail & Related papers  (2026-08-21T02:00:21Z)
• Governing Mental-State Inference: Source-Neutral Regulatory Triggers and Tiered Obligations [0.0]
  UNESCO Recommendation on the Ethics of Neurotechnology is non-binding guidance.<n>This article develops a source-neutral trigger for technologically mediated, person-linked mental-state attribution.
  arXiv  Detail & Related papers  (2026-08-02T02:28:40Z)
• AutoCedar: An Agentic Framework for Verifier-Guided Access Control Policy Synthesis [0.2449909275410288]
  AutoCedar is a verifier-guided system that turns natural-language access-control requirements into a reviewed, checkable target.<n>It then synthesizes Cedar policies against that target.
  arXiv  Detail & Related papers  (2026-07-04T01:13:32Z)
• How to Catch a GPU: A Taxonomy of Verification and Enforcement Mechanisms for International AI Agreements [0.0]
  We propose a taxonomy based on the principle that wherever sufficient capacity exists to violate an agreement, it must be under a control regime.<n>This decomposes the problem of ensuring compliance with the agreement into preventing uncontrolled resource acquisition, detecting all capacity outside the control regime, and preventing escape from the control regime.<n>Applying this taxonomy to existing proposals reveals that more focus is placed on preventing escape from the control regime, while preventing resource acquisition and detecting all capacity outside the control regime receive less attention.
  arXiv  Detail & Related papers  (2026-06-16T10:51:52Z)
• PolicyBank: Evolving Policy Understanding for LLM Agents [51.86716874651299]
  PolicyBank maintains structured, tool-level policy insights and iteratively refines them.<n>PolicyBank closes up to 82% of the gap toward a human oracle.
  arXiv  Detail & Related papers  (2026-04-16T20:29:30Z)
• Dense Policy: Bidirectional Autoregressive Learning of Actions [51.60428100831717]
  This paper introduces a bidirectionally expanded learning approach, termed Dense Policy, to establish a new paradigm for autoregressive policies in action prediction.<n>It employs a lightweight encoder-only architecture to iteratively unfold the action sequence from an initial single frame into the target sequence in a coarse-to-fine manner.<n>Experiments validate that our dense policy has superior autoregressive learning capabilities and can surpass existing holistic generative policies.
  arXiv  Detail & Related papers  (2025-03-17T14:28:08Z)
• Policy Dispersion in Non-Markovian Environment [53.05904889617441]
  This paper tries to learn the diverse policies from the history of state-action pairs under a non-Markovian environment. We first adopt a transformer-based method to learn policy embeddings. Then, we stack the policy embeddings to construct a dispersion matrix to induce a set of diverse policies.
  arXiv  Detail & Related papers  (2023-02-28T11:58:39Z)
• Indivisible Participatory Budgeting under Weak Rankings [0.6853165736531939]
  Participatory budgeting (PB) has attracted much attention in recent times due to its wide applicability in social choice settings. We propose classes of rules for indivisible PB with weak rankings (i.e., weak ordinal preferences) and investigate their key algorithmic and axiomatic issues. The paper helps to highlight the trade-offs among practical appeal, computational complexity, and axiomatic compliance of these rules.
  arXiv  Detail & Related papers  (2022-07-16T16:46:12Z)
• Sayer: Using Implicit Feedback to Optimize System Policies [63.992191765269396]
  We develop a methodology that leverages implicit feedback to evaluate and train new system policies. Sayer builds on two ideas from reinforcement learning to leverage data collected by an existing policy. We show that Sayer can evaluate arbitrary policies accurately, and train new policies that outperform the production policies.
  arXiv  Detail & Related papers  (2021-10-28T04:16:56Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• State Augmented Constrained Reinforcement Learning: Overcoming the Limitations of Learning with Rewards [88.30521204048551]
  A common formulation of constrained reinforcement learning involves multiple rewards that must individually accumulate to given thresholds. We show a simple example in which the desired optimal policy cannot be induced by any weighted linear combination of rewards. This work addresses this shortcoming by augmenting the state with Lagrange multipliers and reinterpreting primal-dual methods.
  arXiv  Detail & Related papers  (2021-02-23T21:07:35Z)

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.