arXiv Machine Learning

Deep Multitask Learning for Mixed-Type Outcomes with Shared Sparsity

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 Machine Learning
Sep 10

Multi-Task Learning with Covariate-Overlap Regularization

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.

By Yang Sui, Qi Xu, Yang Bai, Annie Qu
arXiv Machine Learning
Sep 24

Multitask Regression with Pairwise Fusion

The paper investigates multitask regression where different predictors may have varying degrees of coefficient sharing across tasks. It introduces a framework that quantifies sharing by the number of active predictors and the total number of task-specific coefficient deviations, and proposes a pairwise penalty estimator that achieves matching upper and lower bounds in terms of these quantities. The method also handles scenarios where a large subset of tasks shares an identical coefficient vector, with explicit sample‑size conditions ensuring exact pooling of those tasks while allowing others to differ.

By Xiaodong Li, Zhentao Li
arXiv AI
Sep 24

Joint Interference Detection and Identification via Adversarial Multi-task Learning

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.

By H. Xu, L. Hu, B. He, S. Wang
arXiv Machine Learning
Sep 14

SIMS: Scale-Invariant Merit-Function-Based Scalarization for Multi-Task Learning

SIMS: Scale-Invariant Merit-Function-Based Scalarization for Multi-Task Learning proposes a new scalarization method for multi-task learning that is invariant to the relative scales of task losses. By using a logarithmic transformation, SIMS converts the multi-objective problem into a single objective that preserves weak Pareto optimality and allows a smooth surrogate with controllable approximation error. Experiments on standard multi-task benchmarks show that SIMS consistently outperforms existing scalarization methods and achieves state‑of‑the‑art performance.

By Zebin Chen, Fei Xing, Yang Chen, Hua Liu, Andy HF Chow, Yuhua Qian, Yu Zhang
arXiv Machine Learning
Sep 4

Cooperative Multi-Task Semantic Communication for Joint Classification and Regression Tasks

The paper extends the Cooperative Multi-Task Semantic Communication (CMT‑SemCom) framework to jointly perform heterogeneous classification and regression tasks on the Cityscapes dataset, using an InfoMax principle to handle mixed discrete and continuous semantic variables. It compares the new framework against independent single‑task training, conventional task‑agnostic digital transmission, and single‑encoder multi‑decoder SemCom, and studies how the capacity of the common unit affects joint task performance. Extensive evaluations show that CMT‑SemCom outperforms all benchmarks.

By Ahmad Halimi Razlighi, Mohammad Siddiqur Rahman, Maximilian H. V. Tillmann, Edgar Beck, Armin Dekorsy