{"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","name":"Thompson Sampling","slug":"thompson-sampling","description_markdown":"Thompson sampling, named after William R. Thompson, is a heuristic for choosing actions that addresses the exploration-exploitation dilemma in the multi-armed bandit problem. It consists of choosing the action that maximizes the expected reward with respect to a randomly drawn belief.","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":655,"papers_with_code":135,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/multi-armed-bandits","name":"Multi-Armed Bandits"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":7,"rows_per_page":100,"shown":100,"of":655,"of_with_code":135,"tagged_in_all":655,"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"},"items":[{"url":"/paper/deep-bayesian-bandits-showdown-an-empirical","slug":"deep-bayesian-bandits-showdown-an-empirical","title":"Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Sampling","date":"2018-02-26","arxiv_id":"1802.09127","repositories_listed":4,"syntology":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/dynamic-slate-recommendation-with-gated","slug":"dynamic-slate-recommendation-with-gated","title":"Dynamic Slate Recommendation with Gated Recurrent Units and Thompson Sampling","date":"2021-04-30","arxiv_id":"2104.15046","repositories_listed":2,"syntology":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/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/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/near-optimal-oracle-efficient-algorithms-for","slug":"near-optimal-oracle-efficient-algorithms-for","title":"Randomized Exploration for Non-Stationary Stochastic Linear Bandits","date":"2019-12-11","arxiv_id":"1912.05695","repositories_listed":2,"syntology":null},{"url":"/paper/adapting-multi-armed-bandits-policies-to","slug":"adapting-multi-armed-bandits-policies-to","title":"Adapting multi-armed bandits policies to contextual bandits scenarios","date":"2018-11-11","arxiv_id":"1811.04383","repositories_listed":2,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 5 unverified","sample_list":"/paper/adapting-multi-armed-bandits-policies-to#ran","syntology_url":"https://syntology.ai/paper/1811.04383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.04383"}},"official":{"repos":["david-cortes/contextualbandits"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/randomized-value-functions-via-multiplicative","slug":"randomized-value-functions-via-multiplicative","title":"Randomized Value Functions via Multiplicative Normalizing Flows","date":"2018-06-06","arxiv_id":"1806.02315","repositories_listed":2,"syntology":null},{"url":"/paper/a-tutorial-on-thompson-sampling","slug":"a-tutorial-on-thompson-sampling","title":"A Tutorial on Thompson Sampling","date":"2017-07-07","arxiv_id":"1707.02038","repositories_listed":2,"syntology":null},{"url":"/paper/thompson-sampling-for-contextual-bandits-with","slug":"thompson-sampling-for-contextual-bandits-with","title":"Thompson Sampling for Contextual Bandits with Linear Payoffs","date":"2012-09-15","arxiv_id":"1209.3352","repositories_listed":2,"syntology":null},{"url":"/paper/representative-action-selection-for-large","slug":"representative-action-selection-for-large","title":"Representative Action Selection for Large Action-Space Meta-Bandits","date":"2025-05-23","arxiv_id":"2505.18269","repositories_listed":1,"syntology":null},{"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/dynamic-assortment-selection-and-pricing-with","slug":"dynamic-assortment-selection-and-pricing-with","title":"Dynamic Assortment Selection and Pricing with Censored Preference Feedback","date":"2025-04-03","arxiv_id":"2504.02324","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/dynamic-assortment-selection-and-pricing-with#ran","syntology_url":"https://syntology.ai/paper/2504.02324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.02324"}},"official":{"repos":["junghunkim7786/dynamicassortmentselectionpricing"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/2503-01163","slug":"2503-01163","title":"Bandit-Based Prompt Design Strategy Selection Improves Prompt Optimizers","date":"2025-03-03","arxiv_id":"2503.01163","repositories_listed":1,"syntology":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/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/minimum-empirical-divergence-for-sub-gaussian","slug":"minimum-empirical-divergence-for-sub-gaussian","title":"Minimum Empirical Divergence for Sub-Gaussian Linear Bandits","date":"2024-10-31","arxiv_id":"2411.00229","repositories_listed":1,"syntology":null},{"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":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 0 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/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":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distributed-thompson-sampling-under","slug":"distributed-thompson-sampling-under","title":"Distributed Thompson sampling under constrained communication","date":"2024-10-21","arxiv_id":"2410.15543","repositories_listed":1,"syntology":null},{"url":"/paper/queueing-matching-bandits-with-preference","slug":"queueing-matching-bandits-with-preference","title":"Queueing Matching Bandits with Preference Feedback","date":"2024-10-14","arxiv_id":"2410.10098","repositories_listed":1,"syntology":null},{"url":"/paper/batched-bayesian-optimization-with-correlated","slug":"batched-bayesian-optimization-with-correlated","title":"Batched Bayesian optimization by maximizing the probability of including the optimum","date":"2024-10-08","arxiv_id":"2410.06333","repositories_listed":1,"syntology":null},{"url":"/paper/thompson-sampling-for-combinatorial-bandits","slug":"thompson-sampling-for-combinatorial-bandits","title":"Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox","date":"2024-10-07","arxiv_id":"2410.05441","repositories_listed":1,"syntology":null},{"url":"/paper/improving-portfolio-optimization-results-with","slug":"improving-portfolio-optimization-results-with","title":"Improving Portfolio Optimization Results with Bandit Networks","date":"2024-10-05","arxiv_id":"2410.04217","repositories_listed":1,"syntology":null},{"url":"/paper/constructing-adversarial-examples-for","slug":"constructing-adversarial-examples-for","title":"Constructing Adversarial Examples for Vertical Federated Learning: Optimal Client Corruption through Multi-Armed Bandit","date":"2024-08-08","arxiv_id":"2408.04310","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02960","slug":"2408-02960","title":"Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic","date":"2024-08-06","arxiv_id":"2408.02960","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02551","slug":"2408-02551","title":"Process-constrained batch Bayesian approaches for yield optimization in multi-reactor systems","date":"2024-08-05","arxiv_id":"2408.02551","repositories_listed":1,"syntology":null},{"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":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 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; 1 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":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-bayesian-approach-to-online-planning","slug":"a-bayesian-approach-to-online-planning","title":"A Bayesian Approach to Online Planning","date":"2024-06-04","arxiv_id":"2406.02103","repositories_listed":1,"syntology":null},{"url":"/paper/on-bits-and-bandits-quantifying-the-regret","slug":"on-bits-and-bandits-quantifying-the-regret","title":"On Bits and Bandits: Quantifying the Regret-Information Trade-off","date":"2024-05-26","arxiv_id":"2405.16581","repositories_listed":1,"syntology":null},{"url":"/paper/constructing-adversarial-examples-for-1","slug":"constructing-adversarial-examples-for-1","title":"Constructing Adversarial Examples for Vertical Federated Learning: Optimal Client Corruption through Multi-Armed Bandit","date":"2024-05-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/online-learning-of-decision-trees-with","slug":"online-learning-of-decision-trees-with","title":"Online Learning of Decision Trees with Thompson Sampling","date":"2024-04-09","arxiv_id":"2404.06403","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/online-learning-of-decision-trees-with#ran","syntology_url":"https://syntology.ai/paper/2404.06403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06403"}},"official":{"repos":["chaoukia/thompson-sampling-decision-trees"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"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/adaptive-anytime-multi-agent-path-finding","slug":"adaptive-anytime-multi-agent-path-finding","title":"Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search","date":"2023-12-28","arxiv_id":"2312.16767","repositories_listed":1,"syntology":null},{"url":"/paper/finite-time-frequentist-regret-bounds-of","slug":"finite-time-frequentist-regret-bounds-of","title":"Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs","date":"2023-12-24","arxiv_id":"2312.15549","repositories_listed":1,"syntology":null},{"url":"/paper/debiased-machine-learning-and-network","slug":"debiased-machine-learning-and-network","title":"RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions","date":"2023-12-11","arxiv_id":"2312.06403","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-interventions-with-user-defined","slug":"adaptive-interventions-with-user-defined","title":"Adaptive Interventions with User-Defined Goals for Health Behavior Change","date":"2023-11-16","arxiv_id":"2311.09483","repositories_listed":1,"syntology":null},{"url":"/paper/qpots-efficient-batch-multiobjective-bayesian","slug":"qpots-efficient-batch-multiobjective-bayesian","title":"qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling","date":"2023-10-24","arxiv_id":"2310.15788","repositories_listed":1,"syntology":null},{"url":"/paper/using-adaptive-bandit-experiments-to-increase","slug":"using-adaptive-bandit-experiments-to-increase","title":"Using Adaptive Bandit Experiments to Increase and Investigate Engagement in Mental Health","date":"2023-10-13","arxiv_id":"2310.18326","repositories_listed":1,"syntology":null},{"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":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"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/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":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simple-modification-of-the-upper-confidence","slug":"simple-modification-of-the-upper-confidence","title":"Simple Modification of the Upper Confidence Bound Algorithm by Generalized Weighted Averages","date":"2023-08-28","arxiv_id":"2308.14350","repositories_listed":1,"syntology":null},{"url":"/paper/cost-efficient-online-decision-making-a","slug":"cost-efficient-online-decision-making-a","title":"Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach","date":"2023-08-21","arxiv_id":"2308.10699","repositories_listed":1,"syntology":null},{"url":"/paper/vits-variational-inference-thomson-sampling","slug":"vits-variational-inference-thomson-sampling","title":"VITS : Variational Inference Thompson Sampling for contextual bandits","date":"2023-07-19","arxiv_id":"2307.10167","repositories_listed":1,"syntology":null},{"url":"/paper/relu-to-the-rescue-improve-your-on-policy","slug":"relu-to-the-rescue-improve-your-on-policy","title":"ReLU to the Rescue: Improve Your On-Policy Actor-Critic with Positive Advantages","date":"2023-06-02","arxiv_id":"2306.01460","repositories_listed":1,"syntology":null},{"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/trajectory-oriented-optimization-of","slug":"trajectory-oriented-optimization-of","title":"Trajectory-oriented optimization of stochastic epidemiological models","date":"2023-05-06","arxiv_id":"2305.03926","repositories_listed":1,"syntology":null},{"url":"/paper/neural-exploitation-and-exploration-of","slug":"neural-exploitation-and-exploration-of","title":"Neural Exploitation and Exploration of Contextual Bandits","date":"2023-05-05","arxiv_id":"2305.03784","repositories_listed":1,"syntology":null},{"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/approximate-thompson-sampling-via-epistemic","slug":"approximate-thompson-sampling-via-epistemic","title":"Approximate Thompson Sampling via Epistemic Neural Networks","date":"2023-02-18","arxiv_id":"2302.09205","repositories_listed":1,"syntology":null},{"url":"/paper/double-matching-under-complementary","slug":"double-matching-under-complementary","title":"Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints","date":"2023-01-24","arxiv_id":"2301.10230","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/double-matching-under-complementary#ran","syntology_url":"https://syntology.ai/paper/2301.10230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10230"}},"official":{"repos":["likelyt/double-matching"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/differentially-private-online-bayesian","slug":"differentially-private-online-bayesian","title":"Differentially Private Online Bayesian Estimation With Adaptive Truncation","date":"2023-01-19","arxiv_id":"2301.08202","repositories_listed":1,"syntology":null},{"url":"/paper/neural-bandits-for-data-mining-searching-for","slug":"neural-bandits-for-data-mining-searching-for","title":"Neural Bandits for Data Mining: Searching for Dangerous Polypharmacy","date":"2022-12-10","arxiv_id":"2212.05190","repositories_listed":1,"syntology":null},{"url":"/paper/thompson-sampling-for-high-dimensional-sparse","slug":"thompson-sampling-for-high-dimensional-sparse","title":"Thompson Sampling for High-Dimensional Sparse Linear Contextual Bandits","date":"2022-11-11","arxiv_id":"2211.05964","repositories_listed":1,"syntology":null},{"url":"/paper/atlas-automate-online-service-configuration","slug":"atlas-automate-online-service-configuration","title":"Atlas: Automate Online Service Configuration in Network Slicing","date":"2022-10-30","arxiv_id":"2210.16902","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-pessimism-in-dynamic-treatment","slug":"optimizing-pessimism-in-dynamic-treatment","title":"Optimizing Pessimism in Dynamic Treatment Regimes: A Bayesian Learning Approach","date":"2022-10-26","arxiv_id":"2210.14420","repositories_listed":1,"syntology":null},{"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/causal-bandits-for-linear-structural-equation","slug":"causal-bandits-for-linear-structural-equation","title":"Causal Bandits for Linear Structural Equation Models","date":"2022-08-26","arxiv_id":"2208.12764","repositories_listed":1,"syntology":null},{"url":"/paper/ranking-in-contextual-multi-armed-bandits","slug":"ranking-in-contextual-multi-armed-bandits","title":"Ranking In Generalized Linear Bandits","date":"2022-06-30","arxiv_id":"2207.00109","repositories_listed":1,"syntology":null},{"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/on-provably-robust-meta-bayesian-optimization","slug":"on-provably-robust-meta-bayesian-optimization","title":"On Provably Robust Meta-Bayesian Optimization","date":"2022-06-14","arxiv_id":"2206.06872","repositories_listed":1,"syntology":null},{"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/optimality-conditions-and-algorithms-for-top","slug":"optimality-conditions-and-algorithms-for-top","title":"Information-Directed Selection for Top-Two Algorithms","date":"2022-05-24","arxiv_id":"2205.12086","repositories_listed":1,"syntology":null},{"url":"/paper/evolutionary-multi-armed-bandits-with-genetic","slug":"evolutionary-multi-armed-bandits-with-genetic","title":"Evolutionary Multi-Armed Bandits with Genetic Thompson Sampling","date":"2022-04-26","arxiv_id":"2205.10113","repositories_listed":1,"syntology":null},{"url":"/paper/thompson-sampling-for-bandit-learning-in","slug":"thompson-sampling-for-bandit-learning-in","title":"Thompson Sampling for Bandit Learning in Matching Markets","date":"2022-04-26","arxiv_id":"2204.12048","repositories_listed":1,"syntology":null},{"url":"/paper/multi-armed-bandits-for-online-optimization","slug":"multi-armed-bandits-for-online-optimization","title":"Multi-armed bandits for resource efficient, online optimization of language model pre-training: the use case of dynamic masking","date":"2022-03-24","arxiv_id":"2203.13151","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-bayesian-optimization-using-vecchia","slug":"scalable-bayesian-optimization-using-vecchia","title":"Scalable Bayesian Optimization Using Vecchia Approximations of Gaussian Processes","date":"2022-03-02","arxiv_id":"2203.01459","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-linear-bandits-for-large-scale","slug":"bayesian-linear-bandits-for-large-scale","title":"Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systems","date":"2022-02-07","arxiv_id":"2202.03167","repositories_listed":1,"syntology":null},{"url":"/paper/tsetlin-machine-for-solving-contextual-bandit","slug":"tsetlin-machine-for-solving-contextual-bandit","title":"Tsetlin Machine for Solving Contextual Bandit Problems","date":"2022-02-04","arxiv_id":"2202.01914","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-deep-vs-wide-deep-learners-as","slug":"evaluating-deep-vs-wide-deep-learners-as","title":"Evaluating Deep Vs. Wide & Deep Learners As Contextual Bandits For Personalized Email Promo Recommendations","date":"2022-01-31","arxiv_id":"2202.00146","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-regret-is-achievable-with-bounded-1","slug":"optimal-regret-is-achievable-with-bounded-1","title":"Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework","date":"2022-01-31","arxiv_id":"2201.12955","repositories_listed":1,"syntology":null},{"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/optimizing-conditional-value-at-risk-of-black","slug":"optimizing-conditional-value-at-risk-of-black","title":"Optimizing Conditional Value-At-Risk of Black-Box Functions","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/escada-efficient-safety-and-context-aware","slug":"escada-efficient-safety-and-context-aware","title":"ESCADA: Efficient Safety and Context Aware Dose Allocation for Precision Medicine","date":"2021-11-26","arxiv_id":"2111.13415","repositories_listed":1,"syntology":null},{"url":"/paper/show-me-the-whole-world-towards-entire-item","slug":"show-me-the-whole-world-towards-entire-item","title":"Show Me the Whole World: Towards Entire Item Space Exploration for Interactive Personalized Recommendations","date":"2021-10-19","arxiv_id":"2110.09905","repositories_listed":1,"syntology":null},{"url":"/paper/ee-net-exploitation-exploration-neural","slug":"ee-net-exploitation-exploration-neural","title":"EE-Net: Exploitation-Exploration Neural Networks in Contextual Bandits","date":"2021-10-07","arxiv_id":"2110.03177","repositories_listed":1,"syntology":null},{"url":"/paper/vaccine-allocation-policy-optimization-and","slug":"vaccine-allocation-policy-optimization-and","title":"Vaccine allocation policy optimization and budget sharing mechanism using Thompson sampling","date":"2021-09-21","arxiv_id":"2109.10004","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-for-online-algorithm","slug":"machine-learning-for-online-algorithm","title":"Machine Learning for Online Algorithm Selection under Censored Feedback","date":"2021-09-13","arxiv_id":"2109.06234","repositories_listed":1,"syntology":null},{"url":"/paper/a-unifying-theory-of-thompson-sampling-for","slug":"a-unifying-theory-of-thompson-sampling-for","title":"A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits","date":"2021-08-25","arxiv_id":"2108.11345","repositories_listed":1,"syntology":null},{"url":"/paper/deep-bandits-show-off-simple-and-efficient","slug":"deep-bandits-show-off-simple-and-efficient","title":"Deep Bandits Show-Off: Simple and Efficient Exploration with Deep Networks","date":"2021-05-10","arxiv_id":"2105.04683","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-optimal-selection-for-composited","slug":"efficient-optimal-selection-for-composited","title":"Efficient Optimal Selection for Composited Advertising Creatives with Tree Structure","date":"2021-03-02","arxiv_id":"2103.01453","repositories_listed":1,"syntology":null},{"url":"/paper/automated-creative-optimization-for-e","slug":"automated-creative-optimization-for-e","title":"Automated Creative Optimization for E-Commerce Advertising","date":"2021-02-28","arxiv_id":"2103.00436","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-suboptimality-of-thompson-sampling-in","slug":"on-the-suboptimality-of-thompson-sampling-in","title":"On the Suboptimality of Thompson Sampling in High Dimensions","date":"2021-02-10","arxiv_id":"2102.05502","repositories_listed":1,"syntology":null},{"url":"/paper/state-aware-variational-thompson-sampling-for","slug":"state-aware-variational-thompson-sampling-for","title":"State-Aware Variational Thompson Sampling for Deep Q-Networks","date":"2021-02-07","arxiv_id":"2102.03719","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-evaluation-of-active-inference","slug":"an-empirical-evaluation-of-active-inference","title":"An empirical evaluation of active inference in multi-armed bandits","date":"2021-01-21","arxiv_id":"2101.08699","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-optimization-for-wind-farm-control","slug":"scalable-optimization-for-wind-farm-control","title":"Scalable Optimization for Wind Farm Control using Coordination Graphs","date":"2021-01-19","arxiv_id":"2101.07844","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-play-imperfect-information-games","slug":"learning-to-play-imperfect-information-games","title":"Learning to Play Imperfect-Information Games by Imitating an Oracle Planner","date":"2020-12-22","arxiv_id":"2012.12186","repositories_listed":1,"syntology":null},{"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/thompson-sampling-for-cvar-bandits","slug":"thompson-sampling-for-cvar-bandits","title":"Optimal Thompson Sampling strategies for support-aware CVaR bandits","date":"2020-12-10","arxiv_id":"2012.05754","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-active-search-using-realistic","slug":"multi-agent-active-search-using-realistic","title":"Multi-Agent Active Search using Realistic Depth-Aware Noise Model","date":"2020-11-09","arxiv_id":"2011.04825","repositories_listed":1,"syntology":null},{"url":"/paper/multi-armed-bandits-with-cost-subsidy","slug":"multi-armed-bandits-with-cost-subsidy","title":"Multi-armed Bandits with Cost Subsidy","date":"2020-11-03","arxiv_id":"2011.01488","repositories_listed":1,"syntology":null},{"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/bayesian-algorithms-for-decentralized","slug":"bayesian-algorithms-for-decentralized","title":"Bayesian Algorithms for Decentralized Stochastic Bandits","date":"2020-10-20","arxiv_id":"2010.10569","repositories_listed":1,"syntology":null},{"url":"/paper/federated-bayesian-optimization-via-thompson","slug":"federated-bayesian-optimization-via-thompson","title":"Federated Bayesian Optimization via Thompson Sampling","date":"2020-10-20","arxiv_id":"2010.10154","repositories_listed":1,"syntology":null},{"url":"/paper/asynchronous-e-greedy-bayesian-optimisation","slug":"asynchronous-e-greedy-bayesian-optimisation","title":"Asynchronous ε-Greedy Bayesian Optimisation","date":"2020-10-15","arxiv_id":"2010.07615","repositories_listed":1,"syntology":null},{"url":"/paper/seamlessly-unifying-attributes-and-items","slug":"seamlessly-unifying-attributes-and-items","title":"Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users","date":"2020-05-23","arxiv_id":"2005.12979","repositories_listed":1,"syntology":null},{"url":"/paper/thompson-sampling-for-linearly-constrained","slug":"thompson-sampling-for-linearly-constrained","title":"Thompson Sampling for Linearly Constrained Bandits","date":"2020-04-20","arxiv_id":"2004.09258","repositories_listed":1,"syntology":null}],"syntology_records":27,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":30,"papers_where_code_ran_first_page":"/task/thompson-sampling/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":7,"url":"/task/thompson-sampling/papers/2","json":"/task/thompson-sampling/papers/2.json","rows":100},{"order":"archive","page":3,"of":7,"url":"/task/thompson-sampling/papers/3","json":"/task/thompson-sampling/papers/3.json","rows":100},{"order":"archive","page":4,"of":7,"url":"/task/thompson-sampling/papers/4","json":"/task/thompson-sampling/papers/4.json","rows":100},{"order":"archive","page":5,"of":7,"url":"/task/thompson-sampling/papers/5","json":"/task/thompson-sampling/papers/5.json","rows":100},{"order":"archive","page":6,"of":7,"url":"/task/thompson-sampling/papers/6","json":"/task/thompson-sampling/papers/6.json","rows":100},{"order":"archive","page":7,"of":7,"url":"/task/thompson-sampling/papers/7","json":"/task/thompson-sampling/papers/7.json","rows":55},{"order":"ran","page":1,"of":1,"url":"/task/thompson-sampling/papers/ran/1","json":"/task/thompson-sampling/papers/ran/1.json","rows":30}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"f74859de6c344efcc010c6bc6e817e73f1a3ed39cdbaba164e0ec15285f4af83","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}