{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/learning-to-predict-by-the-methods-of","title":"Learning to Predict by the Methods of Temporal Differences","arxiv_id":null,"date":"1988-03-09","proceeding":"Machine Learning 1988 3","authors":["Richard S. Sutton"],"abstract":"This article introduces a class of incremental learning procedures specialized for prediction that is, for using past experience with an incompletely known\r\nsystem to predict its future behavior. Whereas conventional prediction-learning\r\nmethods assign credit by means of the difference between predicted and actual outcomes, tile new methods assign credit by means of the difference between temporally\r\nsuccessive predictions. Although such temporal-difference method~ have been used in\r\nSamuel's checker player, Holland's bucket brigade, and the author's Adaptive Heuristic Critic, they have remained poorly understood. Here we prove their convergence\r\nand optimality for special cases and relate them to supervised-learning methods. For\r\nmost real-world prediction problems, telnporal-differenee methods require less memory and less peak computation than conventional methods and they produce more\r\naccurate predictions. We argue that most problems to which supervised learning\r\nis currently applied are really prediction problems of the sort to which temporaldifference methods can be applied to advantage.","url_abs":"http://incompleteideas.net/papers/sutton-88-with-erratum.pdf","url_pdf":"http://incompleteideas.net/papers/sutton-88-with-erratum.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-to-predict-by-the-methods-of","repo_url":"https://github.com/mindspore-courses/Rainbow-MindSpore","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"incremental-learning","task_name":"Incremental Learning"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"mindspore-courses/Rainbow-MindSpore","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1511.05952"],"harvested_for_calls":[{"arxiv_id":"1511.05952","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1511.05952"},"call":"get_harvested_code_for_paper(arxiv_id=\"1511.05952\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a8bd0a84e3052e2c4c1f62048883e8b23bebc25462d5d4d0d4b7a3bf81105065","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}