{"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/bayesian-sparse-reconstruction-a-brute-force","title":"Bayesian sparse reconstruction: a brute-force approach to astronomical imaging and machine learning","arxiv_id":"1809.04598","date":"2018-09-12","proceeding":null,"authors":["Edward Higson","Will Handley","Michael Hobson","Anthony Lasenby"],"abstract":"We present a principled Bayesian framework for signal reconstruction, in\nwhich the signal is modelled by basis functions whose number (and form, if\nrequired) is determined by the data themselves. This approach is based on a\nBayesian interpretation of conventional sparse reconstruction and\nregularisation techniques, in which sparsity is imposed through priors via\nBayesian model selection. We demonstrate our method for noisy 1- and\n2-dimensional signals, including astronomical images. Furthermore, by using a\nproduct-space approach, the number and type of basis functions can be treated\nas integer parameters and their posterior distributions sampled directly. We\nshow that order-of-magnitude increases in computational efficiency are possible\nfrom this technique compared to calculating the Bayesian evidences separately,\nand that further computational gains are possible using it in combination with\ndynamic nested sampling. Our approach can also be readily applied to neural\nnetworks, where it allows the network architecture to be determined by the data\nin a principled Bayesian manner by treating the number of nodes and hidden\nlayers as parameters.","url_abs":"http://arxiv.org/abs/1809.04598v2","url_pdf":"http://arxiv.org/pdf/1809.04598v2.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":"bayesian-sparse-reconstruction-a-brute-force","repo_url":"https://github.com/ejhigson/bsr","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"model-selection","task_name":"Model Selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"ejhigson/bsr","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":"28c034f2432b1ed7767db675730b2c894746046ddbdab23fff62f291ba6fea39","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}