{"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/density-estimation-in-infinite-dimensional","title":"Density Estimation in Infinite Dimensional Exponential Families","arxiv_id":"1312.3516","date":"2013-12-12","proceeding":null,"authors":["Bharath Sriperumbudur","Kenji Fukumizu","Arthur Gretton","Aapo Hyvärinen","Revant Kumar"],"abstract":"In this paper, we consider an infinite dimensional exponential family,\n$\\mathcal{P}$ of probability densities, which are parametrized by functions in\na reproducing kernel Hilbert space, $H$ and show it to be quite rich in the\nsense that a broad class of densities on $\\mathbb{R}^d$ can be approximated\narbitrarily well in Kullback-Leibler (KL) divergence by elements in\n$\\mathcal{P}$. The main goal of the paper is to estimate an unknown density,\n$p_0$ through an element in $\\mathcal{P}$. Standard techniques like maximum\nlikelihood estimation (MLE) or pseudo MLE (based on the method of sieves),\nwhich are based on minimizing the KL divergence between $p_0$ and\n$\\mathcal{P}$, do not yield practically useful estimators because of their\ninability to efficiently handle the log-partition function. Instead, we propose\nan estimator, $\\hat{p}_n$ based on minimizing the \\emph{Fisher divergence},\n$J(p_0\\Vert p)$ between $p_0$ and $p\\in \\mathcal{P}$, which involves solving a\nsimple finite-dimensional linear system. When $p_0\\in\\mathcal{P}$, we show that\nthe proposed estimator is consistent, and provide a convergence rate of\n$n^{-\\min\\left\\{\\frac{2}{3},\\frac{2\\beta+1}{2\\beta+2}\\right\\}}$ in Fisher\ndivergence under the smoothness assumption that $\\log\np_0\\in\\mathcal{R}(C^\\beta)$ for some $\\beta\\ge 0$, where $C$ is a certain\nHilbert-Schmidt operator on $H$ and $\\mathcal{R}(C^\\beta)$ denotes the image of\n$C^\\beta$. We also investigate the misspecified case of $p_0\\notin\\mathcal{P}$\nand show that $J(p_0\\Vert\\hat{p}_n)\\rightarrow \\inf_{p\\in\\mathcal{P}}J(p_0\\Vert\np)$ as $n\\rightarrow\\infty$, and provide a rate for this convergence under a\nsimilar smoothness condition as above. Through numerical simulations we\ndemonstrate that the proposed estimator outperforms the non-parametric kernel\ndensity estimator, and that the advantage with the proposed estimator grows as\n$d$ increases.","url_abs":"http://arxiv.org/abs/1312.3516v4","url_pdf":"http://arxiv.org/pdf/1312.3516v4.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":"density-estimation-in-infinite-dimensional","repo_url":"https://github.com/karlnapf/kernel_exp_family","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"tasks":[{"task_slug":"density-estimation","task_name":"Density Estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1312.3516","atlas_url":"https://app.syntology.ai/?focus=1312.3516","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":"1312.3516"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1312.3516\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1312.3516"},"call":"get_concepts_for_paper(arxiv_id=\"1312.3516\")"}],"by_repo":[{"repo":"karlnapf/kernel_exp_family","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1506.02564"],"harvested_for_calls":[{"arxiv_id":"1506.02564","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1506.02564"},"call":"get_harvested_code_for_paper(arxiv_id=\"1506.02564\")"}]}],"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":"ab02ff873c1baeb7fd0e1df105b2e3bd628f84509d1d7cc9d3360c4f5315f0f3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}