The DOI matches its Crossref record.
Using and combining predictors that specialize
Open accessAbstract
We study online learning algorithms that predict by combining the predictions of severrd subordinate prediction algorithms, sometimes crdled "experts ."These simple algorithms belong to the multiplicative weights family of algorithms.The performance of these algorithms degrades only logarithmically with the number of experts, making them particularly useful in applications where the number of experts is very large.However, in applications such as text categorization, it is often natural for some of the experts to abstain from making predictions on some of the instances.We show how to transform algorithms that assume that afl experts are atways awake to algorithms that do not require this assumption.We also show how to derive corresponding Ioss bounds.Our method is very generaf, and can be applied to a large family of online learning algori[hms.We also give applications to various prediction models including decision graphs and "switching" experts.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Improved boosting algorithms using confidence-rated predictions
Schapire, R. E., & Singer, Y. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279960 · Cited by 2,547
Self-citationBoosTexter: A Boosting-based System for Text Categorization
Schapire, R. E., & Singer, Y. (2000) · Machine Learning · doi:10.1023/a:1007649029923 · Cited by 2,188
Self-citationImproved Boosting Algorithms Using Confidence-rated Predictions
Schapire, R. E., & Singer, Y. (1999) · Machine Learning · doi:10.1023/a:1007614523901 · Cited by 1,971
Self-citationA Survey of Text Classification Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_6 · Cited by 842
Introduction to Multi-Armed Bandits
Slivkins, A. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000068 · Cited by 780
Efficient algorithms for online decision problems
Kalai, A., & Vempala, S. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.10.016 · Cited by 591
Herbster, M., & Warmuth, M. K. (1998) · Machine Learning · doi:10.1023/a:1007424614876 · Cited by 560
Self-citationDistributed learning in wireless sensor networks
Predd, J. B., Kulkarni, S. B., & Poor, H. V. (2006) · IEEE Signal Processing Magazine · doi:10.1109/msp.2006.1657817 · Cited by 369
Context-sensitive learning methods for text categorization
Cohen, W. W., & Singer, Y. (1999) · ACM Transactions on Information Systems · doi:10.1145/306686.306688 · Cited by 360
Self-citationBoosting and Rocchio applied to text filtering
Schapire, R. E., Singer, Y., & Singhal, A. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290996 · Cited by 301
Self-citationDistributed Learning in Wireless Sensor Networks
Predd, J. B., Kulkarni, S. R., & Poor, H. V. (2007) · Wireless Sensor Networks · doi:10.1002/9780470061794.ch8 · Cited by 264
Blum, L., & Blum, M. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2115934119 · Cited by 70
Hypothesis Transfer Learning for Efficient Data Computing in Smart Cities Environments
Valerio, L., Passarella, A., & Conti, M. (2016) · 2016 IEEE International Conference on Smart Computing (SMARTCOMP) · doi:10.1109/smartcomp.2016.7501696 · Cited by 24
Metadata
- Authors
- Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K.
- Venue
- Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 334-343
- OpenAlex
- W2046934276
- Cited by
- 234
- References
- 0
- FWCI
- 25.00
- Type
- conference paper
- 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
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.