{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/evidence-networks-simple-losses-for-fast","title":"Evidence Networks: simple losses for fast, amortized, neural Bayesian model comparison","arxiv_id":"2305.11241","date":"2023-05-18","proceeding":null,"authors":["Niall Jeffrey","Benjamin D. Wandelt"],"abstract":"Evidence Networks can enable Bayesian model comparison when state-of-the-art methods (e.g. nested sampling) fail and even when likelihoods or priors are intractable or unknown. Bayesian model comparison, i.e. the computation of Bayes factors or evidence ratios, can be cast as an optimization problem. Though the Bayesian interpretation of optimal classification is well-known, here we change perspective and present classes of loss functions that result in fast, amortized neural estimators that directly estimate convenient functions of the Bayes factor. This mitigates numerical inaccuracies associated with estimating individual model probabilities. We introduce the leaky parity-odd power (l-POP) transform, leading to the novel ``l-POP-Exponential'' loss function. We explore neural density estimation for data probability in different models, showing it to be less accurate and scalable than Evidence Networks. Multiple real-world and synthetic examples illustrate that Evidence Networks are explicitly independent of dimensionality of the parameter space and scale mildly with the complexity of the posterior probability density function. This simple yet powerful approach has broad implications for model inference tasks. As an application of Evidence Networks to real-world data we compute the Bayes factor for two models with gravitational lensing data of the Dark Energy Survey. We briefly discuss applications of our methods to other, related problems of model comparison and evaluation in implicit inference settings.","url_abs":"https://arxiv.org/abs/2305.11241v2","url_pdf":"https://arxiv.org/pdf/2305.11241v2.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":"evidence-networks-simple-losses-for-fast","repo_url":"https://github.com/nialljeffrey/evidencenetworksdemo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"density-estimation","task_name":"Density Estimation"}],"methods":[{"method_slug":"fail","method_name":"fail"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.11241","atlas_url":"https://app.syntology.ai/?focus=2305.11241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11241"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nialljeffrey/evidencenetworksdemo","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":6},"by_repo_kind":{"official":{"samples":6,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"ea6297aecac47794","entry":"coordinate_function","repo":"nialljeffrey/evidencenetworksdemo","repo_kind":"official","path":"time_series_model.py","file_url":"https://github.com/nialljeffrey/evidencenetworksdemo/blob/HEAD/time_series_model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ea6297aecac47794"}},{"code_sha256_prefix":"eec4fa07bc550cf1","entry":"coverage_test","repo":"nialljeffrey/evidencenetworksdemo","repo_kind":"official","path":"network_architecture.py","file_url":"https://github.com/nialljeffrey/evidencenetworksdemo/blob/HEAD/network_architecture.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"eec4fa07bc550cf1"}},{"code_sha256_prefix":"bb93bbc627c982bb","entry":"matrix_operation","repo":"nialljeffrey/evidencenetworksdemo","repo_kind":"official","path":"time_series_model.py","file_url":"https://github.com/nialljeffrey/evidencenetworksdemo/blob/HEAD/time_series_model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bb93bbc627c982bb"}},{"code_sha256_prefix":"a85de383e90dd8af","entry":"parity_odd_power","repo":"nialljeffrey/evidencenetworksdemo","repo_kind":"official","path":"network_architecture.py","file_url":"https://github.com/nialljeffrey/evidencenetworksdemo/blob/HEAD/network_architecture.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a85de383e90dd8af"}},{"code_sha256_prefix":"c552151838b42b06","entry":"prior_normal","repo":"nialljeffrey/evidencenetworksdemo","repo_kind":"official","path":"time_series_model.py","file_url":"https://github.com/nialljeffrey/evidencenetworksdemo/blob/HEAD/time_series_model.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c552151838b42b06"}},{"code_sha256_prefix":"ec590b54c622214c","entry":"smooth_sign","repo":"nialljeffrey/evidencenetworksdemo","repo_kind":"official","path":"network_architecture.py","file_url":"https://github.com/nialljeffrey/evidencenetworksdemo/blob/HEAD/network_architecture.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ec590b54c622214c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}