The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
On‐Line Portfolio Selection Using Multiplicative Updates
Abstract
We present an on‐line investment algorithm that achieves almost the same wealth as the best constant‐rebalanced portfolio determined in hindsight from the actual market outcomes. The algorithm employs a multiplicative update rule derived using a framework introduced by Kivinen and Warmuth. Our algorithm is very simple to implement and requires only constant storage and computing time per stock in each trading period. We tested the performance of our algorithm on real stock data from the New York Stock Exchange accumulated during a 22‐year period. On these data, our algorithm clearly outperforms the best single stock as well as Cover's universal portfolio selection algorithm. We also present results for the situation in which the investor has access to additional “side information.”
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
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
“Options, Futures, and Other Derivatives”
(2016) · AMBER – ABBS Management Business and Entrepreneurship Review · doi:10.23874/amber/2016/v7/i1/121351 · Cited by 5,007
A New Interpretation of Information Rate
Kelly, J. L. (1956) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1956.tb03809.x · Cited by 1,586
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
Self-citationUniversal portfolios with and without transaction costs
Blum, A. L., & Kalai, A. T. (1997) · Annual Conference on Computational Learning Theory (COLT) · doi:10.1145/267460.267518 · Cited by 153
An algorithm for maximizing expected log investment return
Cover, T. M. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056869 · Cited by 148
Universal Schemes for Prediction, Gambling and Portfolio Selection
Algoet, P. (1992) · The Annals of Probability · doi:10.1214/aop/1176989811 · Cited by 114
Auer, P. L., & Warmuth, M. K. (1998) · Machine Learning · doi:10.1023/a:1007472513967 · Cited by 105
Self-citationA comparison of new and old algorithms for a mixture estimation problem
Helmbold, D. P., Singer, Y., Schapire, R. E., & Warmuth, M. K. (1995) · Conference on Learning Theory · doi:10.1145/225298.225306 · Cited by 77
Self-citationA bound on the financial value of information
Barron, A. R., & Cover, T. M. (1988) · IEEE Transactions on Information Theory · doi:10.1109/18.21241 · Cited by 58
Cited by
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011) · Proceedings of the 4th ACM workshop on Security and artificial intelligence · doi:10.1145/2046684.2046692 · Cited by 1,194
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-citationOnline 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
Online convex optimization in the bandit setting: gradient descent without a gradient
Flaxman, A. D., Kalai, A. T., & McMahan, H. B. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408007 · Cited by 546
Metadata
- Authors
- Helmbold, D. P., Schapire, R. E., Singer, Y., & Warmuth, M. K.
- Venue
- Mathematical Finance
- Publisher
- Wiley
- Published
- 1998-10
- Volume
- 8
- Issue
- 4
- Pages
- 325-347
- ISSN
- 0960-1627 (ISSN-L)
- 1467-9965
- OpenAlex
- W114353221
- Cited by
- 387
- References
- 10
- FWCI
- 10.16
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On‐Line Portfolio Selection Using Multiplicative Updates. https://app.cochat.ai/papers/10.1111/1467-9965.00058
- The paper
- Helmbold, D. P., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1998). On‐Line Portfolio Selection Using Multiplicative Updates. Mathematical Finance. https://doi.org/10.1111/1467-9965.00058
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.