0% found this document useful (0 votes)
9 views5 pages

Reshape Dimensions Network for Speaker Recognition

ReDimNet
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views5 pages

Reshape Dimensions Network for Speaker Recognition

ReDimNet
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Reshape Dimensions Network for Speaker Recognition

Ivan Yakovlev, Rostislav Makarov, Andrei Balykin, Pavel Malov, Anton Okhotnikov,
Nikita Torgashov

ID R&D Inc., New York, USA


{yakovlev,makarov,[Link],[Link],ohotnikov,torgashov}@[Link]

Abstract
In this paper, we present Reshape Dimensions Network
(ReDimNet), a novel neural network architecture for extract-
arXiv:2407.18223v2 [[Link]] 25 Sep 2024

ing utterance-level speaker representations. Our approach lever-


ages dimensionality reshaping of 2D feature maps to 1D signal
representation and vice versa, enabling the joint usage of 1D
and 2D blocks. We propose an original network topology that
preserves the volume of channel-timestep-frequency outputs of
1D and 2D blocks, facilitating efficient residual feature maps
aggregation. Moreover, ReDimNet is efficiently scalable, and
we introduce a range of model sizes, varying from 1 to 15 M
parameters and from 0.5 to 20 GMACs. Our experimental re-
sults demonstrate that ReDimNet achieves state-of-the-art per-
formance in speaker recognition while reducing computational
complexity and the number of model parameters.
Index Terms: speaker recognition, speaker verification, speech
processing, ReDimNet

1. Introduction
Speaker recognition is a specialized field aiming at identifying
or verifying individuals through their distinct voice features.
In this domain, deep neural networks have emerged as a ma-
jor technology for extracting speaker embeddings that are used
for multiple tasks including Speaker Verification (SV), Speaker
Identification, Speaker Diarization, and others. Extensive re-
search has been conducted in the SV area, which includes the Fig. 1 Computational Cost vs. Average Equal Error Rate.
development of new datasets [1–4], model architecture design- EER is averaged over three Voxceleb1 protocols: Vox1-O,
ing [5–18], and inventing new loss functions [19, 20]. Vox1-E, Vox1-H. The model size is shown by the area of a cir-
A variety of architectures have emerged including 1D [5–7, cle, model family is indicated by a color. Complexity is as-
9, 10] and 2D [14–18] convolutional neural networks (CNNs), sessed using thop library with an input signal of 2 seconds. A
their hybrids that incorporate 2D CNN stem before 1D TDNN- short dashed line represents scaling the ReDimNet architecture
like backbone [8,11,13], as well as self-attention networks [12]. using the Additive Angular Margin loss function [19], dashed
Each architectural approach brings its unique set of advantages line - using the SphereFace2 loss [20].
with 1D models offering efficiency and direct temporal analy-
sis, 2D architectures providing frequency translational invari-
ance [21], and hybrid systems aiming to deliver the best of both ing optimal performance under varying computational resource
worlds. Additionally, design approaches can be split into macro constraints. Our experimental results demonstrate that ReDim-
and micro designs, with micro designs involving modifications Net outperforms many other architectures and achieves state-
like substituting traditional 1D ResBlocks with Res2Net blocks of-the-art performance on public benchmarks while reducing
within the ECAPA-TDNN architecture [6], and macro designs inference time and model size.
incorporating a 2D stem ahead of TDNN-like models [8,11,13]
leading to a two-stage architecture that transitions 2D −
→ 1D. 2. Model Architecture
In this paper, we introduce ReDimNet1 , a novel neural net-
work architecture based on the dimensionality reshaping of fea- In this section, we detail the design of the proposed architecture
ture maps between 2D and 1D representations, enabling seam- influenced by two main concepts. Firstly, to leverage the bene-
less integration of 1D and 2D blocks. ReDimNet exhibits scal- fits of residual connections, we incorporate them extensively in
ability across various model sizes, while consistently achiev- ReDimNet. Secondly, based on the success of models utilizing
both 1D and 2D blocks for speech processing and SV, our ar-
1 [Link] chitecture integrates both types of blocks to boost performance.
Fig. 2 ReDimNet architecture scheme. Digits 1,2,3 and 4 describe the order of operators and blocks execution in a single model stage,
where C - number of channels, F - number of frequency bins, T - number of timestamps.

2.1. Dimensions reshape & residual connection 2.2. 1D & 2D Blocks


The main distinguishable feature of the architecture is an ability ReDimNet is created around the use of joint 1D and 2D
to aggregate 1D and 2D feature maps together with 2D feature blocks, which are presented correspondingly by Block 1D
maps from other model stages to enable 1D-2D and 2D-2D skip and Block 2D in the scheme in Fig. 2. These blocks are
connections with various feature maps shapes. Such a technique designed to handle 1D feature maps of fixed size, which are
is implemented only using the reshape operation without broad- then reshaped into 2D feature maps for processing within the
casting or dimensionality reduction/expansion. We constrain block. The structure of these blocks makes possible dynamic
ReDimNet to output feature maps with predefined shapes, that interchange between 2D and 1D representations: 2D subblocks
are easily reshaped back and forth between fixed 1D represen- process 2 the reshaped (in 1 ) 1D inputs using sequences
tation and various sets of 2D representations. First, we mitigate of residual blocks with 2D convolutions, and then the output is
all strides across the time axis in a model, meaning that in the converted back to a 1D format 3 for further processing in the
end, before pooling, the model will have the same time resolu- 1D subblock 4 . This 1D subblock employs a channel-axis
tion as input features. Second, we synchronize strides over fre- dimensionality reduction Fully Connected (FC) layer + normal-
quency dimension with a growth rate of channels for all stages, ization layer, followed by a time-contextual processing compo-
to make a ”volume” of 2D feature maps constant throughout nent. This component can be implemented through ConvNeXt-
model forward pass. Given that, if all 2D feature maps are rep- like 1D blocks, transformer encoder blocks, or a combination of
resented by the tensors with common PyTorch [22] size notation them, and its output is a 1D feature map. Finally, the channel-
(s0 = batch size : bs, s1 = channels : C, s2 = f requncy : axis expansion FC layer unfolds the number of channels to
F, s3 = time : T ), we assign volume of 2D feature map as match input shape and performs skip+residual sum operation.
V = s1 · s2 · s3 . This property of ReDimNet architecture is More information on the basic blocks structure used in ReDim-
well illustrated in the model scheme (Fig. 2) and in the Table 1 Net is provided in Fig. 3.
presenting the internal feature map size for each block.
2.3. Input features & pooling
Table 1 Model internal feature map sizes. Sf stands for fre-
quency stride. As model input features we used 72-dimensional mean-
normalized Mel filter bank log-energies with a 25 ms frame
Block # In shape Sf Channels Out shape Volume length and 15 ms step with 512 FFT size over the 20-7600 Hz
1 (C, F, T ) 1 C (C, F, T ) frequency range by default. To extract an utterance-level em-
2 (C, F, T ) 2 C ·2 (C · 2, F/2, T ) bedding from the frame-level features, we utilized the Attentive
3 (C · 2, F/2, T ) 2 C ·4 (C · 4, F/4, T ) C ·F ·T
4 (C · 4, F/4, T ) 2 C ·8 (C · 8, F/8, T )
Statistics Pooling [23] with global context.
5 (C · 8, F/8, T ) 1 C ·8 (C · 8, F/8, T )

Having the same volume in all 2D feature maps is not yet


3. Experimental Setup
enough to sum them right away to enable skip connections due We conducted experiments of training ReDimNet architecture
to the shape mismatch. However, this can be easily overcome by utilizing the development part of the VoxCeleb2 [1] dataset.
an introduction of invertible reshape operator that reshapes all Models were optimized using SGD optimizer with Nesterov
2D feature maps of size (bs, Ci , Fi , T ) into 1D feature map of momentum, m = 0.9, and a weight decay of 2e−5 . As a default
constant size: (bs, Ci ·Fi , T ) = (bs, C0 ·F0 , T ), where C0 = C loss function, we selected Additive Angular Margin (AAM)
and F0 = F . This equality is constant for various stages out- softmax loss [19] due to its wide adoption. We also conducted
puts due to the model strides and channels growth constraints. and reported results for a few experiments with SphereFace2
Then we sum 1D feature maps and reshape them back to 2D (SF2) loss function [20] for comparison purposes. We followed
using the inverse reshape operator, this way we enable residual a 2-stage training approach by firstly pretraining a model on
connection through the whole model forward pass. short segments with multiple augmentations applied. Then, we
4. Model scaling & ablation studies
4.1. Model scaling
Achieving efficient model scaling was one of our main research
goals. Therefore, we were able to scale the ReDimNet architec-
ture from (1M, 0.5 GMACs) to (15M, 20 GMACs), reaching
competitive results for each model size. For the naming con-
vention, we followed notations of [34], resulting in 7 configura-
tions: B0 - B6, where each model configuration is bounded by
the computational complexity limits in GMACs that we found
to be a predominant factor of model scaling relative to model
size. Complete testing results of each ReDimNet configuration
are shown in Table 4.

Table 2 Ablation Study on Block Components of ReDimNet


(EER, %)

Block Type Vox1-O Vox1-E Vox1-H Average


Fig. 3 Block design. In ReDimNet as 2D blocks we used (a) Skip Connection 1.59 1.57 2.71 1.96
slightly modified ConvNeXt-like block [29] or (b) basic ResNet Fully Connected 0.93 1.13 1.94 1.33

1D block
block [30] with fwSE [21]. As 1D blocks we used same (a) 1D 1D Conv 0.65 0.85 1.54 1.01
version of ConvNeXt-like block with or inplace of (c) Trans- MHA 0.69 0.82 1.45 0.99
1D Conv + MHA 0.59 0.79 1.47 0.95
former block [31]. ConvNext block 0.68 0.83 1.46 0.99
2D block fwse-ResNet block 0.64 0.82 1.48 0.98
ResNet block 0.61 0.80 1.48 0.96
applied finetuning on longer utterances with some augmenta-
tions turned off and tweaked the parameters of a loss function.
This second training stage is well-known as Large-Margin (LM) 4.2. Ablation studies
finentuning strategy [24]. All models were trained using the We also conducted a thorough study of how different compo-
wespeaker [25] training pipeline. nents of ReDimNet architecture affect its performance. This
research includes studying the role of 1D and 2D blocks for
3.1. Pretraining stage speech signal processing, assessing the impact of different loss
functions, and optimizing group sizes and steps in convolutions
For pretraining, we used a default voxceleb2 recipe from for accuracy and efficiency improvement. All ablation studies
wespeaker pipeline with minor adjustments. 2-second seg- were carried out on the ReDimNet-B2 architecture.
ments were selected randomly from each signal, and various
augmentations with MUSAN dataset [26] (noise, music, bab- Table 3 Ablation study on loss function configuration (EER,%)
ble) alongside the RIR dataset [27] were applied following the
augmentation recipe from [14]. A two-fold speed augmenta- Loss Type Vox1-O Vox1-E Vox1-H Average
tion [28], with factors of 0.9 and 1.1, was employed to generate AAM-SC 0.57 0.91 1.60 1.03
additional speakers within the training dataset. In this stage, the AAM 0.68 0.83 1.46 0.99
AAM-softmax margin penalty was scheduled as follows: first SF2-A 0.63 0.80 1.39 0.94
20 epochs it was kept at 0.0, then for the next 20 epochs it ex- SF2-C 0.57 0.76 1.32 0.88
ponentially rose to 0.2 and then was kept constant till the end
of training. We used Exponential Decay with Warmup learn-
ing rate scheduler with 6 epochs warmup, lrmax = 1e−1 and 4.2.1. Block types
lrmin = 1e−5 . In order to identify optimal configurations of ReDimNet archi-
tecture, we compared three types of 2D-blocks: basic ResNet
3.2. Large-Margin Finetuning stage block, basic ResNet FWSE block, and a ConvNext block.
While minimal differences were observed, basic ResNet block,
At the finetuning stage [24], AAM-softmax margin was set to however, slightly outperformed others by a small margin (see
constant 0.5 value, with length of training utterances expanded Table 2).
to 6 seconds. Speed perturbations were turned off during this Our further analysis was focused on the 1D block type,
stage. where we assessed a range of options including sequences of 1D
convolutional ConvNeXt-like blocks (Fig. 3), multi-head atten-
3.3. Evaluation tion (MHA) (Fig. 3), FC layers, skip connections, and a hybrid
of 1D convolutional blocks with MHA (1D Conv + MHA). Skip
The performance of models is assessed using cleaned protocols connections appeared to be the least effective approach, which
of VoxCeleb1 [32] test set, employing the Equal Error Rate underscored the importance of the 1D block within the ReD-
(EER) and the minimum Detection Cost Function (minDCF) imNet architecture. FC layers performed slightly better, sug-
with Ptarget = 0.01 and CF A = CM iss = 1. We scored each gesting the importance of a temporal context. 1D convolutional
model with cosine backend utilizing full utterance length as in- and MHA blocks have proven to be the most efficient configura-
put and additionally applied a top-300 adaptive s-normalization tions, and a combination of MHA and 1D convolutional blocks
(AS-Norm) [33] of cosine scores (see Table 4). delivered the best performance (see Table 2).
Table 4 Evaluation results on the VoxCeleb1-Cleaned protocols without QMFs. For the report, we calculated the equal error rate
(EER) and the minimum detection cost function (minDCF). GMACs were measured on 2-s long segments. * - means values have been
estimated. Open source models from the WeSpeaker or ECAPA2 repositories were retested in our environment.

Vox1-O Vox1-E Vox1-H


Model Params GMACs LM AS-Norm EER(%) minDCF EER(%) minDCF EER(%) minDCF
ReDimNet-B0 ✓ ✗ 1.16 0.101 1.25 0.132 2.20 0.207
+AS-Norm 1.0M 0.43 ✓ ✓ 1.07 0.098 1.18 0.121 2.01 0.184
NeXt-TDNN-l (C=128, B=3) [7] 1.6M 0.29* ✗ ✓ 1.10 0.108 1.24 0.133 2.12 0.201
NeXt-TDNN (C=128, B=3) [7] 1.9M 0.35* ✗ ✓ 1.03 0.095 1.17 0.126 1.98 0.190
ReDimNet-B1 ✓ ✗ 0.85 0.076 0.97 0.104 1.73 0.166
+AS-Norm 2.2M 0.54 ✓ ✓ 0.73 0.071 0.89 0.096 1.57 0.154
ECAPA (C=512) [6, 17] 6.4M 1.05 ✗ ✓ 0.94 0.092 1.21 0.129 2.20 0.205
NeXt-TDNN-l (C=256, B=3) [7] 6.0M 1.13* ✗ ✓ 0.81 0.091 1.04 0.116 1.86 0.184
CAM++ [11, 25] 7.2M 1.15 ✓ ✗ 0.71 0.109 0.85 0.095 1.66 0.165
NeXt-TDNN (C=256, B=3) [7] 7.1M 1.35* ✗ ✓ 0.79 0.087 1.04 0.115 1.82 0.182
ReDimNet-B2SF 2 ✓ ✗ 0.57 0.054 0.76 0.082 1.32 0.133
+AS-Norm 4.7M 0.90 ✓ ✓ 0.52 0.060 0.74 0.078 1.27 0.128
ECAPA (C=1024) [6, 17] 14.9M 2.67 ✓ ✗ 0.98 0.105 1.13 0.117 2.09 0.204
DF-ResNet56 [17] 4.5M 2.66 ✗ ✓ 0.96 0.103 1.09 0.122 1.99 0.184
Gemini DF-ResNet60 [18] 4.1M 2.50* ✗ ✓ 0.94 0.089 1.05 0.116 1.80 0.166
ReDimNet-B3 ✓ ✗ 0.50 0.063 0.73 0.079 1.33 0.135
+AS-Norm 3.0M 3.00 ✓ ✓ 0.47 0.042 0.69 0.072 1.23 0.121
ResNet34 [25, 30] 6.6M 4.55 ✓ ✗ 0.82 0.080 0.93 0.104 1.68 0.161
Gemini DF-ResNet114 [18] 6.5M 5.00 ✗ ✓ 0.69 0.067 0.86 0.097 1.49 0.144
ReDimNet-B4 ✓ ✗ 0.51 0.052 0.68 0.073 1.26 0.123
+AS-Norm 6.3M 4.80 ✓ ✓ 0.44 0.042 0.64 0.067 1.17 0.111
Gemini DF-ResNet183 [18] 9.2M 8.25 ✗ ✓ 0.60 0.064 0.81 0.090 1.44 0.137
DF-ResNet233 [17] 12.3M 11.17 ✗ ✓ 0.58 0.044 0.76 0.083 1.44 0.146
ReDimNet-B5SF 2 ✓ ✗ 0.43 0.039 0.61 0.062 1.08 0.102
+AS-Norm 9.2M 9.87 ✓ ✓ 0.39 0.037 0.59 0.057 1.05 0.095
ResNet293 [25, 30] 23.8M 28.10 ✓ ✗ 0.53 0.057 0.71 0.072 1.30 0.127
ECAPA2 [13] 27.1M 187.00* ✓ ✗ 0.44 0.041 0.62 0.066 1.15 0.114
ReDimNet-B6SF 2 ✓ ✗ 0.40 0.033 0.55 0.052 1.05 0.104
+AS-Norm 15.0M 20.27 ✓ ✓ 0.37 0.030 0.53 0.051 1.00 0.097

4.2.2. Loss studies Table 5 Evaluation results on Speakers In The Wild core-core
protocol [35], VOiCES from a Distance Challenge Evaluation
Furthermore, we explored the effectiveness of various loss func- Set [36] and VoxCeleb1-B protocol [37] (EER, %).
tions (see Table 3). Specifically, we evaluated SphereFace
losses (SF2) with A and C configurations [20], Additive Angu- Model SITW VOiCES Vox1-B Average
lar Margin Loss (AAM), and Additive Angular Margin loss with CAM++ 1.34 6.30 2.79 3.48
SubCenters (AAM-SC) [19]. Based on the testing results, we ECAPA (C=1024) 1.67 5.31 3.48 3.49
found SphereFace type C to be the most effective loss function ResNet293 1.67 5.14 2.23 3.01
providing the largest performance improvement in the bench- ECAPA2 3.64 13.26 1.81 6.24
marks. ReDimNet-B6 0.77 3.19 1.66 1.87

5. Results 6. Conclusions
Testing results of all proposed ReDimNet architecture config- In this paper we introduced ReDimNet - a novel neural net-
urations are presented in Table 4. We compared ReDimNet work architecture designed for the extraction of utterance-level
on the VoxCeleb1 protocols with publicly available models and speaker representations. It combines dimensionality reshap-
grouped them based on the number of parameters and multiply- ing, dynamic transitions between 1D and 2D representations,
accumulate operations (MACs) for comparison purposes. and 2D and 1D blocks. Through a comprehensive evaluation,
ReDimNet demonstrated:
In particular, our ReDimNet-B1 model achieves compara-
ble results to NeXt-TDNN [7] on the Vox1-H protocol, but has • architecture adaptability and scalability across multiple
a slightly larger number of parameters and MACs. ReDimNet- configurations;
B3 outperforms Gemini DF-ResNet60 [18] and ECAPA (C = • top balance between computational efficiency and perfor-
1024) with an advantage in model size. ReDimNet-B5 further mance;
improves upon the B3 version, consistently achieving the low- • strong results on the VoxCeleb1-H (cleaned) protocol, with
est EER and minDCF, compared to DF-ResNet233 [17], which an Equal Error Rate (EER) of 1.00%;
has the similar number of parameters and MACs. Moreover, our • advanced generalization ability on out-of-domain test sets.
largest model, ReDimNet-B6, delivers even better results while
In summary, ReDimNet architecture achieves competitive
having significantly fewer parameters and MACs than ECAPA
performance on all tests compared to other state-of-the-art
2 [13] and ResNet293 [25, 30].
speaker recognition models, while also offering favorable com-
Furthermore, we subjected the best models of various archi- putational efficiency. Its adaptability and superior performance
tectures to additional out-of-domain testing (see Table 5). These make it a valuable contribution to the speaker recognition field
results demonstrate that ReDimNet-B6 outperforms other archi- and a promising solution for real-world applications.
tectures with a significant gap on unseen data domains.
7. References [21] J. Thienpondt, B. Desplanques, and K. Demuynck, “Integrating
frequency translational invariance in tdnns and frequency posi-
[1] J. S. Chung, A. Nagrani, and A. Zisserman, “Voxceleb2: Deep tional information in 2d resnets to enhance speaker verification,”
speaker recognition,” in Interspeech 2018. ISCA, Sep. 2018. arXiv preprint arXiv:2104.02370, 2021.
[2] Y. Lin, X. Qin, G. Zhao, M. Cheng, N. Jiang, H. Wu, and M. Li, [22] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan,
“Voxblink: A large scale speaker verification dataset on camera,” T. Killeen, Z. Lin, N. Gimelshein, L. Antiga et al., “Pytorch:
2023. An imperative style, high-performance deep learning library,” Ad-
[3] S. Zheng, L. Cheng, Y. Chen, H. Wang, and Q. Chen, “3d-speaker: vances in neural information processing systems, vol. 32, 2019.
A large-scale multi-device, multi-distance, and multi-dialect cor- [23] K. Okabe, T. Koshinaka, and K. Shinoda, “Attentive statis-
pus for speech representation disentanglement,” 2023. tics pooling for deep speaker embedding,” in Interspeech 2018.
[4] I. Yakovlev, A. Okhotnikov, N. Torgashov, R. Makarov, Y. Vo- ISCA, Sep. 2018.
evodin, and K. Simonchik, “VoxTube: a multilingual speaker [24] Y. Liu, L. He, and J. Liu, “Large margin softmax loss for speaker
recognition dataset,” in Proc. INTERSPEECH 2023, 2023, pp. verification,” arXiv preprint arXiv:1904.03479, 2019.
2238–2242.
[25] H. Wang, C. Liang, S. Wang, Z. Chen, B. Zhang, X. Xiang,
[5] D. Snyder, D. Garcia-Romero, G. Sell, D. Povey, and S. Khudan- Y. Deng, and Y. Qian, “Wespeaker: A research and production
pur, “X-vectors: Robust dnn embeddings for speaker recognition,” oriented speaker embedding learning toolkit,” in ICASSP 2023-
in 2018 IEEE International Conference on Acoustics, Speech and 2023 IEEE International Conference on Acoustics, Speech and
Signal Processing (ICASSP), 2018, pp. 5329–5333. Signal Processing (ICASSP). IEEE, 2023, pp. 1–5.
[6] B. Desplanques, J. Thienpondt, and K. Demuynck, “Ecapa- [26] D. Snyder, G. Chen, and D. Povey, “Musan: A music, speech, and
tdnn: Emphasized channel attention, propagation and ag- noise corpus,” arXiv preprint arXiv:1510.08484, 2015.
gregation in tdnn based speaker verification,” arXiv preprint
arXiv:2005.07143, 2020. [27] I. Szöke, M. Skácel, L. Mošner, J. Paliesek, and J. Černockỳ,
“Building and evaluation of a real room impulse response
[7] H.-J. Heo, U.-H. Shin, R. Lee, Y. Cheon, and H.-M. Park, “Next- dataset,” IEEE Journal of Selected Topics in Signal Processing,
tdnn: Modernizing multi-scale temporal convolution backbone vol. 13, no. 4, pp. 863–876, 2019.
for speaker verification,” 2023.
[28] T. Ko, V. Peddinti, D. Povey, and S. Khudanpur, “Audio augmen-
[8] T. Liu, R. K. Das, K. A. Lee, and H. Li, “Mfa: Tdnn with multi- tation for speech recognition.” in Interspeech, vol. 2015, 2015, p.
scale frequency-channel attention for text-independent speaker 3586.
verification with short utterances,” 2022.
[29] Z. Liu, H. Mao, C.-Y. Wu, C. Feichtenhofer, T. Darrell, and S. Xie,
[9] Z. Zhao, Z. Li, W. Wang, and P. Zhang, “Pcf: Ecapa-tdnn with “A convnet for the 2020s,” 2022.
progressive channel fusion for speaker verification,” 2023.
[30] K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning
[10] Y.-Q. Yu and W.-J. Li, “Densely connected time delay neural net- for image recognition,” in 2016 IEEE Conference on Computer
work for speaker verification,” in Annual Conference of the Inter- Vision and Pattern Recognition (CVPR), 2016, pp. 770–778.
national Speech Communication Association (INTERSPEECH),
2020, pp. 921–925. [31] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N.
Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,”
[11] H. Wang, S. Zheng, Y. Chen, L. Cheng, and Q. Chen, “CAM++: 2023.
A Fast and Efficient Network for Speaker Verification Using
Context-Aware Masking,” in Proc. INTERSPEECH 2023, 2023, [32] A. Nagrani, J. S. Chung, W. Xie, and A. Zisserman, “Voxceleb:
pp. 5301–5305. Large-scale speaker verification in the wild,” Computer Science
and Language, 2019.
[12] Y. Zhang, Z. Lv, H. Wu, S. Zhang, P. Hu, Z. Wu, H. yi Lee, and
H. Meng, “Mfa-conformer: Multi-scale feature aggregation con- [33] S.-C. Yin, R. Rose, and P. Kenny, “Adaptive score normalization
former for automatic speaker verification,” 2022. for progressive model adaptation in text independent speaker ver-
ification,” in 2008 IEEE International Conference on Acoustics,
[13] J. Thienpondt and K. Demuynck, “Ecapa2: A hybrid neural net- Speech and Signal Processing, 2008, pp. 4857–4860.
work architecture and training strategy for robust speaker embed-
dings,” 2024. [34] M. Tan and Q. V. Le, “Efficientnet: Rethinking model scaling for
convolutional neural networks,” 2020.
[14] D. Garcia-Romero, G. Sell, and A. Mccree, “Magneto: X-vector
magnitude estimation network plus offset for improved speaker [35] M. McLaren, L. Ferrer, D. Castan, and A. Lawson, “The speakers
recognition.” in Odyssey, 2020, pp. 1–8. in the wild (sitw) speaker recognition database.” in Interspeech,
2016, pp. 818–822.
[15] T. Zhou, Y. Zhao, and J. Wu, “Resnext and res2net structures for
speaker verification,” 2020. [36] M. K. Nandwana, J. van Hout, M. McLaren, C. Richey, A. Law-
son, and M. A. Barrios, “The voices from a distance challenge
[16] Y. Chen, S. Zheng, H. Wang, L. Cheng, Q. Chen, and J. Qi, 2019 evaluation plan,” 2019.
“An Enhanced Res2Net with Local and Global Feature Fusion for
Speaker Verification,” in Proc. INTERSPEECH 2023, 2023, pp. [37] K. Nam, Y. Kim, J. Huh, H. S. Heo, J. weon Jung, and J. S. Chung,
2228–2232. “Disentangled representation learning for multilingual speaker
recognition,” 2023.
[17] B. Liu, Z. Chen, S. Wang, H. Wang, B. Han, and Y. Qian, “DF-
ResNet: Boosting Speaker Verification Performance with Depth-
First Design,” in Proc. Interspeech 2022, 2022, pp. 296–300.
[18] T. Liu, K. A. Lee, Q. Wang, and H. Li, “Golden gemini is all you
need: Finding the sweet spots for speaker verification,” 2023.
[19] J. Deng, J. Guo, N. Xue, and S. Zafeiriou, “Arcface: Additive
angular margin loss for deep face recognition,” in Proceedings of
the IEEE/CVF conference on computer vision and pattern recog-
nition, 2019, pp. 4690–4699.
[20] B. Han, Z. Chen, and Y. Qian, “Exploring binary classification
loss for speaker verification,” in ICASSP 2023 - 2023 IEEE Inter-
national Conference on Acoustics, Speech and Signal Processing
(ICASSP), 2023, pp. 1–5.

You might also like