arXiv:2607. 20666v1 Announce Type: cross Abstract: The robustness of machine learning techniques across heterogeneous network domains remains an open challenge in optical networks.
By Ali Al Housseini, Carlos Natalino, Paolo Monti, Omran Ayoub
arXiv:2606. 30322v1 Announce Type: new Abstract: We propose a hybrid active-online learning framework for label-efficient concept drift adaptation in optical network failure detection.
By Yousuf Moiz Ali, Jaroslaw E. Prilepsky, Jo\~ao Pedro, Sasipim Srivallapanondh, Antonio Napoli, Sergei K. Turitsyn, Pedro Freire
arXiv:2607. 18068v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly adopted for network automation, yet their output quality and inference cost can vary substantially across LLM families.
By Kiarash Rezaei, Omran Ayoub, Paolo Monti, Carlos Natalino
Large language models (LLMs) are increasingly adopted for network automation, yet their output quality and inference cost can vary substantially across LLM families. We present HuGLEN, a stepwise evaluation pipeline that uses an LLM-as-a-judge together with a small set of expert ratings to enable scalable and reproducible comparison of candidate LLMs, and to rank them using a quality efficiency score (QES).
arXiv:2607. 20675v1 Announce Type: new Abstract: Machine learning (ML) models are increasingly integrated into optical network automation frameworks to support tasks such as failure management, performance monitoring and resource allocation.
By Omran Ayoub, Carlos Natalino, Ali Al Housseini, Felix Foschum, Philipp Morger, Tiziano Leidi, David Hock, Paolo Monti
The paper investigates the theoretical limits of transfer learning, demonstrating that careful selection of transferable information and its dependence on target problems is crucial. It establishes that the degree of probabilistic change in a transfer-learning algorithm imposes an upper bound on achievable improvement. These findings extend the algorithmic search framework to a broad class of learning tasks involving transfer.
By Jake Williams, Abel Tadesse, Tyler Sam, Huey Sun, George D. Montanez
arXiv:2609.22294v1 Announce Type: cross
Abstract: Underwater Optical Wireless Communication (UOWC) has emerged as a promising technology for high-speed underwater data transmission, offering signific...
By Shaymaa Mahmoud, Ardimas Purwita, Mohamed-Slim Alouini
arXiv:2607. 17467v1 Announce Type: cross Abstract: Few-shot Test-Time Domain Adaptation (FSTT-DA) seeks to adapt models to novel domains using only a handful of unlabeled target samples.
By Siobhan Reid, Zhixiang Chi, Li Gu, Omid Reza Heidari, Ziqiang Wang, Yang Wang
With growing privacy and portability concerns, source-free domain adaptation requires only a source pre-trained model and an unlabeled target domain, allowing for effective adaptation to the target data. Most existing self-training methods focus on selecting and exploiting samples with reliable predictions, often neglecting others.
The paper introduces Spectral Transductive Refinement (STR), a training‑free method that refines class prototypes at test time using the geometry of a joint k‑nearest‑neighbour graph and a normalized‑Laplacian spectral coordinate system. STR operates solely on frozen visual embeddings, iteratively updating pseudo‑labelled queries to improve one‑shot and few‑shot classification under domain shift. Experiments on ResNet‑18 and ResNet‑10 backbones show STR outperforms single‑prototype baselines and rivals meta‑trained cross‑domain few‑shot methods, achieving the best 1‑shot average across eight target domains.
By Fahim Rahman, S. M. Tanjeeb Meheran Rohan, Md. Taimum Ibne Sayed, Asaduzzaman Herok, Md. Bakhtiar Hasan
arXiv:2606. 08691v1 Announce Type: new Abstract: Modern data-driven applications increasingly involve learning from multiple heterogeneous sources, where a target dataset is limited but related information is available across domains.
By Samhita Pal, Tian Gu
arXiv:2607. 29365v1 Announce Type: new Abstract: Graph Domain Adaptation (GDA) transfers predictive knowledge from labeled source graphs to unlabeled target graphs under distribution shift.
By Yingxu Wang, Haoze Huang, Zhongkai Zheng, Shangsong Liang