{"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/decomposition-of-uncertainty-in-bayesian-deep","title":"Decomposition of Uncertainty in Bayesian Deep Learning for Efficient and Risk-sensitive Learning","arxiv_id":"1710.07283","date":"2017-10-19","proceeding":"ICML 2018 7","authors":["Stefan Depeweg","José Miguel Hernández-Lobato","Finale Doshi-Velez","Steffen Udluft"],"abstract":"Bayesian neural networks with latent variables are scalable and flexible\nprobabilistic models: They account for uncertainty in the estimation of the\nnetwork weights and, by making use of latent variables, can capture complex\nnoise patterns in the data. We show how to extract and decompose uncertainty\ninto epistemic and aleatoric components for decision-making purposes. This\nallows us to successfully identify informative points for active learning of\nfunctions with heteroscedastic and bimodal noise. Using the decomposition we\nfurther define a novel risk-sensitive criterion for reinforcement learning to\nidentify policies that balance expected cost, model-bias and noise aversion.","url_abs":"http://arxiv.org/abs/1710.07283v4","url_pdf":"http://arxiv.org/pdf/1710.07283v4.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":"decomposition-of-uncertainty-in-bayesian-deep","repo_url":"https://github.com/lightning-uq-box/lightning-uq-box","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1710.07283","atlas_url":"https://app.syntology.ai/?focus=1710.07283","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":"1710.07283"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1710.07283\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1710.07283"},"call":"get_concepts_for_paper(arxiv_id=\"1710.07283\")"}],"by_repo":[{"repo":"lightning-uq-box/lightning-uq-box","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["2009.14193","2211.11435","2404.11599"],"harvested_for_calls":[{"arxiv_id":"2009.14193","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2009.14193"},"call":"get_harvested_code_for_paper(arxiv_id=\"2009.14193\")"},{"arxiv_id":"2211.11435","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2211.11435"},"call":"get_harvested_code_for_paper(arxiv_id=\"2211.11435\")"},{"arxiv_id":"2404.11599","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2404.11599"},"call":"get_harvested_code_for_paper(arxiv_id=\"2404.11599\")"}]}],"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":"1bfcf422a7355a7b682833150ad362623ffbca1824be5c58561c5930f4c429a6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}