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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

79 related articles for article (PubMed ID: 29993936)

  • 1. 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]  

  • 2. 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]  

  • 3. Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis.
    Jose ST; Moothedath S
    Entropy (Basel); 2024 Jul; 26(7):. PubMed ID: 39056968
    [TBL] [Abstract][Full Text] [Related]  

  • 4. 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]  

  • 5. 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. Covariance Matrix Adaptation for Multiobjective Multiarmed Bandits.
    Drugan MM
    IEEE Trans Neural Netw Learn Syst; 2019 Aug; 30(8):2493-2502. PubMed ID: 30602427
    [TBL] [Abstract][Full Text] [Related]  

  • 7. 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. 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]  

  • 9. 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]  

  • 10. Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback.
    Kuroki Y; Xu L; Miyauchi A; Honda J; Sugiyama M
    Neural Comput; 2020 Sep; 32(9):1733-1773. PubMed ID: 32687769
    [TBL] [Abstract][Full Text] [Related]  

  • 11. 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]  

  • 12. An Efficient Algorithm for Deep Stochastic Contextual Bandits.
    Zhu T; Liang G; Zhu C; Li H; Bi J
    Proc AAAI Conf Artif Intell; 2021 Feb; 35(12):11193-11201. PubMed ID: 34745766
    [TBL] [Abstract][Full Text] [Related]  

  • 13. 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]  

  • 14. Master-Slave Deep Architecture for Top- K Multiarmed Bandits With Nonlinear Bandit Feedback and Diversity Constraints.
    Huang H; Shen L; Ye D; Liu W
    IEEE Trans Neural Netw Learn Syst; 2023 Nov; PP():. PubMed ID: 37999964
    [TBL] [Abstract][Full Text] [Related]  

  • 15. 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]  

  • 16. 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]  

  • 17. INDEXABILITY AND OPTIMAL INDEX POLICIES FOR A CLASS OF REINITIALISING RESTLESS BANDITS.
    Villar SS
    Probab Eng Inf Sci; 2016 Jan; 30(1):1-23. PubMed ID: 27212781
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Online Density Estimation of Nonstationary Sources Using Exponential Family of Distributions.
    Gokcesu K; Kozat SS
    IEEE Trans Neural Netw Learn Syst; 2018 Sep; 29(9):4473-4478. PubMed ID: 28920910
    [TBL] [Abstract][Full Text] [Related]  

  • 19. 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]  

  • 20. Multiview Boosting With Information Propagation for Classification.
    Peng J; Aved AJ; Seetharaman G; Palaniappan K
    IEEE Trans Neural Netw Learn Syst; 2018 Mar; 29(3):657-669. PubMed ID: 28060713
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 4.