Reference health
On-line prediction and conversion strategies
8/8 checkable references clean · checked 2026-09-02
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
13 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 8 checked references that resolve
resolves10.1109/72.501719
Worst-case quadratic loss bounds for prediction using linear functions and gradient descent
resolves10.1214/aoms/1177729330
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
The 13 references without a DOI — listed, not checked
no DOI — not checkedAarts, E. & Korst, J. (1989).Simulated Annealing and Boltzmann Machines. John Wiley and Sons.
no DOI — not checkedAlon, N., Spencer, J.H. & Erd?s, P. (1992).The Probabilistic Method. John Wiley and Sons.
no DOI — not checkedAngluinD. (1988). Queries and concept learning.Machine Learning, 2:319?342.
no DOI — not checkedAuer, P. & Long, P.M. (to appear). Structural results about on-line learing models with and without queries.Machine Learning.
no DOI — not checkedBardzinJ.M. & FreivaldsR.V. (1972). On the prediction of general recursive functions.Soviet Math. Dokl., 13:1224?1228.
no DOI — not checkedBerlekamp, E.R. (1968).Error-Correcting Codes. John Wiley and Sons.
no DOI — not checkedCesa-Bianchi, N., Freund, Y., Helmbold, D.P., Haussler, D., Schapire, R. & Warmuth, M.K. (1995). How to use expert advice. To appear inJournal of the ACM.
no DOI — not checkedGraham, R.L., Knuth, D.E. & Patashnik, O. (1989).Concrete Mathematics. Addison Wesley.
no DOI — not checkedKivinenJ. & WarmuthM.K. (1994). Using experts for predicting continuous outcomes. InComputational Learning Theory: Eurocolt '93. The Institute of Mathematics and its Applications Conference Series, number 53, pages 109?120, Oxford: Oxford University Press.
no DOI — not checkedLittlestoneN. (1988). Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm.Machine Learning, 2(4):285?318.
no DOI — not checkedLittlestone, N. (1989).Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, University of California at Santa Cruz.
no DOI — not checkedMitchell, T.M. (1977). Version spaces: A candidate elimination approach to rule learning. InProceedings International Joint Conference on Artificial Intelligence, pages 305?310, Cambridge, Mass.
no DOI — not checkedUlam, S. (1977).Adventures of a Mathematician. Scribners.
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-09-02 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1007/bf00115301"><img src="https://citestamp.com/citestamped/10.1007/bf00115301/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.1007/bf00115301)