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.
107 related articles for article (PubMed ID: 37276557)
1. 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]
2. 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]
3. 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]
4. Minimax Optimal Bandits for Heavy Tail Rewards. Lee K; Lim S IEEE Trans Neural Netw Learn Syst; 2024 Apr; 35(4):5280-5294. PubMed ID: 36103434 [TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
8. 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]
9. Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk. Yamagami T; Segawa E; Mihana T; Röhm A; Horisaki R; Naruse M Entropy (Basel); 2023 May; 25(6):. PubMed ID: 37372187 [TBL] [Abstract][Full Text] [Related]
10. An Analysis of the Value of Information When Exploring Stochastic, Discrete Multi-Armed Bandits. Sledge IJ; Príncipe JC Entropy (Basel); 2018 Feb; 20(3):. PubMed ID: 33265246 [TBL] [Abstract][Full Text] [Related]
11. Optimism in the face of uncertainty supported by a statistically-designed multi-armed bandit algorithm. Kamiura M; Sano K Biosystems; 2017 Oct; 160():25-32. PubMed ID: 28838871 [TBL] [Abstract][Full Text] [Related]
12. Risk-aware multi-armed bandit problem with application to portfolio selection. Huo X; Fu F R Soc Open Sci; 2017 Nov; 4(11):171377. PubMed ID: 29291122 [TBL] [Abstract][Full Text] [Related]
14. Some performance considerations when using multi-armed bandit algorithms in the presence of missing data. Chen X; Lee KM; Villar SS; Robertson DS PLoS One; 2022; 17(9):e0274272. PubMed ID: 36094920 [TBL] [Abstract][Full Text] [Related]
15. Non Stationary Multi-Armed Bandit: Empirical Evaluation of a New Concept Drift-Aware Algorithm. Cavenaghi E; Sottocornola G; Stella F; Zanker M Entropy (Basel); 2021 Mar; 23(3):. PubMed ID: 33807028 [TBL] [Abstract][Full Text] [Related]
17. Amoeba-inspired Tug-of-War algorithms for exploration-exploitation dilemma in extended Bandit Problem. Aono M; Kim SJ; Hara M; Munakata T Biosystems; 2014 Mar; 117():1-9. PubMed ID: 24384066 [TBL] [Abstract][Full Text] [Related]
18. Uncertainty and exploration in a restless bandit problem. Speekenbrink M; Konstantinidis E Top Cogn Sci; 2015 Apr; 7(2):351-67. PubMed ID: 25899069 [TBL] [Abstract][Full Text] [Related]