RE-SAC: Disentangling aleatoric and epistemic risks in bus fleet control: A stable and robust ensemble DRL approach
Not on the map. Why?
Abstract (arXiv)
Bus holding control is challenging due to stochastic traffic and passenger demand. While deep reinforcement learning (DRL) shows promise, standard actor-critic algorithms suffer from Q-value instability in volatile environments. A key source of this instability is the conflation of two distinct uncertainties: aleatoric uncertainty (irreducible noise) and epistemic uncertainty (data insufficiency). Treating these as a single risk leads to value underestimation in noisy states, causing catastrophic policy collapse. We propose a robust ensemble soft actor-critic (RE-SAC) framework to explicitly disentangle these uncertainties. RE-SAC applies Integral Probability Metric (IPM)-based weight regularization to the critic network to hedge against aleatoric risk, providing a smooth analytical lower bound for the robust Bellman operator without expensive inner-loop perturbations. To address epistemic risk, a diversified Q-ensemble penalizes overconfident value estimates in sparsely covered regions. This dual mechanism prevents the ensemble variance from misidentifying noise as a data gap, a failure mode identified in our ablation study. Experiments in a realistic bidirectional bus corridor simulation demonstrate that RE-SAC achieves the highest cumulative reward (approx. -0.4e6) compared to vanilla SAC (-0.55e6). Mahalanobis rareness analysis confirms that RE-SAC reduces Oracle Q-value estimation error by up to 62% in rare out-of-distribution states (MAE of 1647 vs. 4343), demonstrating superior robustness under high traffic variability.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 40 references that are in the map. First posted on arXiv 19 Mar 2026.
Builds on
24 of 40 references.
References · 24
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,335
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,777
- 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 903
- 2017A Distributional Perspective on Reinforcement Learningcited by 743
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2017Distributional Reinforcement Learning with Quantile Regressioncited by 464
- 2021Brax -- A Differentiable Physics Engine for Large Scale Rigid Body Simulationcited by 375
- 2021Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemblecited by 297
- 2019A Theory of Regularized Markov Decision Processescited by 279
- 2018Deep Reinforcement Learning and the Deadly Triadcited by 170
12 more
- 2021Maximum Entropy RL (Provably) Solves Some Robust RL Problemscited by 169
- 2015Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approachcited by 162
- 2014Algorithms for CVaR Optimization in MDPscited by 98
- 2018Lipschitz Continuity in Model-based Reinforcement Learningcited by 90
- 2019Dealing with Non-Stationarity in Multi-Agent Deep Reinforcement Learningcited by 90
- 2022RORL: Robust Offline Reinforcement Learning via Conservative Smoothingcited by 83
- 2019Estimating Risk and Uncertainty in Deep Reinforcement Learningcited by 68
- 2020Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regretcited by 57
- 2023Natural Actor-Critic for Robust Reinforcement Learning with Function Approximationcited by 35
- 2019A Bayesian Approach to Robust Reinforcement Learningcited by 32
- 2023Seizing Serendipity: Exploiting the Value of Past Success in Off-Policy Actor-Criticcited by 20
- 2025Single Agent Robust Deep Reinforcement Learning for Bus Fleet Controlcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.