Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper audits reinforcement-learning benchmarks for EV charging assignment and shows that silent defects in reward functions, stochastic environment models, and state encodings can bias agent comparisons without any visible failure. Its quantified cases, including a seed-desynchronisation bug and a reward term scaled to about 10⁻⁴ of its intended size, suggest that published RL architecture rankings in simulated settings may be less reliable than they appear. The proposed eight-item checklist is a practical first-pass audit for anyone building or relying on RL simulation benchmarks.
Sources coveringarXiv, Latent Space, Quantum Zeitgeist, Quantum Computing Report

Silent Reward and Environment Defects in EV Charging Simulation Benchmarks: A Diagnostic Checklist

arXiv2 min read

arXiv:2611.01769v1 Announce Type: cross Abstract: Reinforcement-learning (RL) benchmarks built on microscopic traffic simulators such as SUMO are increasingly used to compare agent architectures for electric vehicle (EV) charging assignment. Unlike crashes, defects in the reward function, the environment's stochastic model, or the state encoding often fail silently: the simulation completes, produces plausible numbers, and the comparison is biased. We report five such defects, found by auditing a five-agent benchmark on OpenStreetMap road networks, stated generically: a shared random generator that desynchronises seed-paired comparisons, an ablation-specific reward clip applied unconditionally, a normalisation mismatch that zeroes a reward term, a per-timestep penalty that should fire once per event, and a state dimensionality documented but never wired into the network. We quantify three: a rejection counter inflated up to 125x across agents/cities, a reward term bounded at about $10^{-4}$ of its intended scale, and a 16.6%/16.3% greedy-action divergence from a state-encoding mismatch. Re-analysing a historical ablation, no A1-A2 effect survives family-wise correction; a 56-run campaign confirms the RNG defect's mechanism directly while showing its correction does not change that conclusion. We provide an eight-item checklist as a low-cost first-pass audit; in a later regeneration, three checks caught two new defects while three further process/artefact defects fell outside its boundary.

Abstract:Reinforcement-learning (RL) benchmarks built on microscopic traffic simulators such as SUMO are increasingly used to compare agent architectures for electric vehicle (EV) charging assignment. Unlike crashes, defects in the reward function, the environment's stochastic model, or the state encoding often fail silently: the simulation completes, produces plausible numbers, and the comparison is biased. We report five such defects, found by auditing a five-agent benchmark on OpenStreetMap road networks, stated generically: a shared random generator that desynchronises seed-paired comparisons, an ablation-specific reward clip applied unconditionally, a normalisation mismatch that zeroes a reward term, a per-timestep penalty that should fire once per event, and a state dimensionality documented but never wired into the network. We quantify three: a rejection counter inflated up to 125x across agents/cities, a reward term bounded at about $10^{-4}$ of its intended scale, and a 16.6%/16.3% greedy-action divergence from a state-encoding mismatch. Re-analysing a historical ablation, no A1-A2 effect survives family-wise correction; a 56-run campaign confirms the RNG defect's mechanism directly while showing its correction does not change that conclusion. We provide an eight-item checklist as a low-cost first-pass audit; in a later regeneration, three checks caught two new defects while three further process/artefact defects fell outside its boundary.

14 pages, 2 figures. Accepted for publication in Bulletin of Electrical Engineering and Informatics (BEEI), ISSN 2089-3191, e-ISSN 2302-9285 (accepted 8 September 2026; in press)

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

arXiv:2611.01769 [cs.LG]

(or arXiv:2611.01769v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.01769 arXiv-issued DOI via DataCite (pending registration)

Full text under the publisher's open licence · 247 words

Related coverage