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 *

193 related articles for article (PubMed ID: 25720015)

  • 1. A unified approach to universal prediction: generalized upper and lower bounds.
    Vanli ND; Kozat SS
    IEEE Trans Neural Netw Learn Syst; 2015 Mar; 26(3):646-51. PubMed ID: 25720015
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Worst-case quadratic loss bounds for prediction using linear functions and gradient descent.
    Cesa-Bianchi N; Long PM; Warmuth MK
    IEEE Trans Neural Netw; 1996; 7(3):604-19. PubMed ID: 18263458
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Relative loss bounds for single neurons.
    Helmbold DP; Kivinen J; Warmuth MK
    IEEE Trans Neural Netw; 1999; 10(6):1291-304. PubMed ID: 18252631
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A Deterministic Analysis of an Online Convex Mixture of Experts Algorithm.
    Ozkan H; Donmez MA; Tunc S; Kozat SS
    IEEE Trans Neural Netw Learn Syst; 2015 Jul; 26(7):1575-80. PubMed ID: 25167557
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Algorithmic stability and sanity-check bounds for leave-one-out cross-validation.
    Kearns M; Ron D
    Neural Comput; 1999 Aug; 11(6):1427-53. PubMed ID: 10423502
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Mortality risk score prediction in an elderly population using machine learning.
    Rose S
    Am J Epidemiol; 2013 Mar; 177(5):443-52. PubMed ID: 23364879
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Efficient algorithms for exact inference in sequence labeling SVMs.
    Bauer A; Görnitz N; Biegler F; Müller KR; Kloft M
    IEEE Trans Neural Netw Learn Syst; 2014 May; 25(5):870-81. PubMed ID: 24808034
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution.
    Song YS; Wu Y; Gusfield D
    Bioinformatics; 2005 Jun; 21 Suppl 1():i413-22. PubMed ID: 15961486
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the optimality of neural-network approximation using incremental algorithms.
    Meir R; Maiorov VE
    IEEE Trans Neural Netw; 2000; 11(2):323-37. PubMed ID: 18249764
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A learning rule for very simple universal approximators consisting of a single layer of perceptrons.
    Auer P; Burgsteiner H; Maass W
    Neural Netw; 2008 Jun; 21(5):786-95. PubMed ID: 18249524
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Cramér-Rao bounds for parametric shape estimation in inverse problems.
    Ye JC; Bresler Y; Moulin P
    IEEE Trans Image Process; 2003; 12(1):71-84. PubMed ID: 18237880
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Theoretical bounds of generalization error for generalized extreme learning machine and random vector functional link network.
    Kim M
    Neural Netw; 2023 Jul; 164():49-66. PubMed ID: 37146449
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures.
    Mohaghegh Neyshabouri M; Gokcesu K; Gokcesu H; Ozkan H; Kozat SS
    IEEE Trans Neural Netw Learn Syst; 2019 Mar; 30(3):923-937. PubMed ID: 30072350
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An Optimal Transport Analysis on Generalization in Deep Learning.
    Zhang J; Liu T; Tao D
    IEEE Trans Neural Netw Learn Syst; 2023 Jun; 34(6):2842-2853. PubMed ID: 34554918
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Reduction from cost-sensitive ordinal ranking to weighted binary classification.
    Lin HT; Li L
    Neural Comput; 2012 May; 24(5):1329-67. PubMed ID: 22295981
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Online learning with an almost perfect expert.
    Brânzei S; Peres Y
    Proc Natl Acad Sci U S A; 2019 Mar; 116(13):5949-5954. PubMed ID: 30850534
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Factorial hidden Markov models and the generalized backfitting algorithm.
    Jacobs RA; Jiang W; Tanner MA
    Neural Comput; 2002 Oct; 14(10):2415-37. PubMed ID: 12396569
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
    Dang C; Ma W; Liang J
    Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Online learning of single- and multivalued functions with an infinite mixture of linear experts.
    Damas B; Santos-Victor J
    Neural Comput; 2013 Nov; 25(11):3044-91. PubMed ID: 24001344
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.