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 *

116 related articles for article (PubMed ID: 35385392)

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

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

  • 4. Recurrent Neural-Linear Posterior Sampling for Nonstationary Contextual Bandits.
    Ramesh A; Rauber P; Conserva M; Schmidhuber J
    Neural Comput; 2022 Oct; 34(11):2232-2272. PubMed ID: 36112923
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Inference for Batched Bandits.
    Zhang KW; Janson L; Murphy SA
    Adv Neural Inf Process Syst; 2020 Dec; 33():9818-9829. PubMed ID: 35002190
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Wi-Fi Assisted Contextual Multi-Armed Bandit for Neighbor Discovery and Selection in Millimeter Wave Device to Device Communications.
    Hashima S; Hatano K; Kasban H; Mahmoud Mohamed E
    Sensors (Basel); 2021 Apr; 21(8):. PubMed ID: 33920717
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. PAC-Bayes Bounds for Bandit Problems: A Survey and Experimental Comparison.
    Flynn H; Reeb D; Kandemir M; Peters J
    IEEE Trans Pattern Anal Mach Intell; 2023 Dec; 45(12):15308-15327. PubMed ID: 37594872
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Multi-Armed Bandit-Based User Network Node Selection.
    Gao Q; Xie Z
    Sensors (Basel); 2024 Jun; 24(13):. PubMed ID: 39000883
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 18. Post-Contextual-Bandit Inference.
    Bibaut A; Chambaz A; Dimakopoulou M; Kallus N; van der Laan M
    Adv Neural Inf Process Syst; 2021 Dec; 34():28548-28559. PubMed ID: 35785105
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 6.