ORCAID: Oblique Rule-Based Continuous-Action Interpretation for Deep RL Policies
arXiv:2607. 07235v1 Announce Type: cross Abstract: Explainability remains a key issue in reinforcement learning (RL).
arXiv:2608. 07151v1 Announce Type: cross Abstract: Reinforcement learning policies are difficult to inspect, but interpreting them is a prerequisite for trustworthiness.
arXiv:2607. 07235v1 Announce Type: cross Abstract: Explainability remains a key issue in reinforcement learning (RL).
arXiv:2606. 04634v1 Announce Type: new Abstract: Trust in a decision-making system requires both safety guarantees and the ability to interpret and understand its behavior.
arXiv:2606. 08596v1 Announce Type: new Abstract: Constructing efficient and reliable policies to assist humans is indispensable for human-AI collaboration.
arXiv:2606. 08346v1 Announce Type: cross Abstract: Reinforcement learning with verifiable rewards (RLVR) has become a dominant paradigm for improving the reasoning capabilities of large language models (LLMs).
arXiv:2606. 06976v1 Announce Type: new Abstract: Large language model (LLM)-based agents often make suboptimal tool-use decisions, including unsupported tool invocation and hallucinated direct responses, which may accumulate errors throughout multi-step interactions.
arXiv:2607. 25925v1 Announce Type: new Abstract: Over the past decade, decision trees have been used to represent controllers (a.
arXiv:2607. 14171v1 Announce Type: new Abstract: Reinforcement learning has emerged as the dominant paradigm for training large language model (LLM) agents that interact with executable sandboxes.
arXiv:2606. 17377v1 Announce Type: new Abstract: We study performance-driven environment abstraction for decision-making in large Markov decision processes.
arXiv:2608. 09967v1 Announce Type: new Abstract: Deep reinforcement learning (DRL) agents achieve strong performance in complex environments, yet their decision-making processes remain difficult to interpret.
arXiv:2509. 02522v3 Announce Type: replace-cross Abstract: Recent advances in Reinforcement Learning with Verifiable Rewards (RLVR) have empowered large language models (LLMs) to tackle challenging reasoning tasks such as mathematics and programming, however existing RLVR methods often suffer from sparse reward signals and unstable policy gradient updates inherent to RL-based approaches.
Over the past decade, decision trees have been used to represent controllers (a. k.
arXiv:2607. 23263v1 Announce Type: new Abstract: Deciding whether a trajectory actually fulfills its instruction governs how we measure computer-use agents on long-horizon graphical-user-interface tasks and how we train them with reinforcement learning.