{"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/thompson-sampling/papers/ran/1","list_of":"/task/thompson-sampling","task":"Thompson Sampling","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,30],"of":30,"counts":{"archive_papers_tagged":655,"with_a_code_link":135,"where_syntology_ran_a_sample":30,"not_listed_spam_title":0,"listed":655,"listed_where_code_ran":30,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":23,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":23,"listed_every_run_a_failure_of_syntologys_instrument":7,"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/thompson-sampling/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/steering-generative-models-with-experimental","slug":"steering-generative-models-with-experimental","title":"Steering Generative Models with Experimental Data for Protein Fitness Optimization","date":"2025-05-21","arxiv_id":"2505.15093","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/steering-generative-models-with-experimental#ran","syntology_url":"https://syntology.ai/paper/2505.15093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.15093"}},"official":{"repos":["jsunn-y/SGPO"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-missing-data-issue-for-diffusion","slug":"addressing-missing-data-issue-for-diffusion","title":"Addressing Missing Data Issue for Diffusion-based Recommendation","date":"2025-05-18","arxiv_id":"2505.12283","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/addressing-missing-data-issue-for-diffusion#ran","syntology_url":"https://syntology.ai/paper/2505.12283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12283"}},"official":{"repos":["maowenyu-11/TDM"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fedrts-federated-robust-pruning-via","slug":"fedrts-federated-robust-pruning-via","title":"FedRTS: Federated Robust Pruning via Combinatorial Thompson Sampling","date":"2025-01-31","arxiv_id":"2501.19122","repositories_listed":0,"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/fedrts-federated-robust-pruning-via#ran","syntology_url":"https://syntology.ai/paper/2501.19122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.19122"}},"official":null}},{"url":"/paper/langevin-soft-actor-critic-efficient","slug":"langevin-soft-actor-critic-efficient","title":"Langevin Soft Actor-Critic: Efficient Exploration through Uncertainty-Driven Critic Learning","date":"2025-01-29","arxiv_id":"2501.17827","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":1,"n_ran_checked":3,"n_instrument":3,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/langevin-soft-actor-critic-efficient#ran","syntology_url":"https://syntology.ai/paper/2501.17827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.17827"}},"official":{"repos":["hmishfaq/lsac"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/bots-batch-bayesian-optimization-of-extended","slug":"bots-batch-bayesian-optimization-of-extended","title":"BOTS: Batch Bayesian Optimization of Extended Thompson Sampling for Severely Episode-Limited RL Settings","date":"2024-11-30","arxiv_id":"2412.00308","repositories_listed":0,"syntology":{"n":9,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":9,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/bots-batch-bayesian-optimization-of-extended#ran","syntology_url":"https://syntology.ai/paper/2412.00308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.00308"}},"official":null}},{"url":"/paper/fast-precise-thompson-sampling-for-bayesian","slug":"fast-precise-thompson-sampling-for-bayesian","title":"Fast, Precise Thompson Sampling for Bayesian Optimization","date":"2024-11-26","arxiv_id":"2411.17071","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/fast-precise-thompson-sampling-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/2411.17071","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17071"}},"official":null}},{"url":"/paper/sample-efficient-alignment-for-llms","slug":"sample-efficient-alignment-for-llms","title":"Sample-Efficient Alignment for LLMs","date":"2024-11-03","arxiv_id":"2411.01493","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sample-efficient-alignment-for-llms#ran","syntology_url":"https://syntology.ai/paper/2411.01493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01493"}},"official":{"repos":["sail-sg/oat"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/optimizing-posterior-samples-for-bayesian","slug":"optimizing-posterior-samples-for-bayesian","title":"Optimizing Posterior Samples for Bayesian Optimization via Rootfinding","date":"2024-10-29","arxiv_id":"2410.22322","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimizing-posterior-samples-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/2410.22322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22322"}},"official":{"repos":["uquh/tsroots"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-foundation-models-for-online","slug":"adaptive-foundation-models-for-online","title":"Scalable Exploration via Ensemble++","date":"2024-07-18","arxiv_id":"2407.13195","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adaptive-foundation-models-for-online#ran","syntology_url":"https://syntology.ai/paper/2407.13195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.13195"}},"official":{"repos":["szrlee/GPT-HyperAgent","szrlee/ensemble_plus_plus"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/more-efficient-randomized-exploration-for","slug":"more-efficient-randomized-exploration-for","title":"More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling","date":"2024-06-18","arxiv_id":"2406.12241","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/more-efficient-randomized-exploration-for#ran","syntology_url":"https://syntology.ai/paper/2406.12241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12241"}},"official":{"repos":["panxulab/lsvi-ase"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/randomized-exploration-in-cooperative-multi","slug":"randomized-exploration-in-cooperative-multi","title":"Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning","date":"2024-04-16","arxiv_id":"2404.10728","repositories_listed":0,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/randomized-exploration-in-cooperative-multi#ran","syntology_url":"https://syntology.ai/paper/2404.10728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10728"}},"official":null}},{"url":"/paper/accelerating-approximate-thompson-sampling","slug":"accelerating-approximate-thompson-sampling","title":"Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo","date":"2024-01-22","arxiv_id":"2401.11665","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/accelerating-approximate-thompson-sampling#ran","syntology_url":"https://syntology.ai/paper/2401.11665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11665"}},"official":{"repos":["haoyangzheng1996/ts_ulmc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transformers-as-decision-makers-provable-in","slug":"transformers-as-decision-makers-provable-in","title":"Transformers as Decision Makers: Provable In-Context Reinforcement Learning via Supervised Pretraining","date":"2023-10-12","arxiv_id":"2310.08566","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/transformers-as-decision-makers-provable-in#ran","syntology_url":"https://syntology.ai/paper/2310.08566","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08566"}},"official":{"repos":["licong-lin/in-context-rl"],"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/provable-and-practical-efficient-exploration","slug":"provable-and-practical-efficient-exploration","title":"Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo","date":"2023-05-29","arxiv_id":"2305.18246","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/provable-and-practical-efficient-exploration#ran","syntology_url":"https://syntology.ai/paper/2305.18246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18246"}},"official":{"repos":["hmishfaq/lmc-lsvi"],"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/kullback-leibler-maillard-sampling-for-multi","slug":"kullback-leibler-maillard-sampling-for-multi","title":"Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards","date":"2023-04-28","arxiv_id":"2304.14989","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kullback-leibler-maillard-sampling-for-multi#ran","syntology_url":"https://syntology.ai/paper/2304.14989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14989"}},"official":{"repos":["MjolnirT/Kullback-Leibler-Maillard-Sampling"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sample-then-optimize-batch-neural-thompson","slug":"sample-then-optimize-batch-neural-thompson","title":"Sample-Then-Optimize Batch Neural Thompson Sampling","date":"2022-10-13","arxiv_id":"2210.06850","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sample-then-optimize-batch-neural-thompson#ran","syntology_url":"https://syntology.ai/paper/2210.06850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06850"}},"official":{"repos":["daizhongxiang/sto-bnts"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/langevin-monte-carlo-for-contextual-bandits","slug":"langevin-monte-carlo-for-contextual-bandits","title":"Langevin Monte Carlo for Contextual Bandits","date":"2022-06-22","arxiv_id":"2206.11254","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/langevin-monte-carlo-for-contextual-bandits#ran","syntology_url":"https://syntology.ai/paper/2206.11254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11254"}},"official":{"repos":["devzhk/lmcts"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/thompson-sampling-for-robust-transfer-in","slug":"thompson-sampling-for-robust-transfer-in","title":"Thompson Sampling for Robust Transfer in Multi-Task Bandits","date":"2022-06-17","arxiv_id":"2206.08556","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/thompson-sampling-for-robust-transfer-in#ran","syntology_url":"https://syntology.ai/paper/2206.08556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08556"}},"official":{"repos":["zhiwang123/eps-mpmab-ts"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalizing-hierarchical-bayesian-bandits","slug":"generalizing-hierarchical-bayesian-bandits","title":"Mixed-Effect Thompson Sampling","date":"2022-05-30","arxiv_id":"2205.15124","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generalizing-hierarchical-bayesian-bandits#ran","syntology_url":"https://syntology.ai/paper/2205.15124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15124"}},"official":{"repos":["imadaouali/mixed-effect-thompson-sampling"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploration-with-a-finite-brain","slug":"exploration-with-a-finite-brain","title":"Modeling Human Exploration Through Resource-Rational Reinforcement Learning","date":"2022-01-27","arxiv_id":"2201.11817","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exploration-with-a-finite-brain#ran","syntology_url":"https://syntology.ai/paper/2201.11817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.11817"}},"official":{"repos":["marcelbinz/resource-rational-reinforcement-learning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-optimization-over-permutation-spaces","slug":"bayesian-optimization-over-permutation-spaces","title":"Bayesian Optimization over Permutation Spaces","date":"2021-12-02","arxiv_id":"2112.01049","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/bayesian-optimization-over-permutation-spaces#ran","syntology_url":"https://syntology.ai/paper/2112.01049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.01049"}},"official":{"repos":["aryandeshwal/bops"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mercer-features-for-efficient-combinatorial","slug":"mercer-features-for-efficient-combinatorial","title":"Mercer Features for Efficient Combinatorial Bayesian Optimization","date":"2020-12-14","arxiv_id":"2012.07762","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mercer-features-for-efficient-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2012.07762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07762"}},"official":{"repos":["aryandeshwal/MerCBO"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sub-sampling-for-efficient-non-parametric","slug":"sub-sampling-for-efficient-non-parametric","title":"Sub-sampling for Efficient Non-Parametric Bandit Exploration","date":"2020-10-27","arxiv_id":"2010.14323","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/sub-sampling-for-efficient-non-parametric#ran","syntology_url":"https://syntology.ai/paper/2010.14323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14323"}},"official":{"repos":["DBaudry/Sub-Sampling-Dueling-Algorithms-Neurips20"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-thompson-sampling","slug":"neural-thompson-sampling","title":"Neural Thompson Sampling","date":"2020-10-02","arxiv_id":"2010.00827","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":2,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-thompson-sampling#ran","syntology_url":"https://syntology.ai/paper/2010.00827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00827"}},"official":{"repos":["ZeroWeight/NeuralTS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/meta-learning-stationary-stochastic-process","slug":"meta-learning-stationary-stochastic-process","title":"Meta-Learning Stationary Stochastic Process Prediction with Convolutional Neural Processes","date":"2020-07-02","arxiv_id":"2007.01332","repositories_listed":2,"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":0,"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/meta-learning-stationary-stochastic-process#ran","syntology_url":"https://syntology.ai/paper/2007.01332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01332"}},"official":{"repos":["YannDubs/Neural-Process-Family","wesselb/NeuralProcesses.jl"],"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/on-isometry-robustness-of-deep-3d-point-cloud","slug":"on-isometry-robustness-of-deep-3d-point-cloud","title":"On Isometry Robustness of Deep 3D Point Cloud Models under Adversarial Attacks","date":"2020-02-27","arxiv_id":"2002.12222","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-isometry-robustness-of-deep-3d-point-cloud#ran","syntology_url":"https://syntology.ai/paper/2002.12222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12222"}},"official":{"repos":["skywalker6174/3d-isometry-robust"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/thompson-sampling-algorithms-for-mean","slug":"thompson-sampling-algorithms-for-mean","title":"Thompson Sampling Algorithms for Mean-Variance Bandits","date":"2020-02-01","arxiv_id":"2002.00232","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/thompson-sampling-algorithms-for-mean#ran","syntology_url":"https://syntology.ai/paper/2002.00232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00232"}},"official":null}},{"url":"/paper/making-sense-of-reinforcement-learning-and-1","slug":"making-sense-of-reinforcement-learning-and-1","title":"Making Sense of Reinforcement Learning and Probabilistic Inference","date":"2020-01-03","arxiv_id":"2001.00805","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/making-sense-of-reinforcement-learning-and-1#ran","syntology_url":"https://syntology.ai/paper/2001.00805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00805"}},"official":null}},{"url":"/paper/thompson-sampling-via-local-uncertainty","slug":"thompson-sampling-via-local-uncertainty","title":"Thompson Sampling via Local Uncertainty","date":"2019-10-30","arxiv_id":"1910.13673","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/thompson-sampling-via-local-uncertainty#ran","syntology_url":"https://syntology.ai/paper/1910.13673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13673"}},"official":{"repos":["Zhendong-Wang/Thompson-Sampling-via-Local-Uncertainty"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/old-dog-learns-new-tricks-randomized-ucb-for","slug":"old-dog-learns-new-tricks-randomized-ucb-for","title":"Old Dog Learns New Tricks: Randomized UCB for Bandit Problems","date":"2019-10-11","arxiv_id":"1910.04928","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/old-dog-learns-new-tricks-randomized-ucb-for#ran","syntology_url":"https://syntology.ai/paper/1910.04928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04928"}},"official":{"repos":["vaswanis/randucb"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"076db2bc61d3ced6e270c0d40973aab204688f7723ffc81297999b2bc299ea22","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}