arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.07084cs.CLcs.AI
收藏

Q-上下文中词嵌入的快速提取

Fast Extraction of Word Embedding from Q-contexts

South China University of Technology(华南理工大学);University of Cambridge(剑桥大学);Tencent Quantum Lab(腾讯量子实验室);Tsinghua University(清华大学)

Junsheng Kong, Weizhao Li, Zeyi Liu, Ben Liao, Jiezhong Qiu, Chang-Yu Hsieh, Yi Cai, Shengyu Zhang

摘要:

词嵌入的概念在自然语言处理(NLP)中起着基础性的作用。然而,对于大多数现有方法来说,针对非常大规模的词汇的预训练词嵌入在计算上是具有挑战性的。在这项工作中,我们表明,只有一小部分的上下文(Q-上下文),这是典型的在整个语料库(和他们的互信息与单词),可以构建高质量的词嵌入可以忽略不计的错误。将上下文和词之间的互信息规范地编码为采样状态,从而可以快速构造Q-上下文。此外,我们提出了一个高效和有效的WEQ方法,这是能够提取词嵌入直接从这些典型的背景。在实际情况下,我们的算法运行11 $\sim$ 13倍的速度比完善的方法。通过与矩阵分解、word2vec、GloVe和fasttext等知名方法的比较,我们证明了我们的方法在各种下游NLP任务上都取得了相当的性能,同时保持了所有这些基线的运行时间和资源优势。

英文摘要:

The notion of word embedding plays a fundamental role in natural language processing (NLP). However, pre-training word embedding for very large-scale vocabulary is computationally challenging for most existing methods. In this work, we show that with merely a small fraction of contexts (Q-contexts)which are typical in the whole corpus (and their mutual information with words), one can construct high-quality word embedding with negligible errors. Mutual information between contexts and words can be encoded canonically as a sampling state, thus, Q-contexts can be fast constructed. Furthermore, we present an efficient and effective WEQ method, which is capable of extracting word embedding directly from these typical contexts. In practical scenarios, our algorithm runs 11$\sim$13 times faster than well-established methods. By comparing with well-known methods such as matrix factorization, word2vec, GloVeand fasttext, we demonstrate that our method achieves comparable performance on a variety of downstream NLP tasks, and in the meanwhile maintains run-time and resource advantages over all these baselines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑