{"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","name":"Multi-Armed Bandits","slug":"multi-armed-bandits","description_markdown":"Multi-armed bandits refer to a task where a fixed amount of resources must be allocated between competing resources that maximizes expected gain. Typically these problems involve an exploration/exploitation trade-off.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Microsoft Research](http://research.microsoft.com/en-us/projects/bandits/) )</span>","categories":[{"name":"Methodology","url":"/area/methodology"},{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1262,"papers_with_code":253,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":2,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/multi-armed-bandits-on-mushroom","slug":"multi-armed-bandits-on-mushroom","dataset":"Mushroom","dataset_url":null,"rows_in_archive":2,"metrics":["Cumulative regret"],"first_row_in_archive_order":{"model":"Linear FullPosterior-MR","paper_title":"Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Sampling","paper_url":"/paper/deep-bayesian-bandits-showdown-an-empirical","paper_date":"2018-02-26","arxiv_id":"1802.09127","code_links":[{"title":"tensorflow/models","url":"https://github.com/tensorflow/models"},{"title":"tensorflow/models","url":"https://github.com/tensorflow/models/tree/archive/research/deep_contextual_bandits"},{"title":"mlisicki/neuralkernelbandits","url":"https://github.com/mlisicki/neuralkernelbandits"},{"title":"vectorinstitute/neuralkernelbandits","url":"https://github.com/vectorinstitute/neuralkernelbandits"}],"syntology":null}}],"datasets":[{"url":"/dataset/kuairand","name":"KuaiRand","full_name":"","num_papers_in_archive":42},{"url":"/dataset/duolingo-notifications-data","name":"Duolingo Bandit Notifications","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/thompson-sampling","name":"Thompson Sampling"}],"parent_tasks":[],"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":13,"rows_per_page":100,"shown":100,"of":1262,"of_with_code":253,"tagged_in_all":1262,"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"},"items":[{"url":"/paper/deep-reinforcement-learning-based","slug":"deep-reinforcement-learning-based","title":"Deep Reinforcement Learning based Recommendation with Explicit User-Item Interactions Modeling","date":"2018-10-29","arxiv_id":"1810.12027","repositories_listed":5,"syntology":null},{"url":"/paper/neural-contextual-bandits-with-upper","slug":"neural-contextual-bandits-with-upper","title":"Neural Contextual Bandits with UCB-based Exploration","date":"2019-11-11","arxiv_id":"1911.04462","repositories_listed":4,"syntology":null},{"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/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/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/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/gaussian-gated-linear-networks","slug":"gaussian-gated-linear-networks","title":"Gaussian Gated Linear Networks","date":"2020-06-10","arxiv_id":"2006.05964","repositories_listed":3,"syntology":null},{"url":"/paper/locally-differentially-private-contextual","slug":"locally-differentially-private-contextual","title":"Locally Differentially Private (Contextual) Bandits Learning","date":"2020-06-01","arxiv_id":"2006.00701","repositories_listed":3,"syntology":null},{"url":"/paper/on-line-adaptative-curriculum-learning-for","slug":"on-line-adaptative-curriculum-learning-for","title":"On-line Adaptative Curriculum Learning for GANs","date":"2018-07-31","arxiv_id":"1808.00020","repositories_listed":3,"syntology":null},{"url":"/paper/optimal-and-adaptive-off-policy-evaluation-in","slug":"optimal-and-adaptive-off-policy-evaluation-in","title":"Optimal and Adaptive Off-policy Evaluation in Contextual Bandits","date":"2016-12-04","arxiv_id":"1612.01205","repositories_listed":3,"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/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/an-experimental-design-for-anytime-valid","slug":"an-experimental-design-for-anytime-valid","title":"An Experimental Design for Anytime-Valid Causal Inference on Multi-Armed Bandits","date":"2023-11-09","arxiv_id":"2311.05794","repositories_listed":2,"syntology":null},{"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/truncated-linucb-for-stochastic-linear","slug":"truncated-linucb-for-stochastic-linear","title":"Truncated LinUCB for Stochastic Linear Bandits","date":"2022-02-23","arxiv_id":"2202.11735","repositories_listed":2,"syntology":null},{"url":"/paper/doubly-robust-off-policy-evaluation-for","slug":"doubly-robust-off-policy-evaluation-for","title":"Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Model","date":"2022-02-03","arxiv_id":"2202.01562","repositories_listed":2,"syntology":null},{"url":"/paper/an-empirical-study-of-neural-kernel-bandits","slug":"an-empirical-study-of-neural-kernel-bandits","title":"Empirical analysis of representation learning and exploration in neural kernel bandits","date":"2021-11-05","arxiv_id":"2111.03543","repositories_listed":2,"syntology":null},{"url":"/paper/inverse-contextual-bandits-learning-how","slug":"inverse-contextual-bandits-learning-how","title":"Inverse Contextual Bandits: Learning How Behavior Evolves over Time","date":"2021-07-13","arxiv_id":"2107.06317","repositories_listed":2,"syntology":null},{"url":"/paper/quantile-bandits-for-best-arms-identification","slug":"quantile-bandits-for-best-arms-identification","title":"Quantile Bandits for Best Arms Identification","date":"2020-10-22","arxiv_id":"2010.11568","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/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/bandit-pam-almost-linear-time-k-medoids","slug":"bandit-pam-almost-linear-time-k-medoids","title":"BanditPAM: Almost Linear Time $k$-Medoids Clustering via Multi-Armed Bandits","date":"2020-06-11","arxiv_id":"2006.06856","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":5,"phrase":"0 ran · 5 unverified","sample_list":"/paper/bandit-pam-almost-linear-time-k-medoids#ran","syntology_url":"https://syntology.ai/paper/2006.06856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06856"}},"official":{"repos":["motiwari/BanditPAM-python"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"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/a-modern-introduction-to-online-learning","slug":"a-modern-introduction-to-online-learning","title":"A Modern Introduction to Online Learning","date":"2019-12-31","arxiv_id":"1912.13213","repositories_listed":2,"syntology":null},{"url":"/paper/multi-armed-bandits-with-correlated-arms","slug":"multi-armed-bandits-with-correlated-arms","title":"Multi-Armed Bandits with Correlated Arms","date":"2019-11-06","arxiv_id":"1911.03959","repositories_listed":2,"syntology":null},{"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/intrinsically-efficient-stable-and-bounded","slug":"intrinsically-efficient-stable-and-bounded","title":"Intrinsically Efficient, Stable, and Bounded Off-Policy Evaluation for Reinforcement Learning","date":"2019-06-09","arxiv_id":"1906.03735","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/sic-mmab-synchronisation-involves","slug":"sic-mmab-synchronisation-involves","title":"SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits","date":"2018-09-21","arxiv_id":"1809.08151","repositories_listed":2,"syntology":null},{"url":"/paper/correlated-multi-armed-bandits-with-a-latent","slug":"correlated-multi-armed-bandits-with-a-latent","title":"Correlated Multi-armed Bandits with a Latent Random Source","date":"2018-08-17","arxiv_id":"1808.05904","repositories_listed":2,"syntology":null},{"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"]}}},{"url":"/paper/a-survey-of-online-experiment-design-with-the","slug":"a-survey-of-online-experiment-design-with-the","title":"A Survey of Online Experiment Design with the Stochastic Multi-Armed Bandit","date":"2015-10-02","arxiv_id":"1510.00757","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/multi-armed-bandits-in-metric-spaces","slug":"multi-armed-bandits-in-metric-spaces","title":"Multi-Armed Bandits in Metric Spaces","date":"2008-09-29","arxiv_id":"0809.4882","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-action-duration-with-contextual","slug":"adaptive-action-duration-with-contextual","title":"Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments","date":"2025-06-17","arxiv_id":"2507.00030","repositories_listed":1,"syntology":null},{"url":"/paper/from-theory-to-practice-with-raven-ucb","slug":"from-theory-to-practice-with-raven-ucb","title":"From Theory to Practice with RAVEN-UCB: Addressing Non-Stationarity in Multi-Armed Bandits through Variance Adaptation","date":"2025-06-03","arxiv_id":"2506.02933","repositories_listed":1,"syntology":null},{"url":"/paper/virnyflow-a-design-space-for-responsible","slug":"virnyflow-a-design-space-for-responsible","title":"VirnyFlow: A Design Space for Responsible Model Development","date":"2025-06-02","arxiv_id":"2506.01584","repositories_listed":1,"syntology":null},{"url":"/paper/test-time-scaling-of-diffusion-models-via","slug":"test-time-scaling-of-diffusion-models-via","title":"Test-Time Scaling of Diffusion Models via Noise Trajectory Search","date":"2025-05-24","arxiv_id":"2506.03164","repositories_listed":1,"syntology":null},{"url":"/paper/human-in-the-loop-adaptive-optimization-for","slug":"human-in-the-loop-adaptive-optimization-for","title":"Human in the Loop Adaptive Optimization for Improved Time Series Forecasting","date":"2025-05-21","arxiv_id":"2505.15354","repositories_listed":1,"syntology":null},{"url":"/paper/antithetic-sampling-for-top-k-shapley","slug":"antithetic-sampling-for-top-k-shapley","title":"Antithetic Sampling for Top-k Shapley Identification","date":"2025-04-02","arxiv_id":"2504.02019","repositories_listed":1,"syntology":null},{"url":"/paper/neurosep-cp-lcb-a-deep-learning-based","slug":"neurosep-cp-lcb-a-deep-learning-based","title":"NeuroSep-CP-LCB: A Deep Learning-based Contextual Multi-armed Bandit Algorithm with Uncertainty Quantification for Early Sepsis Prediction","date":"2025-03-20","arxiv_id":"2503.16708","repositories_listed":1,"syntology":null},{"url":"/paper/performance-bounded-online-ensemble-learning","slug":"performance-bounded-online-ensemble-learning","title":"Performance-bounded Online Ensemble Learning Method Based on Multi-armed bandits and Its Applications in Real-time Safety Assessment","date":"2025-03-19","arxiv_id":"2503.15581","repositories_listed":1,"syntology":null},{"url":"/paper/locally-private-nonparametric-contextual","slug":"locally-private-nonparametric-contextual","title":"Locally Private Nonparametric Contextual Multi-armed Bandits","date":"2025-03-11","arxiv_id":"2503.08098","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-in-latent-contextual","slug":"transfer-learning-in-latent-contextual","title":"Transfer Learning in Latent Contextual Bandits with Covariate Shift Through Causal Transportability","date":"2025-02-27","arxiv_id":"2502.20153","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-multi-armed-bandits-with-minimum","slug":"multi-agent-multi-armed-bandits-with-minimum","title":"Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness","date":"2025-02-21","arxiv_id":"2502.15240","repositories_listed":1,"syntology":null},{"url":"/paper/contextual-bandits-with-entropy-based-human","slug":"contextual-bandits-with-entropy-based-human","title":"Contextual bandits with entropy-based human feedback","date":"2025-02-12","arxiv_id":"2502.08759","repositories_listed":1,"syntology":null},{"url":"/paper/from-restless-to-contextual-a-thresholding","slug":"from-restless-to-contextual-a-thresholding","title":"From Restless to Contextual: A Thresholding Bandit Approach to Improve Finite-horizon Performance","date":"2025-02-07","arxiv_id":"2502.05145","repositories_listed":1,"syntology":null},{"url":"/paper/solving-inverse-problem-for-multi-armed","slug":"solving-inverse-problem-for-multi-armed","title":"Solving Inverse Problem for Multi-armed Bandits via Convex Optimization","date":"2025-01-31","arxiv_id":"2501.18945","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-learning-of-the-pareto-front-for","slug":"sequential-learning-of-the-pareto-front-for","title":"Sequential Learning of the Pareto Front for Multi-objective Bandits","date":"2025-01-29","arxiv_id":"2501.17513","repositories_listed":1,"syntology":null},{"url":"/paper/balans-multi-armed-bandits-based-adaptive","slug":"balans-multi-armed-bandits-based-adaptive","title":"Balans: Multi-Armed Bandits-based Adaptive Large Neighborhood Search for Mixed-Integer Programming Problem","date":"2024-12-18","arxiv_id":"2412.14382","repositories_listed":1,"syntology":null},{"url":"/paper/irl-for-restless-multi-armed-bandits-with","slug":"irl-for-restless-multi-armed-bandits-with","title":"IRL for Restless Multi-Armed Bandits with Applications in Maternal and Child Health","date":"2024-12-11","arxiv_id":"2412.08463","repositories_listed":1,"syntology":null},{"url":"/paper/bone-a-unifying-framework-for-bayesian-online","slug":"bone-a-unifying-framework-for-bayesian-online","title":"A unifying framework for generalised Bayesian online learning in non-stationary environments","date":"2024-11-15","arxiv_id":"2411.10153","repositories_listed":1,"syntology":null},{"url":"/paper/multi-armed-bandits-with-missing-outcome","slug":"multi-armed-bandits-with-missing-outcome","title":"Multi-armed Bandits with Missing Outcome","date":"2024-11-08","arxiv_id":"2411.05661","repositories_listed":1,"syntology":null},{"url":"/paper/variance-aware-linear-ucb-with-deep","slug":"variance-aware-linear-ucb-with-deep","title":"Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits","date":"2024-11-08","arxiv_id":"2411.05979","repositories_listed":1,"syntology":null},{"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":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 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; 3 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":2,"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/efficient-function-placement-in-virtual","slug":"efficient-function-placement-in-virtual","title":"Online Learning for Function Placement in Serverless Computing","date":"2024-10-17","arxiv_id":"2410.13696","repositories_listed":1,"syntology":null},{"url":"/paper/laser-learning-to-adaptively-select-reward","slug":"laser-learning-to-adaptively-select-reward","title":"LASeR: Learning to Adaptively Select Reward Models with Multi-Armed Bandits","date":"2024-10-02","arxiv_id":"2410.01735","repositories_listed":1,"syntology":null},{"url":"/paper/performance-aware-self-configurable-multi","slug":"performance-aware-self-configurable-multi","title":"Performance-Aware Self-Configurable Multi-Agent Networks: A Distributed Submodular Approach for Simultaneous Coordination and Network Design","date":"2024-09-02","arxiv_id":"2409.01411","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-multi-armed-bandits-for-the","slug":"hierarchical-multi-armed-bandits-for-the","title":"Hierarchical Multi-Armed Bandits for the Concurrent Intelligent Tutoring of Concepts and Problems of Varying Difficulty Levels","date":"2024-08-10","arxiv_id":"2408.07208","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-exposure-bias-in-online-learning","slug":"mitigating-exposure-bias-in-online-learning","title":"Mitigating Exposure Bias in Online Learning to Rank Recommendation: A Novel Reward Model for Cascading Bandits","date":"2024-08-08","arxiv_id":"2408.04332","repositories_listed":1,"syntology":null},{"url":"/paper/combining-diverse-information-for-coordinated","slug":"combining-diverse-information-for-coordinated","title":"Combining Diverse Information for Coordinated Action: Stochastic Bandit Algorithms for Heterogeneous Agents","date":"2024-08-06","arxiv_id":"2408.03405","repositories_listed":1,"syntology":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/discovering-minimal-reinforcement-learning","slug":"discovering-minimal-reinforcement-learning","title":"Discovering Minimal Reinforcement Learning Environments","date":"2024-06-18","arxiv_id":"2406.12589","repositories_listed":1,"syntology":null},{"url":"/paper/linear-contextual-bandits-with-hybrid-payoff","slug":"linear-contextual-bandits-with-hybrid-payoff","title":"Linear Contextual Bandits with Hybrid Payoff: Revisited","date":"2024-06-14","arxiv_id":"2406.10131","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-batched-linear-bandits","slug":"optimal-batched-linear-bandits","title":"Optimal Batched Linear Bandits","date":"2024-06-06","arxiv_id":"2406.04137","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/optimal-batched-linear-bandits#ran","syntology_url":"https://syntology.ai/paper/2406.04137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04137"}},"official":{"repos":["panxulab/optimal-batched-linear-bandits"],"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/causal-contextual-bandits-with-adaptive","slug":"causal-contextual-bandits-with-adaptive","title":"Causal Contextual Bandits with Adaptive Context","date":"2024-05-28","arxiv_id":"2405.18626","repositories_listed":1,"syntology":null},{"url":"/paper/multi-armed-bandits-with-network-interference","slug":"multi-armed-bandits-with-network-interference","title":"Multi-Armed Bandits with Network Interference","date":"2024-05-28","arxiv_id":"2405.18621","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-baseline-corrections-for-off-policy","slug":"optimal-baseline-corrections-for-off-policy","title":"Optimal Baseline Corrections for Off-Policy Contextual Bandits","date":"2024-05-09","arxiv_id":"2405.05736","repositories_listed":1,"syntology":null},{"url":"/paper/causally-abstracted-multi-armed-bandits","slug":"causally-abstracted-multi-armed-bandits","title":"Causally Abstracted Multi-armed Bandits","date":"2024-04-26","arxiv_id":"2404.17493","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-decision-making-with-expert","slug":"sequential-decision-making-with-expert","title":"Sequential Decision Making with Expert Demonstrations under Unobserved Heterogeneity","date":"2024-04-10","arxiv_id":"2404.07266","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-bandits-via-tight-two-to-infinity","slug":"low-rank-bandits-via-tight-two-to-infinity","title":"Low-Rank Bandits via Tight Two-to-Infinity Singular Subspace Recovery","date":"2024-02-24","arxiv_id":"2402.15739","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-of-exposure-in-online-restless-multi","slug":"fairness-of-exposure-in-online-restless-multi","title":"Fairness of Exposure in Online Restless Multi-armed Bandits","date":"2024-02-09","arxiv_id":"2402.06348","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneously-achieving-group-exposure","slug":"simultaneously-achieving-group-exposure","title":"Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits","date":"2024-02-08","arxiv_id":"2402.05575","repositories_listed":1,"syntology":null},{"url":"/paper/off-policy-evaluation-of-slate-bandit","slug":"off-policy-evaluation-of-slate-bandit","title":"Off-Policy Evaluation of Slate Bandit Policies via Optimizing Abstraction","date":"2024-02-03","arxiv_id":"2402.02171","repositories_listed":1,"syntology":null},{"url":"/paper/falcon-fair-active-learning-using-multi-armed","slug":"falcon-fair-active-learning-using-multi-armed","title":"Falcon: Fair Active Learning using Multi-armed Bandits","date":"2024-01-23","arxiv_id":"2401.12722","repositories_listed":1,"syntology":null},{"url":"/paper/distributionally-robust-policy-evaluation","slug":"distributionally-robust-policy-evaluation","title":"Distributionally Robust Policy Evaluation under General Covariate Shift in Contextual Bandits","date":"2024-01-21","arxiv_id":"2401.11353","repositories_listed":1,"syntology":null},{"url":"/paper/let-s-get-it-started-fostering-the","slug":"let-s-get-it-started-fostering-the","title":"Let's Get It Started: Fostering the Discoverability of New Releases on Deezer","date":"2024-01-05","arxiv_id":"2401.02827","repositories_listed":1,"syntology":null},{"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":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 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; 1 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":1,"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/best-arm-identification-with-fixed-budget-a-1","slug":"best-arm-identification-with-fixed-budget-a-1","title":"Best Arm Identification with Fixed Budget: A Large Deviation Perspective","date":"2023-12-19","arxiv_id":"2312.12137","repositories_listed":1,"syntology":null},{"url":"/paper/risk-aware-continuous-control-with-neural","slug":"risk-aware-continuous-control-with-neural","title":"Risk-Aware Continuous Control with Neural Contextual Bandits","date":"2023-12-15","arxiv_id":"2312.09961","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/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":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 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; 1 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":1,"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/near-optimal-pure-exploration-in-matrix-games","slug":"near-optimal-pure-exploration-in-matrix-games","title":"Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits","date":"2023-10-25","arxiv_id":"2310.16252","repositories_listed":1,"syntology":null},{"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/bayesian-design-principles-for-frequentist","slug":"bayesian-design-principles-for-frequentist","title":"Bayesian Design Principles for Frequentist Sequential Learning","date":"2023-10-01","arxiv_id":"2310.00806","repositories_listed":1,"syntology":null},{"url":"/paper/a-convex-framework-for-confounding-robust","slug":"a-convex-framework-for-confounding-robust","title":"A Convex Framework for Confounding Robust Inference","date":"2023-09-21","arxiv_id":"2309.12450","repositories_listed":1,"syntology":null},{"url":"/paper/master-slave-deep-architecture-for-top-k","slug":"master-slave-deep-architecture-for-top-k","title":"Master-slave Deep Architecture for Top-K Multi-armed Bandits with Non-linear Bandit Feedback and Diversity Constraints","date":"2023-08-24","arxiv_id":"2308.12680","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/equitable-restless-multi-armed-bandits-a","slug":"equitable-restless-multi-armed-bandits-a","title":"Equitable Restless Multi-Armed Bandits: A General Framework Inspired By Digital Health","date":"2023-08-17","arxiv_id":"2308.09726","repositories_listed":1,"syntology":null},{"url":"/paper/online-matching-a-real-time-bandit-system-for","slug":"online-matching-a-real-time-bandit-system-for","title":"Online Matching: A Real-time Bandit System for Large-scale Recommendations","date":"2023-07-29","arxiv_id":"2307.15893","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/adaptive-linear-estimating-equations","slug":"adaptive-linear-estimating-equations","title":"Adaptive Linear Estimating Equations","date":"2023-07-14","arxiv_id":"2307.07320","repositories_listed":1,"syntology":null},{"url":"/paper/budgeted-multi-armed-bandits-with-asymmetric","slug":"budgeted-multi-armed-bandits-with-asymmetric","title":"Budgeted Multi-Armed Bandits with Asymmetric Confidence Intervals","date":"2023-06-12","arxiv_id":"2306.07071","repositories_listed":1,"syntology":null},{"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"]}}}],"syntology_records":25,"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":55,"papers_where_code_ran_first_page":"/task/multi-armed-bandits/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":13,"url":"/task/multi-armed-bandits/papers/2","json":"/task/multi-armed-bandits/papers/2.json","rows":100},{"order":"archive","page":3,"of":13,"url":"/task/multi-armed-bandits/papers/3","json":"/task/multi-armed-bandits/papers/3.json","rows":100},{"order":"archive","page":4,"of":13,"url":"/task/multi-armed-bandits/papers/4","json":"/task/multi-armed-bandits/papers/4.json","rows":100},{"order":"archive","page":5,"of":13,"url":"/task/multi-armed-bandits/papers/5","json":"/task/multi-armed-bandits/papers/5.json","rows":100},{"order":"archive","page":6,"of":13,"url":"/task/multi-armed-bandits/papers/6","json":"/task/multi-armed-bandits/papers/6.json","rows":100},{"order":"archive","page":7,"of":13,"url":"/task/multi-armed-bandits/papers/7","json":"/task/multi-armed-bandits/papers/7.json","rows":100},{"order":"archive","page":8,"of":13,"url":"/task/multi-armed-bandits/papers/8","json":"/task/multi-armed-bandits/papers/8.json","rows":100},{"order":"archive","page":9,"of":13,"url":"/task/multi-armed-bandits/papers/9","json":"/task/multi-armed-bandits/papers/9.json","rows":100},{"order":"archive","page":10,"of":13,"url":"/task/multi-armed-bandits/papers/10","json":"/task/multi-armed-bandits/papers/10.json","rows":100},{"order":"archive","page":11,"of":13,"url":"/task/multi-armed-bandits/papers/11","json":"/task/multi-armed-bandits/papers/11.json","rows":100},{"order":"archive","page":12,"of":13,"url":"/task/multi-armed-bandits/papers/12","json":"/task/multi-armed-bandits/papers/12.json","rows":100},{"order":"archive","page":13,"of":13,"url":"/task/multi-armed-bandits/papers/13","json":"/task/multi-armed-bandits/papers/13.json","rows":62},{"order":"ran","page":1,"of":1,"url":"/task/multi-armed-bandits/papers/ran/1","json":"/task/multi-armed-bandits/papers/ran/1.json","rows":55}],"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":"3a2320f6ba3d8b4ad13e525bc3787bcc2234b734ffa2806fd0cedf4b4306bcef","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}