The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A Convergence Theorem for Non Negative Almost Supermartingales and Some Applications
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
(1967) · Cited by 23,719
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Self-citationAn analog of the minimax theorem for vector payoffs
Blackwell, D. (1956) · Pacific Journal of Mathematics · doi:10.2140/pjm.1956.6.1 · Cited by 740
Great Expectations: The Theory of Optimal Stopping.
Orkin, M., Chow, Y. S., Robbins, H. E., & Siegmund, D. (1975) · Journal of the American Statistical Association · doi:10.2307/2285852 · Cited by 702
Self-citationDvoretzky, A. (1956) · Contribution to the Theory of Statistics · doi:10.1525/9780520313880-007 · Cited by 323
Approximation Methods which Converge with Probability one
Blum, J. R. (1954) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728794 · Cited by 243
Gladyshev, E. G. (1965) · Theory of Probability and Its Applications · doi:10.1137/1110031 · Cited by 131
A Sharper Form of the Borel-Cantelli Lemma and the Strong Law
Dubins, L. E., & Freedman, D. A. (1965) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177700054 · Cited by 98
Cited by
Optimization Methods for Large-Scale Machine Learning
Bottou, L., Curtis, F. E., & Nocedal, J. (2018) · SIAM Review · doi:10.1137/16m1080173 · Cited by 3,128
Stochastic Gradient Descent Tricks
Bottou, L. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_25 · Cited by 1,929
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
The dropout learning algorithm
Baldi, P., & Sadowski, P. (2014) · Artificial Intelligence · doi:10.1016/j.artint.2014.02.004 · Cited by 340
“stochastic gradient descent in standard neural networks [38, 13, 14].”
Background
Metadata
- Authors
- Robbins, H., & Siegmund, D.
- Venue
- Herbert Robbins Selected Papers
- Publisher
- Springer New York
- Published
- 1985
- Pages
- 111-135
- OpenAlex
- W1577337550
- Cited by
- 412
- References
- 8
- FWCI
- 9.90
- Type
- book chapter
- 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: A Convergence Theorem for Non Negative Almost Supermartingales and Some Applications. https://app.cochat.ai/papers/10.1007/978-1-4612-5110-1_10
- The paper
- Robbins, H., & Siegmund, D. (1985). A Convergence Theorem for Non Negative Almost Supermartingales and Some Applications. Herbert Robbins Selected Papers. https://doi.org/10.1007/978-1-4612-5110-1_10
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.