arXiv:2509.06575stat.MLcs.LG2025-09

提出新方法应对多任务学习中的异常任务干扰

Robust and Adaptive Spectral Method for Representation Multi-Task Learning with Contamination

  • 基于谱分析设计鲁棒自适应算法,无需先验污染信息
  • 理论证明在80%任务污染下仍优于单任务学习
  • 适合存在异常数据或任务异质性的实际场景

基于表示的多任务学习通过共享结构提升效率,但常受异常值或对抗性任务干扰。现有方法多假设数据清洁,难以应对高比例污染。本文提出鲁棒自适应谱方法(RAS),可在未知且可能高达80%的任务污染比例下,有效提取共性内点表示,且无需预知真实表示维度。理论上,给出了表示与各任务参数的非渐近误差界,其性能随内点任务相似性和异常结构自适应,保证至少不劣于单任务学习,避免负迁移。方法还可拓展至迁移学习,并提供目标任务的理论保障。大量实验验证了理论结果,表明RAS在高污染场景下兼具鲁棒性与自适应性。

原文摘要 · Abstract (English)

Representation-based multi-task learning (MTL) improves efficiency by learning a shared structure across tasks, but its practical application is often hindered by contamination, outliers, or adversarial tasks. Most existing methods and theories assume a clean or near-clean setting, failing when contamination is significant. This paper tackles representation MTL with an unknown and potentially large contamination proportion, while also allowing for heterogeneity among inlier tasks. We introduce a Robust and Adaptive Spectral method (RAS) that can distill the shared inlier representation effectively and efficiently, while requiring no prior knowledge of the contamination level or the true representation dimension. Theoretically, we provide non-asymptotic error bounds for both the learned representation and the per-task parameters. These bounds adapt to inlier task similarity and outlier structure, and guarantee that RAS performs at least as well as single-task learning, thus preventing negative transfer. We also extend our framework to transfer learning with corresponding theoretical guarantees for the target task. Extensive experiments confirm our theory, showcasing the robustness and adaptivity of RAS, and its superior performance in regimes with up to 80\% task contamination.

多任务学习鲁棒学习异常检测

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。