The paper introduces a theoretically grounded multi‑task learning framework, AMTIDIN, for joint interference detection, modulation identification, and interference identification. It derives an upper bound linking MTL performance to task similarity measured by Wasserstein distance and adaptive coefficients, and employs adversarial training to reduce distributional gaps across tasks. Experiments show AMTIDIN outperforms single‑task models and other MTL baselines, especially when training data is limited, signals are short, and SNRs are low.
arXiv:2607. 16554v1 Announce Type: cross Abstract: In multi-task learning (MTL) negative transfer is often considered as an optimization artifact, but it can also be viewed as a consequence of limited shared capacity and weak task redundancy.
The paper introduces COVER, a multi‑task learning framework that regularizes covariate overlap to mitigate the negative effects of sharing information across tasks with differing covariate distributions and response relationships. COVER blends a common component function, a shared neural representation, and low‑dimensional task‑specific coefficients, using taskwise second‑moment matrices to guide coefficient integration. The authors provide theoretical bias‑variance analysis, oracle inequalities, and neural‑network convergence rates, and demonstrate that COVER outperforms existing deep‑learning and statistical integration methods in simulations and a GTEx central‑nervous‑system study.
arXiv:2607. 08031v1 Announce Type: cross Abstract: The dynamics of communication environments induce significant distribution shifts across domains, challenging the generalization of deep learning-based automatic modulation classification (AMC) models.
arXiv:2604. 07848v2 Announce Type: replace Abstract: Multi-task learning shows strikingly inconsistent results -- sometimes joint training helps substantially, sometimes it actively harms performance -- yet the field lacks a principled framework for predicting these outcomes.
arXiv:2607. 16877v1 Announce Type: cross Abstract: The increasing complexity of next-generation wireless networks has driven the integration of artificial intelligence (AI) into wireless communications.
arXiv:2607. 00995v1 Announce Type: cross Abstract: Most existing multitask learning approaches are limited by their reliance on task-specific loss functions tailored to the scale and type of each outcome.
arXiv:2510. 04927v2 Announce Type: replace-cross Abstract: Automatic modulation classification (AMC) is a core enabler of cognitive wireless systems, providing spectrum awareness and supporting adaptive communication at the network edge.
arXiv:2607. 09202v1 Announce Type: cross Abstract: Continual learning commonly relies on post-hoc mechanisms such as replay, elastic regularization, or distillation.
arXiv:2608.28865v1 Announce Type: cross Abstract: Joint modulation recognition and signal-to-interference-plus-noise ratio (SINR) estimation can reduce duplicated processing in intelligent receivers,...
arXiv:2602. 11834v2 Announce Type: replace-cross Abstract: While machine learning (ML)-based receiver algorithms have received a great deal of attention in the recent literature, they often suffer from poor scaling with increasing spatial multiplexing order and lack of explainability and generalization.
arXiv:2507. 09471v4 Announce Type: replace Abstract: Continual Learning (CL) empowers AI models to continuously learn from sequential task streams.
Transformers can learn broad families of tasks during pretraining and adapt to unseen tasks from a short prompt, but a rigorous understanding of this capability is limited. This paper studies how shared cross‑task structure influences the sample complexity of in‑context learning (ICL) by characterizing task‑space complexity through covering numbers, yielding a set of anchor functions that localize unseen tasks and predict responses. The authors construct a Transformer with Softmax attention to approximate this procedure and derive an error bound that separates the effects of pretraining tasks and prompt length, showing that once enough tasks are available the dependence on prompt length becomes dimension‑free.