10.1162/153244301753683726

DOI10.1162/153244301753683726zbMath1008.68105OpenAlexW1724735345MaRDI QIDQ2782263

Mark Herbster, Manfred K. Warmuth

Publication date: 3 April 2002

Published in: CrossRef Listing of Deleted DOIs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/153244301753683726

zbMATH Keywords

on-line learningshifting boundsstatic bounds

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (17)

Online forecast combinations of distributions: worst case bounds ⋮ Learning rotations with little regret ⋮ Context-based unsupervised ensemble learning and feature ranking ⋮ Unnamed Item ⋮ Nonstationary online convex optimization with multiple predictions ⋮ Online variance minimization ⋮ Online Regression Competitive with Changing Predictors ⋮ On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms ⋮ Extracting certainty from uncertainty: regret bounded by variation in costs ⋮ Online transfer learning ⋮ Weighted last-step min-max algorithm with improved sub-logarithmic regret ⋮ Kernelization of matrix updates, when and how? ⋮ RECURSIVE FORECAST COMBINATION FOR DEPENDENT HETEROGENEOUS DATA ⋮ Leading strategies in competitive on-line prediction ⋮ Tracking the best hyperplane with a simple budget perceptron ⋮ An Upper Bound for Aggregating Algorithm for Regression with Changing Dependencies ⋮ Low-dimensional tracking of association structures in categorical data

This page was built for publication: 10.1162/153244301753683726