mlsanityData to 14 Oct 2026

agent-risk: Risk Assessment for Changes to AI Agents

arXiv 2610.16280 ↗First posted 12 Oct 2026cs.AI cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Before changing a deployed AI agent (a stricter safety gate, a new model), organizations must approve the change, starting from existing logs. Extending classical risk analysis to partial records and partial changes to running systems, agent-risk replays logged episodes, assuming nothing else changes and the agent does not anticipate the change. The log settles episodes acting as before, a declared stop value settles stopped ones, and the rest need logged support, a saved-state rerun, or a bound. We prove what logs must record for exact replay and which saved states serve a gate family. For independent episodes, we bound the reruns a decision needs and tolerable drift from live behavior. In a bash sandbox, a 7,200-episode log alone decided neither of two retry gates, which let the agent act after refusals the log never shows. Rerunning only each gate's blocked episodes from saved states reached both live decisions at half the agent calls of a live test sized post hoc for them, given the log. Without per-step harm, a stopping gate's certified harm ceiling rose up to 2.5-fold, since the log hides whether harm preceded the stop. Approval thus needs evidence designed in advance: log fields, saved states, targeted reruns.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 36 of its 116 references that are in the map. First posted on arXiv 12 Oct 2026.

Builds on

36 of 116 references.

References · 36

  1. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  2. 2023A Survey on Large Language Model based Autonomous Agentscited by 2,242
  3. 2024τ-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domainscited by 1,402
  4. 2025τ2-Bench: Evaluating Conversational Agents in a Dual-Control Environmentcited by 627
  5. 2023Identifying the Risks of LM Agents with an LM-Emulated Sandboxcited by 548
  6. 2014On the Complexity of Best Arm Identification in Multi-Armed Bandit Modelscited by 286
  7. 2016Optimal Best Arm Identification with Fixed Confidencecited by 239
  8. 2023AI Control: Improving Safety Despite Intentional Subversioncited by 229
  9. 2022Hybrid RL: Using Both Offline and Online Data Can Make RL Efficientcited by 161
  10. 2025Measuring AI Ability to Complete Long Software Taskscited by 156
  11. 2025Large Language Models Often Know When They Are Being Evaluatedcited by 128
  12. 2019Counterfactual Off-Policy Evaluation with Gumbel-Max Structural Causal Modelscited by 117
24 more
  1. 2020Preventing Repeated Real World AI Failures by Cataloging Incidents: The AI Incident Databasecited by 96
  2. 2020Approximate information state for approximate planning and reinforcement learning in partially observed systemscited by 70
  3. 2020Off-policy Policy Evaluation For Sequential Decisions Under Unobserved Confoundingcited by 61
  4. 2020Off-policy Bandits with Deficient Supportcited by 61
  5. 2021An Automated Approach to Causal Inference in Discrete Settingscited by 42
  6. 2017Data-Efficient Policy Evaluation Through Behavior Policy Searchcited by 26
  7. 2013Probabilistic Evaluation of Sequential Plans from Causal Models with Hidden Variablescited by 24
  8. 2024The AI risk repository: A meta-review, database, and taxonomy of risks from artificial intelligencecited by 16
  9. 2024Gumbel Counterfactual Generation From Language Modelscited by 14
  10. 2018Sample complexity of partition identification using multi-armed banditscited by 13
  11. 2026Crab: A Semantics-Aware Checkpoint/Restore Runtime for Agent Sandboxescited by 13
  12. 2024Optimal Multi-Fidelity Best-Arm Identificationcited by 9
  13. 2025Evaluation of Large Language Models via Coupled Token Generationcited by 8
  14. 2017Sample Efficient Policy Search for Optimal Stopping Domainscited by 4
  15. 2024Off-policy Evaluation with Deeply-abstracted Statescited by 4
  16. 2025Adapting Probabilistic Risk Assessment for AIcited by 4
  17. 2026What Can Be Enforced? A Theory of Certified Runtime Safety for Tool-Using Agentscited by 4
  18. 2026Foundations of a Time-Consistent Counterfactual Actuarial Runtime for Autonomous AI Agentscited by 3
  19. 2026When Agent Automation Becomes Profitable: Quantifying and Insuring Autonomous AI Risk through Trace-Economic Underwritingcited by 3
  20. 2026Agent Behavioral Contracts II: Certifying Compositional Reliability Without Assuming Independencecited by 3
  21. 2024Huber-robust likelihood ratio tests for composite nulls and alternativescited by 2
  22. 2024Sequential stratified inference for the meancited by 2
  23. 2022Sweeter than SUITE: Supermartingale Stratified Union-Intersection Tests of Electionscited by 1
  24. 2026Autoregressive Diffusion World Models for Off-Policy Evaluation of LLM Agentscited by 1

Built on by

Not cited yet.