On AI Verification in Open RAN
Rahul Soundrarajan, Claudio Fiandrino, Michele Polese, Salvatore D'Oro, Leonardo Bonati, Tommaso Melodia
TL;DR
This paper investigates trustworthy AI in Open RAN by arguing that explainability alone is insufficient for reliable network operation. It proposes a lightweight verification strategy using a Decision Tree-based verifier to check DRL-driven slice control and scheduling in near-real time, integrated within the O-RAN ai/ml lifecycle. The authors analyze the roles of XAI and AI verification, map an architectural integration, and demonstrate feasibility with a DT-based slice-verifier trained on KPI data (augmented via CTGAN) and evaluated against DRL agents for embb, mmtc, and urllc slices. They also outline open challenges, including system-level verification, scalability-soundness trade-offs, and phased prototyping, to guide future work toward robust, trustworthy AI adoption in Open RAN.
Abstract
Open RAN introduces a flexible, cloud-based architecture for the Radio Access Network (RAN), enabling Artificial Intelligence (AI)/Machine Learning (ML)-driven automation across heterogeneous, multi-vendor deployments. While EXplainable Artificial Intelligence (XAI) helps mitigate the opacity of AI models, explainability alone does not guarantee reliable network operations. In this article, we propose a lightweight verification approach based on interpretable models to validate the behavior of Deep Reinforcement Learning (DRL) agents for RAN slicing and scheduling in Open RAN. Specifically, we use Decision Tree (DT)-based verifiers to perform near-real-time consistency checks at runtime, which would be otherwise unfeasible with computationally expensive state-of-the-art verifiers. We analyze the landscape of XAI and AI verification, propose a scalable architectural integration, and demonstrate feasibility with a DT-based slice-verifier. We also outline future challenges to ensure trustworthy AI adoption in Open RAN.
