paper-with-me

Papers

Neural i-vectors

2020-04-03 · Ville Vestman, Kong Aik Lee, Tomi H. Kinnunen

Deep speaker embeddings have been demonstrated to outperform their generative counterparts, i-vectors, in recent speaker verification evaluations. To combine the benefits of high performance and generative interpretation, we investigate the use of deep embedding extractor and i-vector extractor in succession. To bundle the deep embedding extractor with an i-vector extractor, we adopt aggregation layers inspired by the Gaussian mixture model (GMM) to the embedding extractor networks. The inclusion of GMM-like layer allows the discriminatively trained network to be used as a provider of sufficient statistics for the i-vector extractor to extract what we call neural i-vectors. We compare the deep embeddings to the proposed neural i-vectors on the Speakers in the Wild (SITW) and the Speaker Recognition Evaluation (SRE) 2018 and 2019 datasets. On the core-core condition of SITW, our deep embeddings obtain performance comparative to the state-of-the-art. The neural i-vectors obtain about 50% worse performance than the deep embeddings, but on the other hand outperform the previous i-vector approaches reported in the literature by a clear margin.

📄 PDF Abstract BibTeX arXiv:2004.01559

Code (0)

등록된 구현이 없습니다.

Tasks

Speaker RecognitionSpeaker Verification

Similar Papers 제목 키워드 기반

Can sparse autoencoders be used to decompose and interpret steering vectors?

2024-11-13 · Harry Mayne, Yushi Yang, Adam Mahdi

Steering vectors are a promising approach to control the behaviour of large language models. However, their underlying mechanisms remain poorly understood. While sparse autoencoders (SAEs) may offer a potential method to…

MOEA/D with Adaptative Number of Weight Vectors

2021-09-13 · Yuri Lavinas, Abe Mitsu Teru, Yuta Kobayashi, Claus Aranha

The Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is a popular algorithm for solving Multi-Objective Problems (MOPs). The main component of MOEA/D is to decompose a MOP into easier sub-problems u…

Refining Pretrained Word Embeddings Using Layer-wise Relevance Propagation

2018-10-01 · EMNLP 2018 10 · Akira Utsumi

In this paper, we propose a simple method for refining pretrained word embeddings using layer-wise relevance propagation. Given a target semantic representation one would like word vectors to reflect, our method first tr…

Binary ClassificationGeneral ClassificationWord Embeddings

Word and Document Embedding with vMF-Mixture Priors on Context Word Vectors

2019-07-01 · ACL 2019 7 · Shoaib Jameel, Steven Schockaert

Word embedding models typically learn two types of vectors: target word vectors and context word vectors. These vectors are normally learned such that they are predictive of some word co-occurrence statistic, but they ar…

Document Embedding

A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm

2019-02-11 · Chi Jin, Praneeth Netrapalli, Rong Ge, Sham M. Kakade 외

In this note, we derive concentration inequalities for random vectors with subGaussian norm (a generalization of both subGaussian random vectors and norm bounded random vectors), which are tight up to logarithmic factors…