{"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/constrained-exploration-and-recovery-from","title":"Constrained Exploration and Recovery from Experience Shaping","arxiv_id":"1809.08925","date":"2018-09-21","proceeding":null,"authors":["Tu-Hoa Pham","Giovanni De Magistris","Don Joven Agravante","Subhajit Chaudhury","Asim Munawar","Ryuki Tachibana"],"abstract":"We consider the problem of reinforcement learning under safety requirements,\nin which an agent is trained to complete a given task, typically formalized as\nthe maximization of a reward signal over time, while concurrently avoiding\nundesirable actions or states, associated to lower rewards, or penalties. The\nconstruction and balancing of different reward components can be difficult in\nthe presence of multiple objectives, yet is crucial for producing a satisfying\npolicy. For example, in reaching a target while avoiding obstacles, low\ncollision penalties can lead to reckless movements while high penalties can\ndiscourage exploration. To circumvent this limitation, we examine the effect of\npast actions in terms of safety to estimate which are acceptable or should be\navoided in the future. We then actively reshape the action space of the agent\nduring reinforcement learning, so that reward-driven exploration is constrained\nwithin safety limits. We propose an algorithm enabling the learning of such\nsafety constraints in parallel with reinforcement learning and demonstrate its\neffectiveness in terms of both task completion and training time.","url_abs":"http://arxiv.org/abs/1809.08925v1","url_pdf":"http://arxiv.org/pdf/1809.08925v1.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":"constrained-exploration-and-recovery-from","repo_url":"https://github.com/IBM/constrained-rl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"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/1809.08925","atlas_url":"https://app.syntology.ai/?focus=1809.08925","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":"1809.08925"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.08925\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.08925"},"call":"get_concepts_for_paper(arxiv_id=\"1809.08925\")"}],"by_repo":[{"repo":"IBM/constrained-rl","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":"4282ad710a659a6d8d4b2c57e5d442dbce003b68af8a11fb0f19d2f5b2a221ff","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}