Cross-Task Affinity Learning for Multitask Dense Scene Predictions

Dimitrios Sinodinos, Narges Armanfard
1/20/2024
cs.CVcs.LG

No official code found. Best implementation: Armanfard-Lab/CTAL (11 stars, last commit 2025-06-12).

Abstract

Multitask learning (MTL) has become prominent for its ability to predict multiple tasks jointly, achieving better per-task performance with fewer parameters than single-task learning. Recently, decoder-focused architectures have significantly improved multitask performance by refining task predictions using features from related tasks. However, most refinement methods struggle to efficiently capture both local and long-range dependencies between task-specific representations and cross-task patterns. In this paper, we introduce the Cross-Task Affinity Learning (CTAL) module, a lightweight framework that enhances task refinement in multitask networks. CTAL effectively captures local and long-range cross-task interactions by optimizing task affinity matrices for parameter-efficient grouped convolutions without concern for information loss. Our results demonstrate state-of-the-art MTL performance for both CNN and transformer backbones, using significantly fewer parameters than single-task learning. Our code is publicly available at https://github.com/Armanfard-Lab/EMA-Net.

View on arXivView PDF

Code Implementations(1)

Armanfard-Lab/CTALCommunity100%

[WACV 2025] Cross-Task Affinity Learning for Multitask Dense Scene Predictions

111Shell, PythonJan 20, 20241 years agoNOASSERTION

Similar Papers

Cite this paper

@article{sinodinos2024crosstask,
  title  = {Cross-Task Affinity Learning for Multitask Dense Scene Predictions},
  author = {Dimitrios Sinodinos and Narges Armanfard},
  year   = {2024},
  eprint = {2401.11124},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.11124v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.11124.svg)](https://codeofpaper.com/paper/2401.11124)

Discussion