CoChat

Explainable AI-Aided Feature Selection and Model Reduction for DRL-Based V2X Resource Allocation

Khan, Nasir, Abdallah, Asmaa, Celik, Abdulkadir, Eltawil, Ahmed M., Coleri, Sinem · 2025 · IEEE Transactions on Communications

The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index; 12 of the 30 sources its claims cite were checked for support.

Abstract

Artificial intelligence (AI) is expected to significantly enhance radio resource management (RRM) in sixth-generation (6G) networks. However, the lack of explainability in complex deep learning (DL) models poses a challenge for practical implementation. This paper proposes a novel explainable AI (XAI)-based framework for feature selection and model complexity reduction in a model-agnostic manner. Applied to a multi-agent deep reinforcement learning (MADRL) setting, our approach addresses the joint sub-band assignment and power allocation problem in cellular vehicle-to-everything (V2X) communications. We propose a novel two-stage systematic explainability framework leveraging feature relevance-oriented XAI to simplify the DRL agents. While the former stage generates a state feature importance ranking of the trained models using Shapley additive explanations (SHAP)-based importance scores, the latter stage exploits these importance-based rankings to simplify the state space of the agents by removing the least important features from the model’s input. Simulation results demonstrate that the XAI-assisted methodology achieves ~97% of the original MADRL sum-rate performance while reducing optimal state features by ~28%, average training time by ~11%, and trainable weight parameters by ~46% in a network with eight vehicular pairs.

Overview

CoChat Summary

TL;DR

The paper proposes a post-hoc, model-agnostic SHAP-based XAI pipeline to rank and select input state features for a MADRL V2X resource-allocation system, then retrains reduced-size DRL agents. It reports near-original sum-rate with fewer state features, lower training time, and fewer broadcast parameters.

Key findings

  • The XAI-assisted Simplified-MADRL achieves ∼97% of Original-MADRL sum-rate while reducing optimal state features by ∼28%, average training time by ∼11%, and trainable weight parameters by ∼46% in a network with eight vehicular pairs.
  • For K=4 and K=8 V2V agents, the method reduces optimal state features by ∼21% and ∼28%, average training time by ∼26% and ∼11%, and broadcast parameters per agent by ∼35% and ∼46%, respectively; Table IV reports 24→19 and 80→58 state features, 6.23→4.56 ms and 13.4→11.9 ms training time, and 34,544→22,424 and 347,920→185,912 broadcast parameters.
  • Simplified-MADRL outperforms centralized SADRL by on average 41% higher sum-rate for K=N=4 and 66% higher for K=N=8; the average sum-rate difference from Original-MADRL is less than ∼7% for K=N=4, and for K=N=8 it achieves higher sum-rates for most links with ∼28% fewer state features.
  • Reliability results show Original-MADRL reaching ∼92% network availability at εmax=10⁻⁵ for K=N=4 and nearly 98.3% at εmax=10⁻⁴; Simplified-MADRL reaches around 98% at εmax=10⁻⁴ for K=N=4, while SADRL achieves only ∼80% for K=N=8 at εmax=10⁻³.

Methods

  • The paper formulates joint spectrum sub-band assignment and transmit-power allocation for V2N and V2V links in a URLLC-enabled C-V2X network, maximizing sum-rate under reliability, latency, and power constraints. It solves this with MADRL using centralized training at the BS and decentralized execution at V2V transmitters, with DQNs and a common reward.
  • The XAI pipeline uses Deep-SHAP on trained DQN agents with background and hold-out datasets to produce global state-feature importance rankings. An iterative feature-selection algorithm masks the least important features, evaluates average network performance against a precision threshold Δ, and retrains the model on the retained subset.
  • Simulations follow 3GPP TR 36.885 urban V2X setup: 750×1299 m area, 9 buildings, 2 GHz carrier, 23 dBm max transmit power, 1 ms packet latency, 180 kHz V2N bandwidth, and K=N=4 and K=N=8 configurations. Performance is compared against Original-MADRL, Simplified-MADRL, centralized SADRL, Full power, and Random allocation.

Limitations

  • The paper states that theoretical convergence guarantees for the proposed MADRL solution and other advanced multi-agent adaptations are challenging in dynamic vehicular networks despite good empirical performance; the common global reward mitigates instability but prevents each agent from achieving a higher individual reward.
  • The paper states that the method is designed for a specific vehicular environment: when the environment changes, DNNs need retraining and feature selection must be reevaluated. It also notes that high mobility can make well-trained models outdated, retraining may be triggered by performance thresholds, and if vehicles exceed the maximum trained agents, extra vehicle information is not included in the state.
  • The paper states that Deep-SHAP computational complexity increases exponentially with the number of state features and linearly with background samples, so it uses K-means summaries (1% background, 10% hold-out). Evident from the text: evaluation is simulation-only, with no real-world deployment results, and the approach depends on offline training, CSI/feedback assumptions, and periodic weight broadcasting.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1109/tcomm.2025.3554655

Cites

59 of 59 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Figure 1 System model for the V2X communication network.
Figure 1 System model for the V2X communication network.From the PDF
Figure 2 Illustration of the proposed multi-agent deep reinforcement learning algorithm.
Figure 2 Illustration of the proposed multi-agent deep reinforcement learning algorithm.From the PDF
Image 3
From the PDF
Figure 3 The process of generating SHAP values for multiple trained models using Deep-SHAP. The pre-trained models f k ( x ) , ∀ k ∈ K and the background dataset X BG are utilized to calculate SHAP values for each instance in the hold-out dataset X . The argmax output helps select the appropriate vector of SHAP values. Subsequently, the mean-absolute SHAP values are calculated and sorted in descending order to encode feature importance. These values are then transformed using the softmax transformation. The transformed SHAP values are averaged across the K trained models. Here, L is the total number of state features, and M is the number of valid actions.
Figure 3 The process of generating SHAP values for multiple trained models using Deep-SHAP. The pre-trained models f k ( x ) , ∀ k ∈ K and the background dataset X BG are utilized to calculate SHAP values for each instance in the hold-out dataset X . The argmax output helps select the appropriate vector of SHAP values. Subsequently, the mean-absolute SHAP values are calculated and sorted in descending order to encode feature importance. These values are then transformed using the softmax transformation. The transformed SHAP values are averaged across the K trained models. Here, L is the total number of state features, and M is the number of valid actions.From the PDF
Image 5
From the PDF
Figure 4 Average network performance and retained state features versus the precision threshold, with: (a) K = N = 4 where the Original-MADRL network has 24 state features per agent, and (b) K = N = 8 where the Original-MADRL network has 80 state features per agent.
Figure 4 Average network performance and retained state features versus the precision threshold, with: (a) K = N = 4 where the Original-MADRL network has 24 state features per agent, and (b) K = N = 8 where the Original-MADRL network has 80 state features per agent.From the PDF
Image 7
From the PDF
Image 8
From the PDF
Figure 7 Sum rate performance of V2N and normal V2V links with varying vehicle speeds.
Figure 7 Sum rate performance of V2N and normal V2V links with varying vehicle speeds.From the PDF
Figure 8 Network availability for different maximum error probability thresholds.
Figure 8 Network availability for different maximum error probability thresholds.From the PDF
Figure 9 Sum rate of V2N links with varying number of vehicles.
Figure 9 Sum rate of V2N links with varying number of vehicles.From the PDF

Verification

Claims the paper makes

5 Valid · 13 Not valid · 17 Not checked · 89 Own results and interpretations

55 more claims

Create a free account to see all 124 claims and to verify the 4 references still open.

See all claims — free account
  • Probably not a substantial claim. 45
  • It may state two separate claims as one. 33
  • The quote only partly states this claim. 1

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

1 of 1

Citations

Cites

Research works printed but not linked: 2

  1. 2016, Technical Specification Group Radio Access Network; Study on LTE-Based V2X Services; (release 14)
  2. Kyösti, 2007, Ist-4-027756 Winner II D1.1.2 V1.2 Winner II Channel Models

Cited by

See all 20

Metadata

Authors
Khan, N., Abdallah, A., Celik, A., Eltawil, A. M., & Coleri, S.
Affiliations
  • Koç University (TR)
  • King Abdullah University of Science and Technology (SA)
  • Computer, Electrical, and Mathematical Sciences and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
  • Department of Electrical and Electronics Engineering, Koc University, İstanbul, Türkiye
Venue
IEEE Transactions on Communications
Published
2025-09
Volume
73
Issue
9
Pages
7633-7649
ISSN
  • 0090-6778 (ISSN-L)
  • 1558-0857
OpenAlex
W4408860665
Cited by
20
References
39
Citations by year
2026: 12 · 2025: 8
FWCI
8.09
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Communications (publishedVersion)
Funders
Türkiye Bilimsel ve Teknolojik Araştırma Kurumu (119C058)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Vehicular Ad Hoc Networks (VANETs)
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Technologies
Keywords
explainable AI, feature selection, model reduction, deep reinforcement learning, multi-agent deep reinforcement learning, vehicle-to-everything communication, radio resource management, 6G, power allocation, SHAP, feature importance ranking, state space reduction, vehicular communication

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.