Tracking the best expert
From MaRDI portal
Publication:1275395
DOI10.1023/A:1007424614876zbMath0912.68165MaRDI QIDQ1275395
Mark Herbster, Manfred K. Warmuth
Publication date: 17 January 1999
Published in: Machine Learning (Search for Journal in Brave)
Related Items (31)
Online forecast combinations of distributions: worst case bounds ⋮ Competitive On-line Statistics ⋮ On the complexity of learning from drifting distributions ⋮ Online Learning with (Multiple) Kernels: A Review ⋮ \(\lambda \)-perceptron: an adaptive classifier for data streams ⋮ Combining initial segments of lists ⋮ Context-based unsupervised ensemble learning and feature ranking ⋮ Unnamed Item ⋮ Arbitrage of forecasting experts ⋮ Online variance minimization ⋮ Group online adaptive learning ⋮ Forecasting electricity consumption by aggregating specialized experts ⋮ On evaluating stream learning algorithms ⋮ PORTFOLIO SELECTION AND ONLINE LEARNING ⋮ Catching up Faster by Switching Sooner: A Predictive Approach to Adaptive Estimation with an Application to the AIC–BIC Dilemma ⋮ Randomized prediction of individual sequences ⋮ Online aggregation of unbounded losses using shifting experts with confidence ⋮ Linear programming with online learning ⋮ Probability-free solutions to the non-stationary newsvendor problem ⋮ Online portfolio selection ⋮ A survey on concept drift adaptation ⋮ Probability theory for the Brier game ⋮ Unified Algorithms for Online Learning and Competitive Analysis ⋮ Tracking the best hyperplane with a simple budget perceptron ⋮ Automated adaptation strategies for stream learning ⋮ Tracking climate models ⋮ Worst-case analysis of the Perceptron and Exponentiated Update algorithms ⋮ Testing randomness online ⋮ Online regularized generalized gradient classification algorithms ⋮ Small-Loss Bounds for Online Learning with Partial Information ⋮ Adaptive and self-confident on-line learning algorithms
This page was built for publication: Tracking the best expert
