Sparse Architectures For Text-independent Speaker Verification Using Deep Neural Networks

Abstract

Network pruning is of great importance due to the elimination of the unimportant weights or features activated due to the network over-parametrization. Advantages of sparsity enforcement include preventing the overfitting and speedup. Considering a large number of parameters in deep architectures, network compression becomes of critical importance due to the required huge amount of computational power. In this work, we impose structured sparsity for speaker verification which is the validation of the query speaker compared to the speaker gallery. We will show that the mere sparsity enforcement can improve the verification results due to the possible initial overfitting in the network.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keysedighi2018sparse

Related papers

• Rsknet-mtsp: Effective And Portable Deep Architecture For Speaker Verification (2021)9.03
• Dynamic Sparsity Neural Networks For Automatic Speech Recognition (2020)0.00
• Optimization Of Dnn-based Speaker Verification Model Through Efficient Quantization Technique (2024)0.00
• Model Compression For Dnn-based Speaker Verification Using Weight Quantization (2022)3.58
• Towards Lightweight Speaker Verification Via Adaptive Neural Network Quantization (2024)5.84
• Accurate And Structured Pruning For Efficient Automatic Speech Recognition (2023)7.81
• Speakernet: 1D Depth-wise Separable Convolutional Network For Text-independent Speaker Recognition And Verification (2020)0.00
• Memory-efficient Training For Deep Speaker Embedding Learning In Speaker Verification (2024)2.26