cs.LGNov 10, 2026

Conformal Risk Control for QoT-Aware Lightpath Feasibility Under Technology-Driven Domain Shift

Authors: Kiarash Rezaei, Omran Ayoub, Paolo Monti, Carlos Natalino

Organizations: Department of Electrical Engineering, Chalmers University of Technology, 412 96 Gothenburg, Sweden. · University of Applied Sciences and Arts of Southern Switzerland, 6928 Lugano, Switzerland.

Abstract

Artificial intelligence and machine learning (AI/ML)-based regression models support operational decision-making in optical networks but typically expose only point predictions, which carry no statistically controlled information about their reliability. This paper proposes a post-hoc conformal risk control (CRC) framework that keeps a pretrained AI/ML regressor fixed, provides a finite-sample guarantee on uncertainty band miscoverage, and maps the band to operational decisions through policy rules. The guarantee applies to interval miscoverage, while decision-error rates are evaluated empirically. We instantiate the framework for quality of transmission (QoT)-aware lightpath (LP) feasibility assessment, in which a regressor predicts optical signal-to-noise ratio (OSNR) under domain shifts caused by fiber, amplifier, and switching upgrades. Feature shift contribution scores identify the LP features whose relation to QoT changes the most across a technology transition, and two policies translate the bands into feasibility decisions, allowing operators to tune the trade-off between conservatively rejecting or aggressively accepting LP realizations. Experiments on open space-division multiplexing (SDM) QoT datasets over the CONUS topology show that, for a target coverage of 90%, the uncertainty bands meet the target in all 170 trials spanning 17 domain shifts and ten calibration-test partitions, whereas a source-only quantile regression (QR) baseline meets it in none. Under severe shifts, the efficiency-oriented (EO) policy empirically improves zero-shot (ZS) feasibility-decision accuracy from about 85% to above 99%, approaching a transfer learning (TL) policy while avoiding retraining. The framework provides finite-sample control of uncertainty band miscoverage for regression-based optical network decision support, with potential applications beyond QoT-aware LP feasibility assessment.

Figures & tables

Appendix figures & tables4 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Jun 10, 2026

Policy-driven Conformal Prediction for Trustworthy QoT Estimation

We propose Conformal QoT, a policy-driven framework that combines statistically guaranteed QoT estimation with operational decision policies, enabling reliable lightpath-feasibility predictions under domain shift and improving accuracy from 92% to 99.6% on open datasets.
Jul 24, 2026

Retrieval-Based Cross-Domain Generalization in Optical Networks via Global Features

We propose a retrieval-based framework for crossdomain quality-of-transmission (QoT) estimation that leverages transferable feature representations while avoiding reliance on source-domain-specific decision boundaries. The proposed approach supports both zero-shot and few-shot adaptation without requiring model retraining. Experimental results on cross-domain QoT datasets demonstrate improved generalization performance compared with conventional machine learning baselines and recent contrastive learning approaches, highlighting the potential of retrieval-based inference for robust optical network automation.
Aug 7, 2026

Online Conformal Prediction Beyond Feedback

Online conformal prediction (OCP) provides theoretically principled uncertainty quantification for arbitrary black-box classifiers and non-i.i.d. data streams by constructing prediction sets that are guaranteed to contain the true label at a user-specified frequency. OCP usually updates prediction sets using feedback from previously deployed predictions. We instead study an OCP setting beyond feedback: on each round, the learner can either output a prediction set or query the correct label, but not both. Thus, no deployed prediction is ever evaluated directly. We reduce this problem to a partial monitoring game in which prediction actions return no observation and a separate query action reveals the label. To solve this game, we develop OCP with queries (OCPQ), a label-efficient forecasting algorithm designed for this beyond-feedback setting. Using an adequate reward construction, for any black-box classifier and any (non-i.i.d.) oblivious data stream of length TT, OCPQ has O(T2/3)O(T^{2/3}) expected regret and expected coverage of at least β−O(T−1/3)β-O(T^{-1/3}) for a user-defined ββ, while querying only an expected T−1/3T^{-1/3} fraction of rounds. This provides coverage comparable to bandit-based OCP methods while requiring no feedback from deployed predictions. Experiments on real-world datasets demonstrate the effectiveness of our approach.