mlsanityData to 14 Oct 2026

Adaptive Approach For Sparse Representations Using The Locally Competitive Algorithm For Audio

arXiv 2109.14705 ↗First posted 29 Sep 2021cs.SD cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Gammachirp filterbank has been used to approximate the cochlea in sparse coding algorithms. An oriented grid search optimization was applied to adapt the gammachirp's parameters and improve the Matching Pursuit (MP) algorithm's sparsity along with the reconstruction quality. However, this combination of a greedy algorithm with a grid search at each iteration is computationally demanding and not suitable for real-time applications. This paper presents an adaptive approach to optimize the gammachirp's parameters but in the context of the Locally Competitive Algorithm (LCA) that requires much fewer computations than MP. The proposed method consists of taking advantage of the LCA's neural architecture to automatically adapt the gammachirp's filterbank using the backpropagation algorithm. Results demonstrate an improvement in the LCA's performance with our approach in terms of sparsity, reconstruction quality, and convergence time. This approach can yield a significant advantage over existing approaches for real-time applications.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 2 of its 20 references that are in the map. First posted on arXiv 29 Sep 2021.

Builds on

2 of 20 references.

References · 2

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2019The Heidelberg spiking datasets for the systematic evaluation of spiking neural networkscited by 137

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.