{"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/sliced-score-matching-a-scalable-approach-to","title":"Sliced Score Matching: A Scalable Approach to Density and Score Estimation","arxiv_id":"1905.07088","date":"2019-05-17","proceeding":null,"authors":["Yang Song","Sahaj Garg","Jiaxin Shi","Stefano Ermon"],"abstract":"Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density functions. We show this difficulty can be mitigated by projecting the scores onto random vectors before comparing them. This objective, called sliced score matching, only involves Hessian-vector products, which can be easily implemented using reverse-mode automatic differentiation. Therefore, sliced score matching is amenable to more complex models and higher dimensional data compared to score matching. Theoretically, we prove the consistency and asymptotic normality of sliced score matching estimators. Moreover, we demonstrate that sliced score matching can be used to learn deep score estimators for implicit distributions. In our experiments, we show sliced score matching can learn deep energy-based models effectively, and can produce accurate score estimates for applications such as variational inference with implicit distributions and training Wasserstein Auto-Encoders.","url_abs":"https://arxiv.org/abs/1905.07088v2","url_pdf":"https://arxiv.org/pdf/1905.07088v2.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":"sliced-score-matching-a-scalable-approach-to","repo_url":"https://github.com/ermongroup/sliced_score_matching","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"sliced-score-matching-a-scalable-approach-to","repo_url":"https://github.com/Ending2015a/toy_gradlogp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"sliced-score-matching-a-scalable-approach-to","repo_url":"https://github.com/Lornatang/PyTorch-NCSN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"sliced-score-matching-a-scalable-approach-to","repo_url":"https://github.com/baofff/BiSM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"sliced-score-matching-a-scalable-approach-to","repo_url":"https://github.com/ermongroup/ncsn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"sliced-score-matching-a-scalable-approach-to","repo_url":"https://github.com/voxmenthe/ncsn_1","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"sliced-score-matching-a-scalable-approach-to","repo_url":"https://github.com/soran-ghaderi/torchebm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1905.07088","atlas_url":"https://app.syntology.ai/?focus=1905.07088","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":"1905.07088"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1905.07088\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1905.07088"},"call":"get_concepts_for_paper(arxiv_id=\"1905.07088\")"}],"by_repo":[{"repo":"ermongroup/sliced_score_matching","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Ending2015a/toy_gradlogp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2101.03288"],"harvested_for_calls":[{"arxiv_id":"2101.03288","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2101.03288"},"call":"get_harvested_code_for_paper(arxiv_id=\"2101.03288\")"}]},{"repo":"Lornatang/PyTorch-NCSN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.05600"],"harvested_for_calls":[{"arxiv_id":"1907.05600","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.05600"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.05600\")"}]},{"repo":"baofff/BiSM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ermongroup/ncsn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2111.04726"],"harvested_for_calls":[{"arxiv_id":"2111.04726","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.04726"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.04726\")"}]},{"repo":"voxmenthe/ncsn_1","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"soran-ghaderi/torchebm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"333c620d38379cc7499e10ec3a3426d4587bc6760e036e9a09d1d3e9f4c410a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}