Automated, Interpretable and Efficient ML Models for Real-World Lightpaths’ Quality of Transmission Estimation
Bibliographic record
Abstract
Fast and accurate estimation of lightpaths’ quality of transmission (QoT) is crucial for ensuring quality of service (QoS) and seamless operation in real-world optical networks. Machine learning (ML) algorithms are promising tools for QoT estimation of lightpaths before their establishment. In multi-domain optical networks, where learned QoT estimation models must be transferred between heterogeneous environments with limited target data, deep neural networks (DNNs) have shown promising results. However, DNN-based transfer learning (TL) approaches using fine-tuned artificial neural networks (ANNs) and convolutional neural networks (CNNs), offer limited interpretability. Consequently, little insight into the decision-making process is provided, and large labeled datasets as well as high computational resources are required, limiting their suitability for real-time, large-scale deployment in production networks. To address these challenges, we propose a novel lightweight and interpretable TL framework that integrates the Boruta-SHAP algorithm for automated feature selection (FS) together with two domain adaptation (DA) techniques: Feature Augmentation and Correlation Alignment. In contrast to the existing approaches based on DNN, our strategy leverages interpretable and efficient ML models to enhance the adaptability across diverse datasets in real-world network environments. We show that our random forest (RF)-based models achieve better performance than the ANN-based models, without sacrificing the classification accuracy. The FS via Boruta-SHAP allows for reducing dimensionality as well as training and inference times up to 70.68%, and 41.64%, respectively. Our proposed framework outperforms DA baseline models achieving 99.35% accuracy improvement in domain shift. Moreover, it offers 86% accuracy with a 99.83% reduction in the size of the target domain.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".