Saved in:
| Main Authors: | , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.23146 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910247493304320 |
|---|---|
| author | Aryal, Manish Azam, Faiyaz Banerjee, Agnivo Jayanthi, Sai Sidhanth Manoharan Laro, Allegra Legentilhomme, Clément Lin, Andrew Lorkowski, Florian Rakhshandehroo, Radman Rommel, Patric Ruzak, Emanuel Theng, Nathan Rapoport, Paul Yushin |
| author_facet | Aryal, Manish Azam, Faiyaz Banerjee, Agnivo Jayanthi, Sai Sidhanth Manoharan Laro, Allegra Legentilhomme, Clément Lin, Andrew Lorkowski, Florian Rakhshandehroo, Radman Rommel, Patric Ruzak, Emanuel Theng, Nathan Rapoport, Paul Yushin |
| contents | Classical reinforcement learning assumes the agent interacts with a fixed environment whose behavior does not depend on the agent's policy. This assumption breaks down in non-realizable settings where other actors might anticipate the agent's behavior, including environments crucial to AI safety, where the agent interacts with predictors, humans, other AI agents, and institutions. In such settings, the agent's model class fails to capture the world in which it operates. Under such misspecification, classical Bayesian methods can produce confidently wrong posteriors, unreliable decisions, and unbounded regret, as realizability fails to obtain. Infra-Bayesianism is a decision-theoretic framework that addresses these failures by distinguishing ordinary probabilistic uncertainty, where priors can be reasonably chosen, from Knightian uncertainty, where no grounds exist for the construction of such a prior. It does so by evaluating actions on their worst-case outcomes, rather than from posterior expectations or weighted averaging. We present the first proof-of-concept implementation of an infra-Bayesian reinforcement learning architecture for finite-outcome stateless decision problems. Our agent maintains a set of imprecise hypotheses, updates them using infra-Bayesian conditioning, and selects actions by maximizing worst-case expected value. We apply this implementation of the infra-Bayesian maximin decision process to an environment with Knightian uncertainty, and demonstrate a lower worst-case regret as compared to classical reinforcement learning agents. We also investigate Newcomb's problem and show that the infra-Bayesian agent picks the optimal strategy, outperforming classical decision theory agents. Our results provide a step towards reinforcement learning agents that remain robust under model misspecification and policy-dependent uncertainty. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_23146 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Infra-Bayesian Reinforcement Learning Agents Outperform Classical RL For Worst-Case Robustness Aryal, Manish Azam, Faiyaz Banerjee, Agnivo Jayanthi, Sai Sidhanth Manoharan Laro, Allegra Legentilhomme, Clément Lin, Andrew Lorkowski, Florian Rakhshandehroo, Radman Rommel, Patric Ruzak, Emanuel Theng, Nathan Rapoport, Paul Yushin Machine Learning Artificial Intelligence Classical reinforcement learning assumes the agent interacts with a fixed environment whose behavior does not depend on the agent's policy. This assumption breaks down in non-realizable settings where other actors might anticipate the agent's behavior, including environments crucial to AI safety, where the agent interacts with predictors, humans, other AI agents, and institutions. In such settings, the agent's model class fails to capture the world in which it operates. Under such misspecification, classical Bayesian methods can produce confidently wrong posteriors, unreliable decisions, and unbounded regret, as realizability fails to obtain. Infra-Bayesianism is a decision-theoretic framework that addresses these failures by distinguishing ordinary probabilistic uncertainty, where priors can be reasonably chosen, from Knightian uncertainty, where no grounds exist for the construction of such a prior. It does so by evaluating actions on their worst-case outcomes, rather than from posterior expectations or weighted averaging. We present the first proof-of-concept implementation of an infra-Bayesian reinforcement learning architecture for finite-outcome stateless decision problems. Our agent maintains a set of imprecise hypotheses, updates them using infra-Bayesian conditioning, and selects actions by maximizing worst-case expected value. We apply this implementation of the infra-Bayesian maximin decision process to an environment with Knightian uncertainty, and demonstrate a lower worst-case regret as compared to classical reinforcement learning agents. We also investigate Newcomb's problem and show that the infra-Bayesian agent picks the optimal strategy, outperforming classical decision theory agents. Our results provide a step towards reinforcement learning agents that remain robust under model misspecification and policy-dependent uncertainty. |
| title | Infra-Bayesian Reinforcement Learning Agents Outperform Classical RL For Worst-Case Robustness |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2605.23146 |