AINeutralarXiv – CS AI · Jun 256/10
🧠Researchers present new confidence sequence methods for statistical model checking of Markov decision processes in online settings, achieving 50x sample efficiency improvements over previous approaches. The work addresses the practical problem of obtaining meaningful guarantees when exact transition probabilities are unknown, with applications to cyber-physical and biological systems.
AINeutralarXiv – CS AI · Jun 256/10
🧠Researchers propose a novel approach to reinforcement learning that approximates optimal policies through geometric tessellations rather than high-dimensional value functions. The method demonstrates superior performance in structured decision problems like inventory control and queue admission, with faster error decay and greater stability compared to traditional RL baselines.
AINeutralarXiv – CS AI · Jun 236/10
🧠Researchers formalize the problem of synthesizing control policies for stochastic systems that maintain entropy-based objectives in Markov Decision Processes, proving the problem is computationally hard while developing a verification and synthesis method that combines convex duality and invariant synthesis techniques.
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers propose Bellman-Taylor score decoding, a novel deep reinforcement learning framework designed to handle Markov decision processes with state-dependent action constraints common in operations research. The method decouples policy learning into a Euclidean score space while maintaining feasibility through an action decoder, enabling standard DRL algorithms to optimize complex systems like queueing networks without architectural modifications.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers demonstrate that optimal control in Markov decision processes with catastrophic failure states naturally produces prospect-theory-like behaviors—including S-shaped value functions and loss aversion—without requiring utility curvature or probability weighting. The mechanism emerges purely from the mathematical structure of Bellman optimality when agents face absorbing failure states, with results validated across 495 configurations and multiple learning paradigms.
AINeutralarXiv – CS AI · Jun 15/10
🧠Researchers have developed an Answer-Set Programming (ASP) based implementation of the CARCASS framework to improve Reinforcement Learning abstractions for complex state spaces. The approach leverages ASP's declarative modeling capabilities as an alternative to Prolog, demonstrating promising results in Blocks World and Minigrid domains when domain knowledge is available.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers have developed Diffusion-Augmented Markov Decision Processes (DA-MDPs), a framework that integrates diffusion models into maximum entropy reinforcement learning to sample from optimal policy trajectory distributions. The approach is tested on three RL algorithms (PPO, WPO, REPPO) and demonstrates competitive or superior performance on continuous-control tasks while excelling at modeling multimodal action distributions.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers have developed attribution techniques that explain decision-making in Markov Decision Processes (MDPs), extending explainability methods beyond static inputs to sequential decision-making systems. The approach assigns importance scores to states and execution paths, enabling more interpretable AI agents in dynamic environments.
AINeutralarXiv – CS AI · Mar 44/105
🧠Researchers propose a novel non-parametric method for robust counterfactual inference in Markov Decision Processes that computes tight bounds across all compatible causal models. The approach provides closed-form expressions instead of requiring exponentially complex optimization problems, making it highly efficient and scalable for real-world applications.
AINeutralarXiv – CS AI · Mar 24/106
🧠Researchers introduce resilient strategies for stochastic systems, focusing on decision-making that remains robust against disturbances that could flip agent decisions. The work presents fundamental problems for Markov decision processes with reachability and safety objectives, extending to stochastic games with various disturbance aggregation methods.
