The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Additive versus exponentiated gradient updates for linear prediction
Abstract
Article Additive versus exponentiated gradient updates for linear prediction Share on Authors: Jyrki Kivinen Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23) FIN-00014 University of Helsinki, Finland Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23) FIN-00014 University of Helsinki, FinlandView Profile , Manfred K. Warmuth Computer and Information Sciences, University of California, Santa Cruz, Santa Cruz, CA Computer and Information Sciences, University of California, Santa Cruz, Santa Cruz, CAView Profile Authors Info & Claims STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computingMay 1995 Pages 209–218https://doi.org/10.1145/225058.225121Online:29 May 1995Publication History 48citation1,649DownloadsMetricsTotal Citations48Total Downloads1,649Last 12 Months41Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
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
Cites
The perceptron: A probabilistic model for information storage and organization in the brain.
Rosenblatt, F. (1958) · Psychological Review · doi:10.1037/h0042519 · Cited by 12,280
Cited by
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Graph Regularized Nonnegative Matrix Factorization for Data Representation
Cai, D., He, X., Han, J., & Huang, T. S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.231 · Cited by 2,451
Learning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
Online Learning and Online Convex Optimization
Shalev-Shwartz, S. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000018 · Cited by 1,246
Yuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151
“It also relates to linear prediction ( Kivinen & Warmuth, 1997 ).”
BackgroundOnline Learning and Online Convex Optimization
Shalev-Shwartz, S. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985477 · Cited by 1,095
Large margin classification using the perceptron algorithm
Freund, Y., & Schapire, R. E. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279985 · Cited by 1,071
Online learning: A comprehensive survey
Hoi, S. C. H., Sahoo, D., Lu, J., & Zhao, P. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.112 · Cited by 746
Logistic Regression, AdaBoost and Bregman Distances
Collins, M., Schapire, R. E., & Singer, Y. (2002) · Machine Learning · doi:10.1023/a:1013912006537 · Cited by 687
Automatically Categorizing Written Texts by Author Gender
Koppel, M. (2002) · Literary and Linguistic Computing · doi:10.1093/llc/17.4.401 · Cited by 623
“Our method for finding the weight vector w is a variant of the Exponential Gradient (EG) algorithm of (Kivinen & Warmuth 1997) which itself is a generalization of the Balanced Winnow algorithm of (Littlestone 1987).”
MethodLarge Margin Classification Using the Perceptron Algorithm
Freund, Y., & Schapire, R. E. (1999) · Machine Learning · doi:10.1023/a:1007662407062 · Cited by 604
Gender, genre, and writing style in formal written texts
ARGAMON, S., KOPPEL, M., FINE, J., & SHIMONI, A. R. (2003) · Text - Interdisciplinary Journal for the Study of Discourse · doi:10.1515/text.2003.014 · Cited by 560
Herbster, M., & Warmuth, M. K. (1998) · Machine Learning · doi:10.1023/a:1007424614876 · Cited by 560
Self-citationConstrained Nonnegative Matrix Factorization for Image Representation
Liu, H., Wu, Z., Cai, D., & Huang, T. S. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.217 · Cited by 520
Adaptive Game Playing Using Multiplicative Weights
Freund, Y., & Schapire, R. E. (1999) · Games and Economic Behavior · doi:10.1006/game.1999.0738 · Cited by 515
An Introduction to Boosting and Leveraging
Meir, R., & Rätsch, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_4 · Cited by 447
On the Generalization Ability of On-Line Learning Algorithms
Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833339 · Cited by 426
Locally Consistent Concept Factorization for Document Clustering
Cai, D., He, X., & Han, J. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.165 · Cited by 399
On‐Line Portfolio Selection Using Multiplicative Updates
Helmbold, D. P., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1998) · Mathematical Finance · doi:10.1111/1467-9965.00058 · Cited by 387
Self-citationRelative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions
Azoury, K. S., & Warmuth, M. K. (2001) · Machine Learning · doi:10.1023/a:1010896012157 · Cited by 298
Self-citationA Winnow-Based Approach to Context-Sensitive Spelling Correction
Golding, A. R., & Roth, D. (1999) · Machine Learning · doi:10.1023/a:1007545901558 · Cited by 291
Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent
Schraudolph, N. N. (2002) · Neural Computation · doi:10.1162/08997660260028683 · Cited by 265
Metadata
- Authors
- Kivinen, J., & Warmuth, M. K.
- Venue
- Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 209-218
- OpenAlex
- W2011395874
- Cited by
- 223
- References
- 1
- FWCI
- 20.80
- Type
- conference paper
- Language
- en
- Open access
- closed
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.