A new arXiv paper addresses safety in meta-reinforcement learning, where agents must adapt quickly to unfamiliar tasks. The authors propose using reachability analysis in an information space to keep adaptation within safe bounds. The work aims to make meta-RL more viable for real-world deployments that carry safety constraints.
A new arXiv paper introduces Admissable, a training approach for reinforcement learning agents that must keep operating safely when an adversary deliberately removes or withholds input features. The work targets real-world deployments where sensor dropouts or tampered observations can degrade decision quality. It frames adversarial feature missingness as a distinct safety problem for RL rather than standard robustness to noise.
A new arXiv preprint examines how researchers measure performance in safe reinforcement learning, where an agent must maximize reward while keeping cumulative cost under a defined limit. The authors argue that existing benchmarks and metrics do not fully capture safety performance, and propose a framework for comparing methods more consistently. The work is an announcement-only cross-listing and has not been peer reviewed.
A new arXiv paper tackles a weakness of learning algorithms with formal regret guarantees, which typically require exploring every possible behavior—a serious risk when some mistakes cannot be undone. The proposed approach instead lets the agent request assistance from a mentor, enabling learning to proceed safely in environments with irreversible outcomes.