Relative expected instantaneous loss bounds

Journal of Computer and System Sciences

Volumn 64, Issue 1, 2002, Pages 76-102

  Forster, Jürgen ^a   Warmuth, Manfred K ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; ONLINE SYSTEMS; PROBLEM SOLVING; REGRESSION ANALYSIS;

INSTANTANEOUS LOSS BOUNDS;

LEARNING ALGORITHMS;

EID: 0036476991     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1798     Document Type: Article

References (26)

1. Exponentially many local minima for single neurons
2. Relative loss bounds for on-line density estimation with the exponential family of distributions
3. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
4. On relative loss bounds in generalized linear regression
5. Relative loss bounds for temporal-difference learning
6. Prediction in the worst case
7. Predicting a binary sequence almost as well as the optimal biased coin
8. An introduction to wavelets
9. Predicting {0, 1}-functions on randomly drawn points
10. Relative loss bounds for single neurons
11. On weak learning
12. Additive versus exponentiated gradient updates for linear prediction
13. The importance of convexity in learning with squared loss
14. Relative loss bounds for multidimensional regression problems
15. Ridge regression learning algorithm in dual variables
16. Universal sequential coding of single messages
17. A decision-theoretic extension of stochastic complexity and its applications to learning
18. Extended stochastic complexity and minimax relative loss analysis
19. Minimax redundancy for the class of memoryless sources