The paper critiques current multi‑task active learning (MTL‑AL) methods that use linear scalarization of objectives like uncertainty, diversity, and gradient conflict, arguing that such combinations miss Pareto‑optimal trade‑offs. It introduces a new framework that separates acquisition into informativeness and exploration, decouples conflict scoring from candidate ranking, and uses gradient surgery during training. The authors also propose a cross‑task mutual information metric and demonstrate consistent improvements on COCO, Cityscapes, and NYUv2 datasets compared to recent baselines.
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.
arXiv:2607. 03522v1 Announce Type: new Abstract: Fine-tuning a single low-rank adapter on many domains at once is multi-task learning: the domains must be co-learned, and how they share the adapter decides whether they help or hurt one another.
arXiv:2606. 02221v1 Announce Type: cross Abstract: Multi-task learning (MTL) aims to construct a joint model for multiple tasks by sharing a common representation across domains.
arXiv:2610.07045v1 Announce Type: cross Abstract: Many scientific studies allow costly auxiliary information to be collected during data labeling but not at deployment. Examples include diagnostic te...
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.
arXiv:2312. 06173v2 Announce Type: replace Abstract: Merging models fine-tuned from a common, extensively pre-trained large model but specialized for different tasks has been demonstrated as a cheap and scalable strategy to construct a multi-task model that performs well across diverse tasks.
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. 02681v1 Announce Type: cross Abstract: Integrating information across related tasks can improve estimation and prediction in transfer, multi-task, and federated learning, but contamination and heterogeneity make robust borrowing challenging.
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:2606. 18627v1 Announce Type: new Abstract: Model merging has emerged as a training-free alternative to multi-task learning, aiming to combine multiple task-specific fine-tuned models into a single multi-task model.
arXiv:2608. 20169v1 Announce Type: cross Abstract: We present a novel approach to efficient LLM agent harness optimization through adaptive validation task selection.
arXiv:2604. 01608v4 Announce Type: replace Abstract: Multi-agent systems (MAS) tackle complex tasks by distributing expertise, though this often comes at the cost of heavy coordination overhead, context fragmentation, and brittle phase ordering.