{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/riemannian-optimization-for-skip-gram","title":"Riemannian Optimization for Skip-Gram Negative Sampling","arxiv_id":"1704.08059","date":"2017-04-26","proceeding":"ACL 2017 7","authors":["Alexander Fonarev","Oleksii Hrinchuk","Gleb Gusev","Pavel Serdyukov","Ivan Oseledets"],"abstract":"Skip-Gram Negative Sampling (SGNS) word embedding model, well known by its\nimplementation in \"word2vec\" software, is usually optimized by stochastic\ngradient descent. However, the optimization of SGNS objective can be viewed as\na problem of searching for a good matrix with the low-rank constraint. The most\nstandard way to solve this type of problems is to apply Riemannian optimization\nframework to optimize the SGNS objective over the manifold of required low-rank\nmatrices. In this paper, we propose an algorithm that optimizes SGNS objective\nusing Riemannian optimization and demonstrates its superiority over popular\ncompetitors, such as the original method to train SGNS and SVD over SPPMI\nmatrix.","url_abs":"http://arxiv.org/abs/1704.08059v1","url_pdf":"http://arxiv.org/pdf/1704.08059v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"riemannian-optimization-for-skip-gram","repo_url":"https://github.com/AlexGrinch/ro_sgns","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"riemannian-optimization","task_name":"Riemannian optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"AlexGrinch/ro_sgns","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0239460b236ec293fd4e895ce9d7c6c5293021bae965b5be9a5a8ad4f464d39f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}