The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Logistic Regression, AdaBoost and Bregman Distances
Open accessOverview
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
Cites
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
Self-citationFriedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 1×
“Given this assumption, it has been noted by Breiman (1997a, 1997b) and various later authors (Friedman et al., 2000; Mason et al., 1999; Rätsch, Onoda, & Müller, 2001; Schapire & Singer, 1999) that the choice of both hj and are done in such a way as to cause the greatest decrease in the exponential loss induced by , g…”
BackgroundA maximum entropy approach to natural language processing
Berger, A. L., Pietra, V. J. D., & Pietra, S. A. D. (1996) · doi:10.5555/234285.234289 · Cited by 3,065
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
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-citation$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Rätsch, G., Onoda, T., & Müller, K.-R. (2001) · Machine Learning · doi:10.1023/a:1007618119488 · Cited by 1,299
Generalized Iterative Scaling for Log-Linear Models
Darroch, J. N., & Ratcliff, D. (1972) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177692379 · Cited by 1,206
Inducing features of random fields
Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.588021 · Cited by 1,036
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
Parallel optimization: Theory, algorithms, and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90713-1 · Cited by 813
Csiszar, I. (1991) · The Annals of Statistics · doi:10.1214/aos/1176348385 · Cited by 790
The Alternating Decision Tree Learning Algorithm
Freund, Y., & Mason, L. (1999) · Cited by 773
Prediction Games and Arcing Algorithms
Breiman, L. (1999) · Neural Computation · doi:10.1162/089976699300016106 · Cited by 530
An iterative row-action method for interval convex programming
Censor, Y., & Lent, A. H. (1981) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934676 · Cited by 498
Pairwise data clustering by deterministic annealing
Hofmann, T., & Buhmann, J. M. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.566806 · Cited by 451
A simple, fast, and effective rule learner
Cohen, W. W., & Singer, Y. (1999) · Cited by 341
Self-citationFunctional Gradient Techniques for Combining Hypotheses
Mason, L., Baxter, J., Bartlett, P. L., & Frean, M. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0017 · Cited by 279
Additive versus exponentiated gradient updates for linear prediction
Kivinen, J., & Warmuth, M. K. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225121 · Cited by 223
Relative Loss Bounds for Multidimensional Regression Problems
Kivinen, J., & Warmuth, M. K. (2001) · Machine Learning · doi:10.1023/a:1017938623079 · Cited by 135
Information-theoretical optimization techniques
Topsøe, F. (1979) · Czech digital mathematics library · Cited by 134
Boosting as entropy projection
Kivinen, J., & Warmuth, M. K. (1999) · Conference on Learning Theory · doi:10.1145/307400.307424 · Cited by 113
Additive models, boosting, and inference for generalized divergences
Lafferty, J. (1999) · Conference on Learning Theory · doi:10.1145/307400.307422 · Cited by 78
Generalized projections for non-negative functions
Csiszár, I. (1995) · Acta Mathematica Academiae Scientiarum Hungaricae · doi:10.1007/bf01874442 · Cited by 73
Maxent, Mathematics, and Information Theory
Csiszár, I. (1996) · Springer eBooks · doi:10.1007/978-94-011-5430-7_5 · Cited by 70
Robust trainability of single neurons
Höffgen, K.-U., & Simon, H. U. (1992) · Conference on Learning Theory · doi:10.1145/130385.130431 · Cited by 47
Duffy, N., & Helmbold, D. P. (1999) · Cited by 38
Scaling Up a Boosting-Based Learner via Adaptive Sampling
Domingo, C., & Watanabe, O. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45571-x_37 · Cited by 31
On-line learning of linear functions
Littlestone, N., Warmuth, M. K., & Long, P. M. (1995) · Computational Complexity · doi:10.1007/bf01277953 · Cited by 29
Bounds on approximate steepest descent for likelihood maximization in exponential families
Cesa‐Bianchi, N., Krogh, A., & Warmuth, M. K. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335953 · Cited by 10
From Computational Learning Theory to Discovery Science
Watanabe, O. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48523-6_11 · Cited by 5
Cited by
Strictly Proper Scoring Rules, Prediction, and Estimation
Gneiting, T., & Raftery, A. E. (2007) · Journal of the American Statistical Association · doi:10.1198/016214506000001437 · Cited by 5,793
A maximum entropy approach to species distribution modeling
Phillips, S. J., Dudík, M., & Schapire, R. E. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015412 · Cited by 2,252
Self-citationThe Boosting Approach to Machine Learning: An Overview
Schapire, R. E. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2_9 · Cited by 2,003
Self-citationFoundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
Metadata
- Authors
- Collins, M., Schapire, R. E., & Singer, Y.
- Venue
- Machine Learning
- Published
- 2002-07
- Volume
- 48
- Issue
- 1-3
- Pages
- 253-285
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1546961578
- Cited by
- 687
- References
- 33
- FWCI
- 27.43
- 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
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.