{"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":"/method/uoro","slug":"uoro","name":"UORO","full_name":"Unbiased Online Recurrent Optimization","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"Unbiased Online Recurrent Optimization","paper":"/paper/unbiased-online-recurrent-optimization","first_author":"Corentin Tallec","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/unbiased-online-recurrent-optimization"},"source":{"url":"http://arxiv.org/abs/1702.05043v3","title":"Unbiased Online Recurrent Optimization","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Recurrent Neural Networks","url":"/methods/category/recurrent-neural-networks","pwc_aliases":[]}],"n_papers_tagged":6,"archive_num_papers":6,"papers_newest_first":[{"paper":null,"slug":"respiratory-motion-forecasting-with-online","title":"Real-time respiratory motion forecasting with online learning of recurrent neural networks for accurate targeting in externally guided radiotherapy","date":"2024-03-03","arxiv_id":"2403.01607","n_code_links":0,"syntology":null},{"paper":"/paper/online-real-time-recurrent-learning-using","slug":"online-real-time-recurrent-learning-using","title":"Scalable Real-Time Recurrent Learning Using Columnar-Constructive Networks","date":"2023-01-20","arxiv_id":"2302.05326","n_code_links":1,"syntology":null},{"paper":"/paper/prediction-of-the-position-of-external","slug":"prediction-of-the-position-of-external","title":"Prediction of the Position of External Markers Using a Recurrent Neural Network Trained With Unbiased Online Recurrent Optimization for Safe Lung Cancer Radiotherapy","date":"2021-06-02","arxiv_id":"2106.01100","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-the-variance-of-unbiased-online-recurrent","title":"On the Variance of Unbiased Online Recurrent Optimization","date":"2019-02-06","arxiv_id":"1902.02405","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximating-real-time-recurrent-learning","title":"Approximating Real-Time Recurrent Learning with Random Kronecker Factors","date":"2018-05-28","arxiv_id":"1805.10842","n_code_links":0,"syntology":null},{"paper":"/paper/unbiased-online-recurrent-optimization","slug":"unbiased-online-recurrent-optimization","title":"Unbiased Online Recurrent Optimization","date":"2017-02-16","arxiv_id":"1702.05043","n_code_links":1,"syntology":null}],"papers_shown":6,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":6,"with_a_code_link":3,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":6,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":null,"name":"Position","papers":2},{"task":"/task/respiratory-motion-forecasting","name":"Respiratory motion forecasting","papers":2},{"task":"/task/atari-games","name":"Atari Games","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/memorization","name":"Memorization","papers":1},{"task":"/task/motion-forecasting","name":"Motion Forecasting","papers":1},{"task":"/task/multivariate-time-series-forecasting","name":"Multivariate Time Series Forecasting","papers":1},{"task":"/task/time-series-forecasting","name":"Time Series Forecasting","papers":1},{"task":"/task/time-series-prediction","name":"Time Series Prediction","papers":1},{"task":"/task/regression-1","name":"regression","papers":1}],"tasks_shown":10,"n_tasks":10,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":1},{"year":"2019","papers":1},{"year":"2021","papers":1},{"year":"2023","papers":1},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/uoro"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=UORO","read_at":"2026-10-05T01:03:29+00:00","query":"UORO","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1702.05043","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'UORO' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"3baa7d20ef84c62061e3e6a0bcf1e2f08799e398389164db5d412a833e0b1704","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}