The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient algorithms for online decision problems
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Cited by
(2010) · Cited by 8,261
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2161027 · Cited by 947
Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness
Kearns, M., Neel, S., Roth, A., & Wu, Z. S. (2017) · arXiv · doi:10.48550/arxiv.1711.05144 · Cited by 469
Adaptive bound optimization for online convex optimization
McMahan, H. B., & Streeter, M. (2010) · arXiv · doi:10.48550/arxiv.1002.4908 · Cited by 227
On the Compatibility of Privacy and Fairness
Cummings, R., Gupta, V., Kimpara, D., & Morgenstern, J. (2019) · Adjunct Publication of the 27th Conference on User Modeling, Adaptation and Personalization · doi:10.1145/3314183.3323847 · Cited by 133
Shampoo: Preconditioned Stochastic Tensor Optimization
Gupta, V., Koren, T., & Singer, Y. (2018) · arXiv · doi:10.48550/arxiv.1802.09568 · Cited by 62
Practical and private (deep) learning without sampling or shuffling
Kairouz, P., McMahan, B., Song, S., Thakkar, O., Thakurta, A., & Xu, Z. (2021) · arXiv · doi:10.48550/arxiv.2103.00039 · Cited by 52
Metadata
- Authors
- Kalai, A., & Vempala, S.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2005-10
- Volume
- 71
- Issue
- 3
- Pages
- 291-307
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2169401877
- Cited by
- 591
- References
- 1
- FWCI
- 22.01
- 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.
