Bilevel Joint Unsupervised and Supervised Training for Automatic Speech Recognition

In this paper, we propose a bilevel joint unsupervised and supervised training (BL-JUST) framework for automatic speech recognition. Compared to the conventional pre-training and fine-tuning strategy which is a disconnected two-stage process, BL-JUST tries to optimize an acoustic model such that it simultaneously minimizes both the unsupervised and supervised loss functions. Because BL-JUST seeks matched local optima of both loss functions, acoustic representations learned by the acoustic model strike a good balance between being generic and task-specific. We solve the BL-JUST problem using penalty-based bilevel gradient descent and evaluate the trained deep neural network acoustic models on various datasets with a variety of architectures and loss functions. We show that BL-JUST can outperform the widely-used pre-training and fine-tuning strategy and some other popular semi-supervised techniques.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Audio Speech and Language Processing
Published
2024-12-23
DOI
https://doi.org/10.1109/taslp.2024.3519869
Citations
1
Primary Topic
Speech Recognition and Synthesis
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bilevel Joint Unsupervised and Supervised Training for Automatic Speech Recognition

Brian Kingsbury, A F M Saifuddin Saif, George Saon, Songtao Lu et al.
1 citations
IEEE Transactions on Audio Speech and Language Processing
Speech Recognition and Synthesis
0.35
article

Bilevel Joint Unsupervised and Supervised Training for Automatic Speech Recognition

Brian Kingsbury, A F M Saifuddin Saif, George Saon, Songtao Lu, Lisha Chen, Tianyi Chen, Xiaodong Cui
article en
1 citations

Abstract

In this paper, we propose a bilevel joint unsupervised and supervised training (BL-JUST) framework for automatic speech recognition. Compared to the conventional pre-training and fine-tuning strategy which is a disconnected two-stage process, BL-JUST tries to optimize an acoustic model such that it simultaneously minimizes both the unsupervised and supervised loss functions. Because BL-JUST seeks matched local optima of both loss functions, acoustic representations learned by the acoustic model strike a good balance between being generic and task-specific. We solve the BL-JUST problem using penalty-based bilevel gradient descent and evaluate the trained deep neural network acoustic models on various datasets with a variety of architectures and loss functions. We show that BL-JUST can outperform the widely-used pre-training and fine-tuning strategy and some other popular semi-supervised techniques.

IEEE Transactions on Audio Speech and Language ProcessingVol. 33
IBM (United States) (US), Rensselaer Polytechnic Institute (US)
Openalex Percentile: Top 30%
Speech Recognition and Synthesis
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Bilevel Joint Unsupervised and Supervised Training for Automatic Speech Recognition — Brian Kingsbury, A F M Saifuddin Saif, et al. · IEEE Transactions on Audio Speech and Language Processing (2024) | TGRS Research Map | TGRS