{"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/unbounded-human-learning-optimal-scheduling","title":"Unbounded Human Learning: Optimal Scheduling for Spaced Repetition","arxiv_id":"1602.07032","date":"2016-02-23","proceeding":null,"authors":["Siddharth Reddy","Igor Labutov","Siddhartha Banerjee","Thorsten Joachims"],"abstract":"In the study of human learning, there is broad evidence that our ability to\nretain information improves with repeated exposure and decays with delay since\nlast exposure. This plays a crucial role in the design of educational software,\nleading to a trade-off between teaching new material and reviewing what has\nalready been taught. A common way to balance this trade-off is spaced\nrepetition, which uses periodic review of content to improve long-term\nretention. Though spaced repetition is widely used in practice, e.g., in\nelectronic flashcard software, there is little formal understanding of the\ndesign of these systems. Our paper addresses this gap in three ways. First, we\nmine log data from spaced repetition software to establish the functional\ndependence of retention on reinforcement and delay. Second, we use this memory\nmodel to develop a stochastic model for spaced repetition systems. We propose a\nqueueing network model of the Leitner system for reviewing flashcards, along\nwith a heuristic approximation that admits a tractable optimization problem for\nreview scheduling. Finally, we empirically evaluate our queueing model through\na Mechanical Turk experiment, verifying a key qualitative prediction of our\nmodel: the existence of a sharp phase transition in learning outcomes upon\nincreasing the rate of new item introductions.","url_abs":"http://arxiv.org/abs/1602.07032v2","url_pdf":"http://arxiv.org/pdf/1602.07032v2.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":"unbounded-human-learning-optimal-scheduling","repo_url":"https://github.com/rddy/leitnerq","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"scheduling","task_name":"Scheduling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.07032","atlas_url":"https://app.syntology.ai/?focus=1602.07032","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1602.07032"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.07032\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.07032"},"call":"get_concepts_for_paper(arxiv_id=\"1602.07032\")"}],"by_repo":[{"repo":"rddy/leitnerq","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"daf0e15184266adb49e9f6b2cd99fd10da9e49f05d279db6856010785b524238","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}