arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1704.08059cs.CL
收藏

Riemannian Optimization for Skip-Gram Negative Sampling

Skolkovo Institute of Science and Technology(斯科尔科沃科学技术学院);Yandex LLC(Yandex有限责任公司);SBDA Group(SBDA集团);Moscow Institute of Physics and Technology(莫斯科物理技术学院);Institute of Numerical Mathematics, Russian Academy of Sciences(俄罗斯科学院数值数学研究所)

Alexander Fonarev, Oleksii Hrinchuk, Gleb Gusev, Pavel Serdyukov, Ivan Oseledets

英文摘要:

Skip-Gram Negative Sampling (SGNS) word embedding model, well known by its implementation in "word2vec" software, is usually optimized by stochastic gradient descent. However, the optimization of SGNS objective can be viewed as a problem of searching for a good matrix with the low-rank constraint. The most standard way to solve this type of problems is to apply Riemannian optimization framework to optimize the SGNS objective over the manifold of required low-rank matrices. In this paper, we propose an algorithm that optimizes SGNS objective using Riemannian optimization and demonstrates its superiority over popular competitors, such as the original method to train SGNS and SVD over SPPMI matrix.

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

↑