CVOct 13, 2022

Composite Learning for Robust and Effective Dense Predictions

ETH Zurich
arXiv:2210.07239v14 citationsh-index: 191
Originality Incremental advance
AI Analysis

This work addresses the labeling burden in multi-task learning for computer vision researchers, offering a practical solution that improves model performance and robustness, though it is incremental as it builds on existing self-supervised and multi-task learning concepts.

The paper tackles the problem of multi-task learning requiring additional labeling for auxiliary tasks by proposing Composite Learning (CompL), which jointly trains a dense prediction task with a self-supervised auxiliary task, resulting in consistent performance improvements across tasks like depth estimation and semantic segmentation without needing extra labels.

Multi-task learning promises better model generalization on a target task by jointly optimizing it with an auxiliary task. However, the current practice requires additional labeling efforts for the auxiliary task, while not guaranteeing better model performance. In this paper, we find that jointly training a dense prediction (target) task with a self-supervised (auxiliary) task can consistently improve the performance of the target task, while eliminating the need for labeling auxiliary tasks. We refer to this joint training as Composite Learning (CompL). Experiments of CompL on monocular depth estimation, semantic segmentation, and boundary detection show consistent performance improvements in fully and partially labeled datasets. Further analysis on depth estimation reveals that joint training with self-supervision outperforms most labeled auxiliary tasks. We also find that CompL can improve model robustness when the models are evaluated in new domains. These results demonstrate the benefits of self-supervision as an auxiliary task, and establish the design of novel task-specific self-supervised methods as a new axis of investigation for future multi-task learning research.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes