{"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/hamiltonian-monte-carlo-acceleration-using","title":"Hamiltonian Monte Carlo Acceleration Using Surrogate Functions with Random Bases","arxiv_id":"1506.05555","date":"2015-06-18","proceeding":null,"authors":["Cheng Zhang","Babak Shahbaba","Hongkai Zhao"],"abstract":"For big data analysis, high computational cost for Bayesian methods often\nlimits their applications in practice. In recent years, there have been many\nattempts to improve computational efficiency of Bayesian inference. Here we\npropose an efficient and scalable computational technique for a\nstate-of-the-art Markov Chain Monte Carlo (MCMC) methods, namely, Hamiltonian\nMonte Carlo (HMC). The key idea is to explore and exploit the structure and\nregularity in parameter space for the underlying probabilistic model to\nconstruct an effective approximation of its geometric properties. To this end,\nwe build a surrogate function to approximate the target distribution using\nproperly chosen random bases and an efficient optimization process. The\nresulting method provides a flexible, scalable, and efficient sampling\nalgorithm, which converges to the correct target distribution. We show that by\nchoosing the basis functions and optimization process differently, our method\ncan be related to other approaches for the construction of surrogate functions\nsuch as generalized additive models or Gaussian process models. Experiments\nbased on simulated and real data show that our approach leads to substantially\nmore efficient sampling algorithms compared to existing state-of-the art\nmethods.","url_abs":"http://arxiv.org/abs/1506.05555v5","url_pdf":"http://arxiv.org/pdf/1506.05555v5.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":"hamiltonian-monte-carlo-acceleration-using","repo_url":"https://github.com/chengzhang-uci/RNSHMC","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"additive-models","task_name":"Additive models"},{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1506.05555","atlas_url":"https://app.syntology.ai/?focus=1506.05555","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":"1506.05555"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1506.05555\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1506.05555"},"call":"get_concepts_for_paper(arxiv_id=\"1506.05555\")"}],"by_repo":[{"repo":"chengzhang-uci/RNSHMC","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":"1a87e4d8ac2658c6a07b9a0d7aa2a807b2764bbc8a6289e757c1f38f60420de4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}