{"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/deep-energy-estimator-networks","title":"Deep Energy Estimator Networks","arxiv_id":"1805.08306","date":"2018-05-21","proceeding":null,"authors":["Saeed Saremi","Arash Mehrjou","Bernhard Schölkopf","Aapo Hyvärinen"],"abstract":"Density estimation is a fundamental problem in statistical learning. This\nproblem is especially challenging for complex high-dimensional data due to the\ncurse of dimensionality. A promising solution to this problem is given here in\nan inference-free hierarchical framework that is built on score matching. We\nrevisit the Bayesian interpretation of the score function and the Parzen score\nmatching, and construct a multilayer perceptron with a scalable objective for\nlearning the energy (i.e. the unnormalized log-density), which is then\noptimized with stochastic gradient descent. In addition, the resulting deep\nenergy estimator network (DEEN) is designed as products of experts. We present\nthe utility of DEEN in learning the energy, the score function, and in\nsingle-step denoising experiments for synthetic and high-dimensional data. We\nalso diagnose stability problems in the direct estimation of the score function\nthat had been observed for denoising autoencoders.","url_abs":"http://arxiv.org/abs/1805.08306v1","url_pdf":"http://arxiv.org/pdf/1805.08306v1.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":"deep-energy-estimator-networks","repo_url":"https://github.com/Ending2015a/toy_gradlogp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"},{"task_slug":"density-estimation","task_name":"Density Estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.08306","atlas_url":"https://app.syntology.ai/?focus=1805.08306","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":"1805.08306"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.08306\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.08306"},"call":"get_concepts_for_paper(arxiv_id=\"1805.08306\")"}],"by_repo":[{"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\")"}]}],"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":"0c9ff2ddf75f7f5c87381860bef1ec9c29418f83daffe3781c84c9106a636272","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}