{"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/an-alternative-to-em-for-gaussian-mixture","title":"An Alternative to EM for Gaussian Mixture Models: Batch and Stochastic Riemannian Optimization","arxiv_id":"1706.03267","date":"2017-06-10","proceeding":null,"authors":["Reshad Hosseini","Suvrit Sra"],"abstract":"We consider maximum likelihood estimation for Gaussian Mixture Models (Gmms).\nThis task is almost invariably solved (in theory and practice) via the\nExpectation Maximization (EM) algorithm. EM owes its success to various\nfactors, of which is its ability to fulfill positive definiteness constraints\nin closed form is of key importance. We propose an alternative to EM by\nappealing to the rich Riemannian geometry of positive definite matrices, using\nwhich we cast Gmm parameter estimation as a Riemannian optimization problem.\nSurprisingly, such an out-of-the-box Riemannian formulation completely fails\nand proves much inferior to EM. This motivates us to take a closer look at the\nproblem geometry, and derive a better formulation that is much more amenable to\nRiemannian optimization. We then develop (Riemannian) batch and stochastic\ngradient algorithms that outperform EM, often substantially. We provide a\nnon-asymptotic convergence analysis for our stochastic method, which is also\nthe first (to our knowledge) such global analysis for Riemannian stochastic\ngradient. Numerous empirical results are included to demonstrate the\neffectiveness of our methods.","url_abs":"http://arxiv.org/abs/1706.03267v1","url_pdf":"http://arxiv.org/pdf/1706.03267v1.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":"an-alternative-to-em-for-gaussian-mixture","repo_url":"https://github.com/utvisionlab/mixest","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"density-estimation","task_name":"Density Estimation"},{"task_slug":"riemannian-optimization","task_name":"Riemannian optimization"},{"task_slug":"parameter-estimation","task_name":"parameter estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.03267","atlas_url":"https://app.syntology.ai/?focus=1706.03267","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1706.03267"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.03267\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.03267"},"call":"get_concepts_for_paper(arxiv_id=\"1706.03267\")"}],"by_repo":[{"repo":"utvisionlab/mixest","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":"20875f4385919a324b65cfa208d5f2e0b049dbeece1fd18ad4992a38714c708a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}