10.1162/153244301753683726
From MaRDI portal
Publication:2782263
DOI10.1162/153244301753683726zbMath1008.68105MaRDI 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
68Q32: Computational learning theory
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Unnamed Item, Low-dimensional tracking of association structures in categorical data, Online forecast combinations of distributions: worst case bounds, Online variance minimization, Online transfer learning, Weighted last-step min-max algorithm with improved sub-logarithmic regret, Kernelization of matrix updates, when and how?, Leading strategies in competitive on-line prediction, Tracking the best hyperplane with a simple budget perceptron, Learning rotations with little regret, Context-based unsupervised ensemble learning and feature ranking, 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, An Upper Bound for Aggregating Algorithm for Regression with Changing Dependencies, Online Regression Competitive with Changing Predictors, RECURSIVE FORECAST COMBINATION FOR DEPENDENT HETEROGENEOUS DATA