Skip to content

Probabilistic Verification of Recurrent Neural Networks for Single and Multi-Agent Reinforcement Learning

· 0 citations · 39 references

TL;DR

Experiments on partially observable single-agent and cooperative multi-agent tasks show that RNN-ProVe yields more quantitative, feasibility-aware probabilistic guarantees than existing tools, while scaling to recurrent and multi-agent settings.

View source

Similar papers

Forecasting in Offline Reinforcement Learning for Non-stationary Environments

F orecasting in Non-stationary O ffline RL (F ORL), a framework that combines zero-shot forecasting with the agent’s experience, aims to bridge the gap between offline RL and the complexities of real-world, non-stationary environments.

Suzan Ece, Georg Martius, Emre Ugur et al. · 0 citations
#artificial intelligence Preprint Sep 2026

MA-JEPA: Joint-Embedding World Models for Multi-Agent Reinforcement Learning

World models improve sample efficiency by training policies on imagined trajectories, but their usefulness depends on learning representations that capture the information needed for future control. We study whether self-supervised joint-embedding prediction (JEPA) can provide this learning signal for multi-agent reinf...

Brandon Kaplowitz, Osaze James Obahor, C. S. D. Witt · 0 citations
#machine learning Preprint Sep 2026

ICMAPE: In-Context Multiagent Pure Exploration

ICMAPE converts the fixed-confidence identification objective into a reward derived from inference confidence, so that standard reinforcement learning machinery can be applied to decentralized pure exploration.

Xin-Yi Hu, Alessio Russo, Aldo Pacchiano · 0 citations
Preprint Aug 2026

AgentOPSD: Recursive Self-Distillation for Agentic Reinforcement Learning

This work proposes AgentOPSD, a critic-free, recursive method for turn-level credit assignment in agentic reinforcement learning that aggregates token-level teacher-student log-probability gaps into turn-level evidence and recursively updates a Bayesian belief state in log-odds space.

Zi-Han Wang, Zhengxi Lu, Zhiyuan Yao et al. · 7 citations · ⚡1
Preprint Sep 2026

Fully Decentralized and Safety-Aware Multi-Agent Reinforcement Learning for Control on Networks

This paper develops a safe and fully decentralized multi-agent reinforcement learning (MARL) algorithm to solve a class of discrete-time control problems on networks, including the persistent monitoring problem. Fully decentralized control of agents, while offering numerous benefits, faces issues such as exponentially...

T. Rogalski, Shirantha Welikala · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.