Adaptive and Self-Confident On-Line Learning Algorithms-Reference-Cited by-同舟云学术

Adaptive and Self-Confident On-Line Learning Algorithms

Published:2002-02 Issue:1 Volume:64 Page:48-75
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Auer Peter,Cesa-Bianchi Nicolò,Gentile Claudio

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference37 articles.

1. Queries and concept learning;Angluin;Mach. Learning,1988

2. Tracking the best disjunction;Auer;Mach. Learning,1998

3. K. Azoury, and, M. K. Warmuth, Relative loss bounds for on-line density estimation with the exponential family of distributions, Mach. Learning, to appear.

4. The perceptron: A model for brain functioning;Block;Rev. Modern Phys.,1962

5. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming;Bregman;USSR Comput. Math. Phys.,1967

Cited by 74 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Assessing the ability of a new seamless short-range ensemble rainfall product to anticipate flash floods in the French Mediterranean area;Natural Hazards and Earth System Sciences;2023-11-02

2. Stochastic variance reduced gradient with hyper-gradient for non-convex large-scale learning;Applied Intelligence;2023-10-10

3. Lazy Lagrangians for Optimistic Learning With Budget Constraints;IEEE/ACM Transactions on Networking;2023-10

4. Optimistic Online Caching for Batched Requests;ICC 2023 - IEEE International Conference on Communications;2023-05-28

5. Reservation of Virtualized Resources with Optimistic Online Learning;ICC 2023 - IEEE International Conference on Communications;2023-05-28