These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
113 related articles for article (PubMed ID: 34587093)
1. Self-Unaware Adversarial Multi-Armed Bandits With Switching Costs. Alipour-Fanid A; Dabaghchian M; Zeng K IEEE Trans Neural Netw Learn Syst; 2023 Jun; 34(6):2908-2922. PubMed ID: 34587093 [TBL] [Abstract][Full Text] [Related]
2. An Optimal Algorithm for the Stochastic Bandits While Knowing the Near-Optimal Mean Reward. Yang S; Gao Y IEEE Trans Neural Netw Learn Syst; 2021 May; 32(5):2285-2291. PubMed ID: 32479408 [TBL] [Abstract][Full Text] [Related]
3. Overtaking method based on sand-sifter mechanism: Why do optimistic value functions find optimal solutions in multi-armed bandit problems? Ochi K; Kamiura M Biosystems; 2015 Sep; 135():55-65. PubMed ID: 26166266 [TBL] [Abstract][Full Text] [Related]
4. Understanding the stochastic dynamics of sequential decision-making processes: A path-integral analysis of multi-armed bandits. Li B; Yeung CH Chaos; 2023 Jun; 33(6):. PubMed ID: 37276557 [TBL] [Abstract][Full Text] [Related]
6. Global Bandits. Atan O; Tekin C; van der Schaar M IEEE Trans Neural Netw Learn Syst; 2018 Dec; 29(12):5798-5811. PubMed ID: 29993936 [TBL] [Abstract][Full Text] [Related]
7. An Online Minimax Optimal Algorithm for Adversarial Multiarmed Bandit Problem. Gokcesu K; Kozat SS IEEE Trans Neural Netw Learn Syst; 2018 Nov; 29(11):5565-5580. PubMed ID: 29994080 [TBL] [Abstract][Full Text] [Related]
8. A Multiplier Bootstrap Approach to Designing Robust Algorithms for Contextual Bandits. Xie H; Tang Q; Zhu Q IEEE Trans Neural Netw Learn Syst; 2023 Dec; 34(12):9887-9899. PubMed ID: 35385392 [TBL] [Abstract][Full Text] [Related]
9. Cascaded Algorithm Selection With Extreme-Region UCB Bandit. Hu YQ; Liu XH; Li SQ; Yu Y IEEE Trans Pattern Anal Mach Intell; 2022 Oct; 44(10):6782-6794. PubMed ID: 34232866 [TBL] [Abstract][Full Text] [Related]
10. An empirical evaluation of active inference in multi-armed bandits. Marković D; Stojić H; Schwöbel S; Kiebel SJ Neural Netw; 2021 Dec; 144():229-246. PubMed ID: 34507043 [TBL] [Abstract][Full Text] [Related]
11. A Thompson Sampling Algorithm With Logarithmic Regret for Unimodal Gaussian Bandit. Yang L; Li Z; Hu Z; Ruan S; Pan G IEEE Trans Neural Netw Learn Syst; 2023 Sep; 34(9):5332-5341. PubMed ID: 37527328 [TBL] [Abstract][Full Text] [Related]
12. Generalized Contextual Bandits With Latent Features: Algorithms and Applications. Xu X; Xie H; Lui JCS IEEE Trans Neural Netw Learn Syst; 2023 Aug; 34(8):4763-4775. PubMed ID: 34780337 [TBL] [Abstract][Full Text] [Related]
14. The Perils of Misspecified Priors and Optional Stopping in Multi-Armed Bandits. Loecher M Front Artif Intell; 2021; 4():715690. PubMed ID: 34308342 [TBL] [Abstract][Full Text] [Related]
15. Per-Round Knapsack-Constrained Linear Submodular Bandits. Yu B; Fang M; Tao D Neural Comput; 2016 Dec; 28(12):2757-2789. PubMed ID: 27626968 [TBL] [Abstract][Full Text] [Related]
16. A Contextual-Bandit-Based Approach for Informed Decision-Making in Clinical Trials. Varatharajah Y; Berry B Life (Basel); 2022 Aug; 12(8):. PubMed ID: 36013456 [TBL] [Abstract][Full Text] [Related]