Machine learning-based resource management (RM) models degrade under out-of-distribution (OOD) inputs at runtime, yet existing approaches in the literature rely on a single global error margin that is overly conservative and fails to distinguish reliablepredictions from catastrophic failures. We propose Lightweight Runtime EXplainability (LEX), the first post-hoc XAI framework for input-specific runtime confidence estimation in ML-based RM. LEX clusters the embeddings of the training input space using a Gaussian Mixture Model and associates per-cluster prediction error bounds to input samples, enabling fine-grained runtime confidence signals without retraining. Evaluated on a state-of-the-art LSTM-based IPS forecasting model on Intel Alder Lake, across 34 benchmark applications, LEX achieves ~94% containment on unseen workloads and produces ~17% tighter per-input confidence bounds than global baselines. With its negligible runtime overhead, LEX advances the field by providing explainable and reliable input-specific confidence signals of ML predictions, thereby making ML-based resource management resilient to OOD at runtime.
Figures & tables
Figure 1. Performance (in MAPE) of model inference on phase-level input data of different applications from the PARSEC/SPLASH-2 benchmark suites, with (a) 50 random 70/30 splits and (b) leave-one-out cross-validation. A significant percentage of data points exceed global thresholds, often exceeding 50%, highlighting that global thresholds fail to provide a reliable confidence signal.
Figure 2. KDE of eight raw PMC features across three window subsets: the 70% training split (blue), the test windows with a good MAPE below the 99th percentile ( ≤2.2 %, green), and the OOD test windows in the 99th percentile tail ( >2.2 %, red).
Figure 3. Application behavioral fingerprint map. Each cell (i,k) shows the fraction of application i ’s test samples assigned to GMM cluster k (blue intensity, row-normalized) and the mean MAPE achieved in that cell (dot color: green → red; dot size proportional to MAPE).
Figure 4. t-SNE visualization of phase-level embeddings. Filled circle markers denote P-core executions; triangle markers denote E-core executions. Each point is the mean embedding of all phases of one application under one configuration.
Figure 5. Overview of Lightweight Runtime EXplainability . At design time (left), an encoder Enc(⋅) and a Gaussian Mixture Model G are fitted on the training embeddings; a per-cluster error lookup table L is constructed from the validation set. At runtime (right), the incoming input x is encoded, mapped to its most probable cluster k∗ , and the associated confidence estimate C(x)=L[k∗] is retrieved. The confidence is used in two ways: it is added as a margin to the prediction, yielding the interval I(x) , and it is checked by the trust condition. The resource management technique uses the prediction with its interval when C(x)≤τ , or falls back to a conservative policy otherwise. The encoder, GMM and lookup table are shared across both phases (middle purple-shaded box).
Figure 6. Performance comparison. Bars (left axis) show normalized performance for Max, Mean, P90, and our LEX . Triangle markers (right axis) show the corresponding absolute MAPE threshold values. Across the four experiments, our LEX consistently achieves an average performance of ~94%, on par with the Max baseline, i.e., the most pessimistic, while providing error margins that are ~17% tighter. This highlights the effectiveness of our model’s adaptive and input-specific confidence estimations.
Figure 7. t-SNE visualization of phase-level embeddings. Filled circle markers denote P-core executions; triangle markers denote E-core executions. Each point is the mean embedding of all phases of one application under one configuration.
Machine learning (ML) models are increasingly integrated into optical network automation frameworks to support tasks such as failure management, performance monitoring and resource allocation. In these environments, ML-driven predictions may be directly coupled with control-plane actions where incorrect decisions can immediately impact service quality, resource efficiency, and network stability. As automation levels increase, ensuring the reliability of individual decisions at deployment time becomes a critical requirement. Explainable artificial intelligence (XAI) techniques have emerged to improve transparency by highlighting the factors influencing ML predictions. In addition to identifying influential features, they provide insights into the underlying reasoning process of the model, revealing how different input variables contribute to the final outcome and how feature interactions shape the decision boundary. In this work, we introduce explanation-based runtime verification, an approach that exploits model explanations to assess the soundness of individual ML decisions before they are executed in the network control loop. The proposed approach evaluates explanation coherence and physics grounding consistency at runtime, enabling the system to defer or reject decisions flagged as uncertain. We demonstrate the effectiveness of our approach on a representative use case of lightpath quality of transmission classification. Experimental results show that explanation-based verification can intercept a significant fraction of erroneous decisions while preserving high automation rate.
Omran Ayoub, Carlos Natalino, Ali Al Housseini +5
University of Applied Sciences and Arts of Southern Switzerland, Lugano, Switzerland · Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden · SKOOR GmbH, Switzerland +1
Out-of-Distribution (OOD) data poses a significant threat to machine learning models, often leading to model failure during deployment. All existing OOD detection methods are post-hoc, relying on evaluation metrics such as accuracy and AUC-ROC during inference to indirectly assess the model's response to OOD data by measuring deviations. In contrast to existing approaches, the proposed work shifts the paradigm from OOD detection to OOD prediction by proposing a pre-hoc anticipatory framework called PLSP for OOD prediction. We make several key contributions: (a) a dataset-independent metric called the CREDibility Score (CREDS) is proposed for OOD prediction; (b) credibility curves are introduced to study the maximum credibility a model can attain; and (c) credibility heat maps (and volume under surface) are introduced to characterize pre-hoc model behavior across different datasets. This work provides a novel perspective on signal processing under distributional shifts. Experiments across multiple datasets demonstrate that the proposed metric serves as a valuable measure for improving the robustness of machine learning models toward OOD prediction.
University of Wisconsin Madison, Madison, WI, USA · IMC University of Applied Sciences, Krems, Austria · Indian Institute of Technology Roorkee, Roorkee, India
Explaining opaque Machine Learning (ML) models has become an increasingly important challenge. However, current eXplanation in AI (XAI) methods suffer several shortcomings, including insufficient abstraction, limited user interactivity, and inadequate integration of symbolic knowledge. We propose ReasonX, an explanation tool based on expressions (or, queries) in a closed algebra of operators over theories of linear constraints. ReasonX provides declarative and interactive explanations for decision trees, which may represent the ML models under analysis or serve as global or local surrogate models for tabular-data black-box classifiers. Users can express background or common sense knowledge as linear constraints. This allows for reasoning at multiple levels of abstraction, ranging from fully specified examples to under-specified or partially constrained ones. ReasonX leverages Mixed-Integer Linear Programming (MILP) to reason over the features of factual and contrastive instances. We present here the architecture of ReasonX, which consists of a Python layer, closer to the user, and a Constraint Logic Programming (CLP) layer, which implements a meta-interpreter of the query algebra. The capabilities of ReasonX are demonstrated through qualitative examples, and compared to other XAI tools through quantitative experiments.
Laura State, Salvatore Ruggieri, Franco Turini
University of Pisa, IT · Scuola Normale Superiore, IT · Alexander von Humboldt Institute for Internet and Society, GER