The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Logarithmic regret algorithms for online convex optimization
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
Spall, J. C. (2003) · Wiley eBooks · doi:10.1002/0471722138 · Cited by 1,890
(2003) · Cited by 1,733
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
Cover, T. M. (1991) · Mathematical Finance · doi:10.1111/j.1467-9965.1991.tb00002.x · Cited by 587
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
Simulated annealing in convex bodies and an O*(n4) volume algorithm
Lovász, L., & Vempala, S. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.08.004 · Cited by 239
Universal 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
Efficient algorithms for universal portfolios
Kalai, A. T., & Vempala, S. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892136 · Cited by 143
Relative Loss Bounds for Multidimensional Regression Problems
Kivinen, J., & Warmuth, M. K. (2001) · Machine Learning · doi:10.1023/a:1017938623079 · Cited by 135
A Nonstandard Approach to Option Pricing
Cutland, N. J., Kopp, E., & Willinger, W. (1991) · Mathematical Finance · doi:10.1111/j.1467-9965.1991.tb00017.x · Cited by 96
Stochastic Nonstationary Optimization for Finding Universal Portfolios
Gaivoronski, A. A., & Stella, F. A. (2000) · Annals of Operations Research · doi:10.1023/a:1019271201970 · Cited by 67
4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY
Hannan, J. F. (1958) · Princeton University Press eBooks · doi:10.1515/9781400882151-006 · Cited by 66
Efficient algorithms for online convex optimization and their applications
Arora, S., & Hazan, E. (2006) · Cited by 35
Self-citationUniversal sequential learning and decision from individual data sequences
Merhav, N., & Feder, M. (1992) · Conference on Learning Theory · doi:10.1145/130385.130430 · Cited by 23
Cited by
(2010) · Cited by 8,261
(2015) · Cited by 2,857
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273598 · Cited by 973
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Introduction to Online Convex Optimization
Hazan, E. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831719 · Cited by 813
Self-citation
Metadata
- Authors
- Hazan, E., Agarwal, A., & Kale, S.
- Venue
- Machine Learning
- Published
- 2007-08-08
- Volume
- 69
- Issue
- 2-3
- Pages
- 169-192
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2129160848
- Cited by
- 828
- References
- 18
- FWCI
- 18.12
- 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.