{"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/multi-armed-bandits/papers/ran/1","list_of":"/task/multi-armed-bandits","task":"Multi-Armed Bandits","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,55],"of":55,"counts":{"archive_papers_tagged":1262,"with_a_code_link":253,"where_syntology_ran_a_sample":55,"not_listed_spam_title":0,"listed":1262,"listed_where_code_ran":55,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":44,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":44,"listed_every_run_a_failure_of_syntologys_instrument":11,"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/multi-armed-bandits/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/pagerank-bandits-for-link-prediction","slug":"pagerank-bandits-for-link-prediction","title":"PageRank Bandits for Link Prediction","date":"2024-11-03","arxiv_id":"2411.01410","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pagerank-bandits-for-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2411.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01410"}},"official":{"repos":["jiaruzouu/prb"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evolve-evaluating-and-optimizing-llms-for","slug":"evolve-evaluating-and-optimizing-llms-for","title":"EVOLvE: Evaluating and Optimizing LLMs For Exploration","date":"2024-10-08","arxiv_id":"2410.06238","repositories_listed":0,"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/evolve-evaluating-and-optimizing-llms-for#ran","syntology_url":"https://syntology.ai/paper/2410.06238","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06238"}},"official":null}},{"url":"/paper/dopl-direct-online-preference-learning-for","slug":"dopl-direct-online-preference-learning-for","title":"DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback","date":"2024-10-07","arxiv_id":"2410.05527","repositories_listed":0,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dopl-direct-online-preference-learning-for#ran","syntology_url":"https://syntology.ai/paper/2410.05527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05527"}},"official":null}},{"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/on-speeding-up-language-model-evaluation","slug":"on-speeding-up-language-model-evaluation","title":"On Speeding Up Language Model Evaluation","date":"2024-07-08","arxiv_id":"2407.06172","repositories_listed":0,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-speeding-up-language-model-evaluation#ran","syntology_url":"https://syntology.ai/paper/2407.06172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06172"}},"official":null}},{"url":"/paper/jump-starting-bandits-with-llm-generated","slug":"jump-starting-bandits-with-llm-generated","title":"Jump Starting Bandits with LLM-Generated Prior Knowledge","date":"2024-06-27","arxiv_id":"2406.19317","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/jump-starting-bandits-with-llm-generated#ran","syntology_url":"https://syntology.ai/paper/2406.19317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19317"}},"official":{"repos":["BorealisAI/jump-starting-bandits"],"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/optimal-regret-with-limited-adaptivity-for","slug":"optimal-regret-with-limited-adaptivity-for","title":"Generalized Linear Bandits with Limited Adaptivity","date":"2024-04-10","arxiv_id":"2404.06831","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":2,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":6,"n_no_contract":2,"n_pointer_only":4,"phrase":"10 ran (of which 2 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 6 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/optimal-regret-with-limited-adaptivity-for#ran","syntology_url":"https://syntology.ai/paper/2404.06831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06831"}},"official":{"repos":["nirjhar-das/glbandit_limited_adaptivity"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/hypothesis-generation-with-large-language","slug":"hypothesis-generation-with-large-language","title":"Hypothesis Generation with Large Language Models","date":"2024-04-05","arxiv_id":"2404.04326","repositories_listed":3,"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/hypothesis-generation-with-large-language#ran","syntology_url":"https://syntology.ai/paper/2404.04326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.04326"}},"official":{"repos":["chicagohai/hypothesis-generation","chicagohai/hypothesis_generation"],"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/harnessing-the-power-of-federated-learning-in","slug":"harnessing-the-power-of-federated-learning-in","title":"Harnessing the Power of Federated Learning in Federated Contextual Bandits","date":"2023-12-26","arxiv_id":"2312.16341","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/harnessing-the-power-of-federated-learning-in#ran","syntology_url":"https://syntology.ai/paper/2312.16341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16341"}},"official":{"repos":["shengroup/fedigw"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/in-context-reinforcement-learning-for","slug":"in-context-reinforcement-learning-for","title":"In-Context Reinforcement Learning for Variable Action Spaces","date":"2023-12-20","arxiv_id":"2312.13327","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":2,"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/in-context-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/2312.13327","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13327"}},"official":{"repos":["corl-team/headless-ad"],"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/marginal-density-ratio-for-off-policy-1","slug":"marginal-density-ratio-for-off-policy-1","title":"Marginal Density Ratio for Off-Policy Evaluation in Contextual Bandits","date":"2023-12-03","arxiv_id":"2312.01457","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":2,"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/marginal-density-ratio-for-off-policy-1#ran","syntology_url":"https://syntology.ai/paper/2312.01457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01457"}},"official":{"repos":["faaizt/mr-ope"],"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/when-is-off-policy-evaluation-useful-a-data","slug":"when-is-off-policy-evaluation-useful-a-data","title":"When is Off-Policy Evaluation (Reward Modeling) Useful in Contextual Bandits? A Data-Centric Perspective","date":"2023-11-23","arxiv_id":"2311.14110","repositories_listed":1,"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/when-is-off-policy-evaluation-useful-a-data#ran","syntology_url":"https://syntology.ai/paper/2311.14110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14110"}},"official":{"repos":["holarissun/Data-Centric-OPE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-attacks-on-combinatorial-multi","slug":"adversarial-attacks-on-combinatorial-multi","title":"Adversarial Attacks on Combinatorial Multi-Armed Bandits","date":"2023-10-08","arxiv_id":"2310.05308","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 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; 0 where Syntology's instrument failed) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/adversarial-attacks-on-combinatorial-multi#ran","syntology_url":"https://syntology.ai/paper/2310.05308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05308"}},"official":{"repos":["haoyuzhao123/robust-cmab-code"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tight-regret-bounds-for-single-pass-streaming","slug":"tight-regret-bounds-for-single-pass-streaming","title":"Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits","date":"2023-06-03","arxiv_id":"2306.02208","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tight-regret-bounds-for-single-pass-streaming#ran","syntology_url":"https://syntology.ai/paper/2306.02208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02208"}},"official":{"repos":["jhwjhw0123/streaming-regret-minimization-mabs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/competing-for-shareable-arms-in-multi-player","slug":"competing-for-shareable-arms-in-multi-player","title":"Competing for Shareable Arms in Multi-Player Multi-Armed Bandits","date":"2023-05-30","arxiv_id":"2305.19158","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/competing-for-shareable-arms-in-multi-player#ran","syntology_url":"https://syntology.ai/paper/2305.19158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19158"}},"official":{"repos":["windxrz/smaa"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-in-context-learning-in-large-language","slug":"meta-in-context-learning-in-large-language","title":"Meta-in-context learning in large language models","date":"2023-05-22","arxiv_id":"2305.12907","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/meta-in-context-learning-in-large-language#ran","syntology_url":"https://syntology.ai/paper/2305.12907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12907"}},"official":{"repos":["juliancodaforno/meta-in-context-learning"],"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/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/quantum-natural-policy-gradients-towards","slug":"quantum-natural-policy-gradients-towards","title":"Quantum Natural Policy Gradients: Towards Sample-Efficient Reinforcement Learning","date":"2023-04-26","arxiv_id":"2304.13571","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/quantum-natural-policy-gradients-towards#ran","syntology_url":"https://syntology.ai/paper/2304.13571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.13571"}},"official":{"repos":["nicomeyer96/quantum-natural-policy-gradients"],"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/an-empirical-evaluation-of-federated","slug":"an-empirical-evaluation-of-federated","title":"An Empirical Evaluation of Federated Contextual Bandit Algorithms","date":"2023-03-17","arxiv_id":"2303.10218","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/an-empirical-evaluation-of-federated#ran","syntology_url":"https://syntology.ai/paper/2303.10218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10218"}},"official":{"repos":["google-research/federated"],"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/kernel-conditional-moment-constraints-for","slug":"kernel-conditional-moment-constraints-for","title":"Kernel Conditional Moment Constraints for Confounding Robust Inference","date":"2023-02-26","arxiv_id":"2302.13348","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/kernel-conditional-moment-constraints-for#ran","syntology_url":"https://syntology.ai/paper/2302.13348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13348"}},"official":{"repos":["kstoneriv3/confounding-robust-inference-old"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/infinite-action-contextual-bandits-with","slug":"infinite-action-contextual-bandits-with","title":"Infinite Action Contextual Bandits with Reusable Data Exhaust","date":"2023-02-16","arxiv_id":"2302.08551","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/infinite-action-contextual-bandits-with#ran","syntology_url":"https://syntology.ai/paper/2302.08551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08551"}},"official":{"repos":["mrucker/onoff_experiments"],"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/mabsplit-faster-forest-training-using-multi","slug":"mabsplit-faster-forest-training-using-multi","title":"MABSplit: Faster Forest Training Using Multi-Armed Bandits","date":"2022-12-14","arxiv_id":"2212.07473","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":1,"n_ran_checked":2,"n_instrument":5,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":14,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/mabsplit-faster-forest-training-using-multi#ran","syntology_url":"https://syntology.ai/paper/2212.07473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.07473"}},"official":{"repos":["thrungroup/fastforest"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-rising-bandits","slug":"stochastic-rising-bandits","title":"Stochastic Rising Bandits","date":"2022-12-07","arxiv_id":"2212.03798","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/stochastic-rising-bandits#ran","syntology_url":"https://syntology.ai/paper/2212.03798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.03798"}},"official":{"repos":["albertometelli/stochastic-rising-bandits"],"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/local-metric-learning-for-off-policy","slug":"local-metric-learning-for-off-policy","title":"Local Metric Learning for Off-Policy Evaluation in Contextual Bandits with Continuous Actions","date":"2022-10-24","arxiv_id":"2210.13373","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/local-metric-learning-for-off-policy#ran","syntology_url":"https://syntology.ai/paper/2210.13373","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13373"}},"official":{"repos":["haanvid/kmis"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/conditionally-risk-averse-contextual-bandits","slug":"conditionally-risk-averse-contextual-bandits","title":"Conditionally Risk-Averse Contextual Bandits","date":"2022-10-24","arxiv_id":"2210.13573","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/conditionally-risk-averse-contextual-bandits#ran","syntology_url":"https://syntology.ai/paper/2210.13573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13573"}},"official":{"repos":["zwd-ms/risk_averse_cb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-agent-dynamic-algorithm-configuration","slug":"multi-agent-dynamic-algorithm-configuration","title":"Multi-agent Dynamic Algorithm Configuration","date":"2022-10-13","arxiv_id":"2210.06835","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":3,"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/multi-agent-dynamic-algorithm-configuration#ran","syntology_url":"https://syntology.ai/paper/2210.06835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06835"}},"official":{"repos":["lamda-bbo/madac"],"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/contextual-bandits-with-large-action-spaces","slug":"contextual-bandits-with-large-action-spaces","title":"Contextual Bandits with Large Action Spaces: Made Practical","date":"2022-07-12","arxiv_id":"2207.05836","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"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 1 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/contextual-bandits-with-large-action-spaces#ran","syntology_url":"https://syntology.ai/paper/2207.05836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05836"}},"official":{"repos":["pmineiro/linrepcb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contextual-bandits-with-smooth-regret","slug":"contextual-bandits-with-smooth-regret","title":"Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces","date":"2022-07-12","arxiv_id":"2207.05849","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contextual-bandits-with-smooth-regret#ran","syntology_url":"https://syntology.ai/paper/2207.05849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05849"}},"official":{"repos":["pmineiro/smoothcb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/transformer-neural-processes-uncertainty","slug":"transformer-neural-processes-uncertainty","title":"Transformer Neural Processes: Uncertainty-Aware Meta Learning Via Sequence Modeling","date":"2022-07-09","arxiv_id":"2207.04179","repositories_listed":1,"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/transformer-neural-processes-uncertainty#ran","syntology_url":"https://syntology.ai/paper/2207.04179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04179"}},"official":{"repos":["tung-nd/tnp-pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"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/on-private-online-convex-optimization-optimal","slug":"on-private-online-convex-optimization-optimal","title":"On Private Online Convex Optimization: Optimal Algorithms in $\\ell_p$-Geometry and High Dimensional Contextual Bandits","date":"2022-06-16","arxiv_id":"2206.08111","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-private-online-convex-optimization-optimal#ran","syntology_url":"https://syntology.ai/paper/2206.08111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08111"}},"official":{"repos":["liangzp/dp-streaming-sco"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/group-meritocratic-fairness-in-linear","slug":"group-meritocratic-fairness-in-linear","title":"Group Meritocratic Fairness in Linear Contextual Bandits","date":"2022-06-07","arxiv_id":"2206.03150","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/group-meritocratic-fairness-in-linear#ran","syntology_url":"https://syntology.ai/paper/2206.03150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03150"}},"official":{"repos":["csml-iit-ucl/gmfbandits"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/optimistic-whittle-index-policy-online","slug":"optimistic-whittle-index-policy-online","title":"Optimistic Whittle Index Policy: Online Learning for Restless Bandits","date":"2022-05-30","arxiv_id":"2205.15372","repositories_listed":1,"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/optimistic-whittle-index-policy-online#ran","syntology_url":"https://syntology.ai/paper/2205.15372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15372"}},"official":{"repos":["lily-x/online-rmab"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/off-policy-evaluation-for-large-action-spaces","slug":"off-policy-evaluation-for-large-action-spaces","title":"Off-Policy Evaluation for Large Action Spaces via Embeddings","date":"2022-02-13","arxiv_id":"2202.06317","repositories_listed":3,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/off-policy-evaluation-for-large-action-spaces#ran","syntology_url":"https://syntology.ai/paper/2202.06317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06317"}},"official":{"repos":["st-tech/zr-obp","usaito/icml2022-mips"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/offline-neural-contextual-bandits-pessimism-1","slug":"offline-neural-contextual-bandits-pessimism-1","title":"Offline Neural Contextual Bandits: Pessimism, Optimization and Generalization","date":"2021-11-27","arxiv_id":"2111.13807","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"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 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) · 3 unverified","sample_list":"/paper/offline-neural-contextual-bandits-pessimism-1#ran","syntology_url":"https://syntology.ai/paper/2111.13807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.13807"}},"official":{"repos":["thanhnguyentang/offline_neural_bandits"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/heterogeneous-multi-player-multi-armed","slug":"heterogeneous-multi-player-multi-armed","title":"Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization","date":"2021-10-27","arxiv_id":"2110.14622","repositories_listed":1,"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":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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/heterogeneous-multi-player-multi-armed#ran","syntology_url":"https://syntology.ai/paper/2110.14622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14622"}},"official":{"repos":["shengroup/mpmab_beacon"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/almost-free-incentivized-exploration-from","slug":"almost-free-incentivized-exploration-from","title":"(Almost) Free Incentivized Exploration from Decentralized Learning Agents","date":"2021-10-27","arxiv_id":"2110.14628","repositories_listed":1,"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/almost-free-incentivized-exploration-from#ran","syntology_url":"https://syntology.ai/paper/2110.14628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14628"}},"official":{"repos":["shengroup/observe_then_incentivize"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-contextual-bandits-without-regret","slug":"neural-contextual-bandits-without-regret","title":"Neural Contextual Bandits without Regret","date":"2021-07-07","arxiv_id":"2107.03144","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/neural-contextual-bandits-without-regret#ran","syntology_url":"https://syntology.ai/paper/2107.03144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03144"}},"official":{"repos":["pkassraie/NNUCB"],"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/q-learning-lagrange-policies-for-multi-action","slug":"q-learning-lagrange-policies-for-multi-action","title":"Q-Learning Lagrange Policies for Multi-Action Restless Bandits","date":"2021-06-22","arxiv_id":"2106.12024","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/q-learning-lagrange-policies-for-multi-action#ran","syntology_url":"https://syntology.ai/paper/2106.12024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12024"}},"official":{"repos":["killian-34/MAIQL_and_LPQL"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/off-policy-evaluation-via-adaptive-weighting","slug":"off-policy-evaluation-via-adaptive-weighting","title":"Off-Policy Evaluation via Adaptive Weighting with Data from Contextual Bandits","date":"2021-06-03","arxiv_id":"2106.02029","repositories_listed":1,"syntology":{"n":25,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":12,"n_honours":0,"n_violates":1,"n_no_contract":12,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 1 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/off-policy-evaluation-via-adaptive-weighting#ran","syntology_url":"https://syntology.ai/paper/2106.02029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02029"}},"official":{"repos":["gsbDBI/contextual_bandits_evaluation"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-the-long-term-impact-of-ml","slug":"addressing-the-long-term-impact-of-ml","title":"Addressing the Long-term Impact of ML Decisions via Policy Regret","date":"2021-06-02","arxiv_id":"2106.01325","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/addressing-the-long-term-impact-of-ml#ran","syntology_url":"https://syntology.ai/paper/2106.01325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01325"}},"official":{"repos":["david-lindner/single-peaked-bandits"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/policy-learning-with-adaptively-collected","slug":"policy-learning-with-adaptively-collected","title":"Policy Learning with Adaptively Collected Data","date":"2021-05-05","arxiv_id":"2105.02344","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/policy-learning-with-adaptively-collected#ran","syntology_url":"https://syntology.ai/paper/2105.02344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02344"}},"official":{"repos":["gsbDBI/PolicyLearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/online-limited-memory-neural-linear-bandits-1","slug":"online-limited-memory-neural-linear-bandits-1","title":"Online Limited Memory Neural-Linear Bandits with Likelihood Matching","date":"2021-02-07","arxiv_id":"2102.03799","repositories_listed":3,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/online-limited-memory-neural-linear-bandits-1#ran","syntology_url":"https://syntology.ai/paper/2102.03799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03799"}},"official":null}},{"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/dual-mandate-patrols-multi-armed-bandits-for","slug":"dual-mandate-patrols-multi-armed-bandits-for","title":"Dual-Mandate Patrols: Multi-Armed Bandits for Green Security","date":"2020-09-14","arxiv_id":"2009.06560","repositories_listed":2,"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/dual-mandate-patrols-multi-armed-bandits-for#ran","syntology_url":"https://syntology.ai/paper/2009.06560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06560"}},"official":{"repos":["lily-x/dual-mandate"],"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/confident-off-policy-evaluation-and-selection","slug":"confident-off-policy-evaluation-and-selection","title":"Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weighting","date":"2020-06-18","arxiv_id":"2006.10460","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/confident-off-policy-evaluation-and-selection#ran","syntology_url":"https://syntology.ai/paper/2006.10460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10460"}},"official":{"repos":["deepmind/offpolicy_selection_eslb"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/optimal-and-greedy-algorithms-for-multi-armed","slug":"optimal-and-greedy-algorithms-for-multi-armed","title":"The Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms","date":"2020-02-24","arxiv_id":"2002.10121","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/optimal-and-greedy-algorithms-for-multi-armed#ran","syntology_url":"https://syntology.ai/paper/2002.10121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10121"}},"official":{"repos":["khashayarkhv/many-armed-bandit"],"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/persistency-of-excitation-for-robustness-of","slug":"persistency-of-excitation-for-robustness-of","title":"Persistency of Excitation for Robustness of Neural Networks","date":"2019-11-04","arxiv_id":"1911.01043","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/persistency-of-excitation-for-robustness-of#ran","syntology_url":"https://syntology.ai/paper/1911.01043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01043"}},"official":{"repos":["nar-k/persistent-excitation"],"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/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/smoothness-adaptive-stochastic-bandits","slug":"smoothness-adaptive-stochastic-bandits","title":"Smoothness-Adaptive Contextual Bandits","date":"2019-10-22","arxiv_id":"1910.09714","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/smoothness-adaptive-stochastic-bandits#ran","syntology_url":"https://syntology.ai/paper/1910.09714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09714"}},"official":{"repos":["armmn/Smoothness-Adaptive-Contextual-Bandits"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-optimisation-over-multiple","slug":"bayesian-optimisation-over-multiple","title":"Bayesian Optimisation over Multiple Continuous and Categorical Inputs","date":"2019-06-20","arxiv_id":"1906.08878","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bayesian-optimisation-over-multiple#ran","syntology_url":"https://syntology.ai/paper/1906.08878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08878"}},"official":{"repos":["rubinxin/CoCaBO_code"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/empirical-likelihood-for-contextual-bandits","slug":"empirical-likelihood-for-contextual-bandits","title":"Empirical Likelihood for Contextual Bandits","date":"2019-06-07","arxiv_id":"1906.03323","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/empirical-likelihood-for-contextual-bandits#ran","syntology_url":"https://syntology.ai/paper/1906.03323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03323"}},"official":{"repos":["pmineiro/elfcb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/190600531","slug":"190600531","title":"Model selection for contextual bandits","date":"2019-06-03","arxiv_id":"1906.00531","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/190600531#ran","syntology_url":"https://syntology.ai/paper/1906.00531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00531"}},"official":{"repos":["akshaykr/oracle_cb"],"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/decentralized-cooperative-stochastic-multi","slug":"decentralized-cooperative-stochastic-multi","title":"Decentralized Cooperative Stochastic Bandits","date":"2018-10-10","arxiv_id":"1810.04468","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/decentralized-cooperative-stochastic-multi#ran","syntology_url":"https://syntology.ai/paper/1810.04468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04468"}},"official":{"repos":["damaru2/decentralized-bandits"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semiparametric-contextual-bandits","slug":"semiparametric-contextual-bandits","title":"Semiparametric Contextual Bandits","date":"2018-03-12","arxiv_id":"1803.04204","repositories_listed":2,"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/semiparametric-contextual-bandits#ran","syntology_url":"https://syntology.ai/paper/1803.04204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04204"}},"official":{"repos":["akshaykr/oracle_cb"],"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"]}}}],"record_sha256":"6774913029aa6094e128549bb1b8647bd7ec6136051bebf3158e0d646affbe92","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}