{"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":"/task/safe-exploration/papers/ran/1","list_of":"/task/safe-exploration","task":"Safe Exploration","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,12],"of":12,"counts":{"archive_papers_tagged":135,"with_a_code_link":43,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":135,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/safe-exploration/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/conrft-a-reinforced-fine-tuning-method-for","slug":"conrft-a-reinforced-fine-tuning-method-for","title":"ConRFT: A Reinforced Fine-tuning Method for VLA Models via Consistency Policy","date":"2025-02-08","arxiv_id":"2502.05450","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conrft-a-reinforced-fine-tuning-method-for#ran","syntology_url":"https://syntology.ai/paper/2502.05450","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.05450"}},"official":{"repos":["cccedric/conrft"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/highway-value-iteration-networks","slug":"highway-value-iteration-networks","title":"Highway Value Iteration Networks","date":"2024-06-05","arxiv_id":"2406.03485","repositories_listed":0,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/highway-value-iteration-networks#ran","syntology_url":"https://syntology.ai/paper/2406.03485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03485"}},"official":null}},{"url":"/paper/state-wise-safe-reinforcement-learning-with","slug":"state-wise-safe-reinforcement-learning-with","title":"State-Wise Safe Reinforcement Learning With Pixel Observations","date":"2023-11-03","arxiv_id":"2311.02227","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":14,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/state-wise-safe-reinforcement-learning-with#ran","syntology_url":"https://syntology.ai/paper/2311.02227","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02227"}},"official":{"repos":["simonzhan-code/step-wise_saferl_pixel"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/information-theoretic-safe-exploration-with","slug":"information-theoretic-safe-exploration-with","title":"Information-Theoretic Safe Exploration with Gaussian Processes","date":"2022-12-09","arxiv_id":"2212.04914","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":2,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":8,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/information-theoretic-safe-exploration-with#ran","syntology_url":"https://syntology.ai/paper/2212.04914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04914"}},"official":{"repos":["boschresearch/information-theoretic-safe-exploration"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/model-based-safe-deep-reinforcement-learning","slug":"model-based-safe-deep-reinforcement-learning","title":"Model-based Safe Deep Reinforcement Learning via a Constrained Proximal Policy Optimization Algorithm","date":"2022-10-14","arxiv_id":"2210.07573","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/model-based-safe-deep-reinforcement-learning#ran","syntology_url":"https://syntology.ai/paper/2210.07573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07573"}},"official":{"repos":["akjayant/mbppol"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/near-optimal-multi-agent-learning-for-safe","slug":"near-optimal-multi-agent-learning-for-safe","title":"Near-Optimal Multi-Agent Learning for Safe Coverage Control","date":"2022-10-12","arxiv_id":"2210.06380","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/near-optimal-multi-agent-learning-for-safe#ran","syntology_url":"https://syntology.ai/paper/2210.06380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06380"}},"official":{"repos":["manish-pra/safemac"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/safe-policy-optimization-with-local","slug":"safe-policy-optimization-with-local","title":"Safe Policy Optimization with Local Generalized Linear Function Approximations","date":"2021-11-09","arxiv_id":"2111.04894","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/safe-policy-optimization-with-local#ran","syntology_url":"https://syntology.ai/paper/2111.04894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04894"}},"official":{"repos":["akifumi-wachi-4/spolf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/infinite-time-horizon-safety-of-bayesian","slug":"infinite-time-horizon-safety-of-bayesian","title":"Infinite Time Horizon Safety of Bayesian Neural Networks","date":"2021-11-04","arxiv_id":"2111.03165","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/infinite-time-horizon-safety-of-bayesian#ran","syntology_url":"https://syntology.ai/paper/2111.03165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.03165"}},"official":{"repos":["mlech26l/bayesian_nn_safety"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/feasible-actor-critic-constrained","slug":"feasible-actor-critic-constrained","title":"Feasible Actor-Critic: Constrained Reinforcement Learning for Ensuring Statewise Safety","date":"2021-05-22","arxiv_id":"2105.10682","repositories_listed":3,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/feasible-actor-critic-constrained#ran","syntology_url":"https://syntology.ai/paper/2105.10682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.10682"}},"official":{"repos":["mahaitongdae/Feasible-Actor-Critic"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/safe-continuous-control-with-constrained","slug":"safe-continuous-control-with-constrained","title":"Safe Continuous Control with Constrained Model-Based Policy Optimization","date":"2021-04-14","arxiv_id":"2104.06922","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/safe-continuous-control-with-constrained#ran","syntology_url":"https://syntology.ai/paper/2104.06922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06922"}},"official":null}},{"url":"/paper/learning-based-model-predictive-control-for","slug":"learning-based-model-predictive-control-for","title":"Learning-based Model Predictive Control for Safe Exploration","date":"2018-03-22","arxiv_id":"1803.08287","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-based-model-predictive-control-for#ran","syntology_url":"https://syntology.ai/paper/1803.08287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08287"}},"official":null}},{"url":"/paper/safe-exploration-in-continuous-action-spaces","slug":"safe-exploration-in-continuous-action-spaces","title":"Safe Exploration in Continuous Action Spaces","date":"2018-01-26","arxiv_id":"1801.08757","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/safe-exploration-in-continuous-action-spaces#ran","syntology_url":"https://syntology.ai/paper/1801.08757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.08757"}},"official":null}}],"record_sha256":"92c5cd7a7b94ce33327cd4a61f852a7a071d7756767180692132e2f5e8e21046","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}