Optimal Multi-Task Learning at Regularization Horizon for Speech Translation Task

JungHo Jung, Junhyun Lee
9/4/2025
cs.CL

No confident code implementation found for this paper.

Abstract

End-to-end speech-to-text translation typically suffers from the scarcity of paired speech-text data. One way to overcome this shortcoming is to utilize the bitext data from the Machine Translation (MT) task and perform Multi-Task Learning (MTL). In this paper, we formulate MTL from a regularization perspective and explore how sequences can be regularized within and across modalities. By thoroughly investigating the effect of consistency regularization (different modality) and R-drop (same modality), we show how they respectively contribute to the total regularization. We also demonstrate that the coefficient of MT loss serves as another source of regularization in the MTL setting. With these three sources of regularization, we introduce the optimal regularization contour in the high-dimensional space, called the regularization horizon. Experiments show that tuning the hyperparameters within the regularization horizon achieves near state-of-the-art performance on the MuST-C dataset.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jung2025optimal,
  title  = {Optimal Multi-Task Learning at Regularization Horizon for Speech Translation Task},
  author = {JungHo Jung and Junhyun Lee},
  year   = {2025},
  eprint = {2509.09701},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.09701v1}
}

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/2509.09701.svg)](https://codeofpaper.com/paper/2509.09701)

Discussion