{"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/beyond-confidence-regions-tight-bayesian","title":"Beyond Confidence Regions: Tight Bayesian Ambiguity Sets for Robust MDPs","arxiv_id":"1902.07605","date":"2019-02-20","proceeding":"NeurIPS 2019 12","authors":["Marek Petrik","Reazul Hasan Russell"],"abstract":"Robust MDPs (RMDPs) can be used to compute policies with provable worst-case\nguarantees in reinforcement learning. The quality and robustness of an RMDP\nsolution are determined by the ambiguity set---the set of plausible transition\nprobabilities---which is usually constructed as a multi-dimensional confidence\nregion. Existing methods construct ambiguity sets as confidence regions using\nconcentration inequalities which leads to overly conservative solutions. This\npaper proposes a new paradigm that can achieve better solutions with the same\nrobustness guarantees without using confidence regions as ambiguity sets. To\nincorporate prior knowledge, our algorithms optimize the size and position of\nambiguity sets using Bayesian inference. Our theoretical analysis shows the\nsafety of the proposed method, and the empirical results demonstrate its\npractical promise.","url_abs":"http://arxiv.org/abs/1902.07605v1","url_pdf":"http://arxiv.org/pdf/1902.07605v1.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":"beyond-confidence-regions-tight-bayesian","repo_url":"https://github.com/marekpetrik/craam2","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"},{"task_slug":null,"task_name":"Position"},{"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/1902.07605","atlas_url":"https://app.syntology.ai/?focus=1902.07605","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":"1902.07605"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.07605\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.07605"},"call":"get_concepts_for_paper(arxiv_id=\"1902.07605\")"}],"by_repo":[{"repo":"marekpetrik/craam2","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":"8986c8b9ca39ab0775583677d2fc16fa88214918a25f12b9a794a06c572c7369","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}