Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jiaheng Dong

dblp:409/9195 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Speech recognition and synthesis · 44% Transfer learning and domain adaptation · 44% Efficient and distributed learning · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis › speech pre-training
speech foundation models
0.912025
E-BATS: Efficient Backpropagation-Free Test-Time Adaptation for Speech Foundation Models · NeurIPS 2025
Machine learning › Transfer learning and domain adaptation
test-time adaptation
0.912025
E-BATS: Efficient Backpropagation-Free Test-Time Adaptation for Speech Foundation Models · NeurIPS 2025
Machine learning › Efficient and distributed learning › memory optimization
memory-efficient adaptation
0.312025
E-BATS: Efficient Backpropagation-Free Test-Time Adaptation for Speech Foundation Models · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

prompt adaptation · 0.9multi-scale loss · 0.9exponential moving average · 0.9
YearPublicationVenuePosition
2025 E-BATS: Efficient Backpropagation-Free Test-Time Adaptation for Speech Foundation Models
abstract
Speech Foundation Models encounter significant performance degradation when deployed in real-world scenarios involving acoustic domain shifts, such as background noise and speaker accents. Test-time adaptation (TTA) has recently emerged as a viable strategy to address such domain shifts at inference time without requiring access to source data or labels. However, existing TTA approaches, particularly those relying on backpropagation, are memory-intensive, limiting their applicability in speech tasks and resource-constrained settings. Although backpropagation-free methods offer improved efficiency, existing ones exhibit poor accuracy. This is because they are predominantly developed for vision tasks, which fundamentally differ from speech task formulations, noise characteristics, and model architecture, posing unique transferability challenges. In this paper, we introduce E-BAT, first Efficient BAckpropagation-free TTA framework designed explicitly for speech foundation models. E-BAT achieves a balance between adaptation effectiveness and memory efficiency through three key components: (i) lightweight prompt adaptation for a forward-pass-based feature alignment, (ii) a multi-scale loss to capture both global (utterance-level) and local distribution shifts (token-level) and (iii) a test-time exponential moving average mechanism for stable adaptation across utterances. Experiments conducted on four noisy speech datasets spanning sixteen acoustic conditions demonstrate consistent improvements, with 4.1\%--13.5% accuracy gains over backpropogation-free baselines and 2.0$\times$–6.4$\times$ GPU memory savings compared to backpropogation-based methods. By enabling scalable and robust adaptation under acoustic variability, this work paves the way for developing more efficient adaptation approaches for practical speech processing systems in real-world environments.
Jiaheng Dong, Hong Jia, Soumyajit Chatterjee, Abhirup Ghosh, Ting Dang
NeurIPS1