{"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/efficient-exploration/papers/6","list_of":"/task/efficient-exploration","task":"Efficient 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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":6,"pages_in_order":6,"rows_per_page":100,"rows":[501,514],"of":514,"counts":{"archive_papers_tagged":514,"with_a_code_link":189,"where_syntology_ran_a_sample":57,"not_listed_spam_title":0,"listed":514,"listed_where_code_ran":57,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":48,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":48,"listed_every_run_a_failure_of_syntologys_instrument":9,"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/efficient-exploration","prev":"/task/efficient-exploration/papers/5","next":null,"papers":[{"url":null,"slug":"hands-free-segmentation-of-medical-volumes","title":"Hands-Free Segmentation of Medical Volumes via Binary Inputs","date":"2016-09-20","arxiv_id":"1609.06192","repositories_listed":0,"syntology":null},{"url":null,"slug":"processing-document-collections-to","title":"Processing Document Collections to Automatically Extract Linked Data: Semantic Storytelling Technologies for Smart Curation Workflows","date":"2016-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bbq-networks-efficient-exploration-in-deep-1","title":"BBQ-Networks: Efficient Exploration in Deep Reinforcement Learning for Task-Oriented Dialogue Systems","date":"2016-08-17","arxiv_id":"1608.05081","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-signatures-of-unconsciousness-are","title":"Large-scale signatures of unconsciousness are consistent with a departure from critical dynamics","date":"2015-12-23","arxiv_id":"1509.04304","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-algorithms-for-tree-search","title":"Bandit Algorithms for Tree Search","date":"2014-08-09","arxiv_id":"1408.2028","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-exploration-of-state-and-action-spaces","title":"Safe Exploration of State and Action Spaces in Reinforcement Learning","date":"2014-02-04","arxiv_id":"1402.0560","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-graphs-using-exchangeable-random","title":"Sparse graphs using exchangeable random measures","date":"2014-01-06","arxiv_id":"1401.1137","repositories_listed":0,"syntology":null},{"url":null,"slug":"volumetric-spanners-an-efficient-exploration","title":"Volumetric Spanners: an Efficient Exploration Basis for Learning","date":"2013-12-21","arxiv_id":"1312.6214","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-exploration-and-value-function","title":"Efficient Exploration and Value Function Generalization in Deterministic Systems","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extended-formulations-for-online-linear","title":"Extended Formulations for Online Linear Bandit Optimization","date":"2013-11-20","arxiv_id":"1311.5022","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-university-of-cambridge-russian-english","title":"The University of Cambridge Russian-English System at WMT13","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-reinforcement-learning-in","title":"Efficient Reinforcement Learning in Deterministic Systems with Value Function Generalization","date":"2013-07-18","arxiv_id":"1307.4847","repositories_listed":0,"syntology":null},{"url":null,"slug":"more-efficient-reinforcement-learning-via","title":"(More) Efficient Reinforcement Learning via Posterior Sampling","date":"2013-06-04","arxiv_id":"1306.0940","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-community-based-algorithm-for-large-scale","title":"A Community Based Algorithm for Large Scale Web Service Composition","date":"2013-05-01","arxiv_id":"1305.0187","repositories_listed":0,"syntology":null}],"record_sha256":"8e47f7a9c6ec1a23b51aefa0f67a9b4f07bd8f81b2cd5f2761de416400f6273d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}