The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Tracking the Best Expert
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
The Weighted Majority Algorithm
Littlestone, N., & Warmuth, M. K. (1994) · Information and Computation · doi:10.1006/inco.1994.1009 · Cited by 1,975
Self-citationElements of Information Theory
Phoenix, S. J. D. (1992) · Journal of Modern Optics · doi:10.1080/09500349214551641 · Cited by 1,380
Exponentiated Gradient versus Gradient Descent for Linear Predictors
Kivinen, J., & Warmuth, M. K. (1997) · Information and Computation · doi:10.1006/inco.1996.2612 · Cited by 864
Self-citationCesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997) · Journal of the ACM · doi:10.1145/258128.258179 · Cited by 634
Self-citationLearning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
Universal prediction of individual sequences
Feder, M., Merhav, N., & Gutman, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144706 · Cited by 373
A Game of Prediction with Expert Advice
Vovk, V (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1556 · Cited by 281
Using and combining predictors that specialize
Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258616 · Cited by 234
Self-citation
Cited by
A survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Can machine learning be secure?
Barreno, M., Nelson, B., Sears, R., Joseph, A. D., & Tygar, J. D. (2006) · Proceedings of the 2006 ACM Symposium on Information, computer and communications security · doi:10.1145/1128817.1128824 · Cited by 836
Dynamic Weighted Majority: An Ensemble Method for Drifting Concepts
Kolter, J. Z., & Maloof, M. A. (2007) · doi:10.5555/1314498.1390333 · Cited by 648
On evaluating stream learning algorithms
Gama, J., Sebastião, R., & Rodrigues, P. P. (2013) · Machine Learning · doi:10.1007/s10994-012-5320-9 · Cited by 532
Metadata
- Authors
- Herbster, M., & Warmuth, M. K.
- Venue
- Machine Learning
- Published
- 1998-08
- Volume
- 32
- Issue
- 2
- Pages
- 151-178
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1970041563
- Cited by
- 560
- References
- 15
- FWCI
- 19.71
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tracking the Best Expert. https://app.cochat.ai/papers/10.1023/a:1007424614876
- The paper
- Herbster, M., & Warmuth, M. K. (1998). Tracking the Best Expert. Machine Learning. https://doi.org/10.1023/a%3A1007424614876
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
