A unified benchmark shows DNN-supported Kalman filters for acoustic echo cancellation converge faster and cancel more echo than the classical FDKF, with per-bin methods best preserving near-end speech.
Scaling Up Adaptive Filter Optimizers
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We introduce a new online adaptive filtering method called supervised multi-step adaptive filters (SMS-AF). Our method uses neural networks to control or optimize linear multi-delay or multi-channel frequency-domain filters and can flexibly scale-up performance at the cost of increased compute -- a property rarely addressed in the AF literature, but critical for many applications. To do so, we extend recent work with a set of improvements including feature pruning, a supervised loss, and multiple optimization steps per time-frame. These improvements work in a cohesive manner to unlock scaling. Furthermore, we show how our method relates to Kalman filtering and meta-adaptive filtering, making it seamlessly applicable to a diverse set of AF tasks. We evaluate our method on acoustic echo cancellation (AEC) and multi-channel speech enhancement tasks and compare against several baselines on standard synthetic and real-world datasets. Results show our method performance scales with inference cost and model capacity, yields multi-dB performance gains for both tasks, and is real-time capable on a single CPU core.
citation-role summary
citation-polarity summary
fields
eess.AS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Neural Kalman Filters for Acoustic Echo Cancellation
A unified benchmark shows DNN-supported Kalman filters for acoustic echo cancellation converge faster and cancel more echo than the classical FDKF, with per-bin methods best preserving near-end speech.