{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3IUIHACC22PQ3EU2PC4OEVALNB","short_pith_number":"pith:3IUIHACC","schema_version":"1.0","canonical_sha256":"da28838042d69f0d929a78b8e2540b6840d7306f0a1de685552c2652c1f38687","source":{"kind":"arxiv","id":"1702.05043","version":3},"attestation_state":"computed","paper":{"title":"Unbiased Online Recurrent Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Corentin Tallec, Yann Ollivier","submitted_at":"2017-02-16T16:38:08Z","abstract_excerpt":"The novel Unbiased Online Recurrent Optimization (UORO) algorithm allows for online learning of general recurrent computational graphs such as recurrent network models. It works in a streaming fashion and avoids backtracking through past activations and inputs. UORO is computationally as costly as Truncated Backpropagation Through Time (truncated BPTT), a widespread algorithm for online learning of recurrent networks. UORO is a modification of NoBackTrack that bypasses the need for model sparsity and makes implementation easy in current deep learning frameworks, even for complex models.\n  Like"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.05043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-02-16T16:38:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"188ec3300b76a10fda670f832e71f8e89dfd89dcdca036584c70943eeb1075ac","abstract_canon_sha256":"708e346feb9f3b253b2c64b994a942cd9be18f9a28af6fa296944a8dc1084fe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:54.522122Z","signature_b64":"dwKuJyELX+5PF2FZXQbWr1cgHg1Fwr9Z1KGZBmW2gbkFE781rTVP75t9rOuZGcvr8tzH1JPydG3AiDKq0cDtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da28838042d69f0d929a78b8e2540b6840d7306f0a1de685552c2652c1f38687","last_reissued_at":"2026-05-18T00:43:54.521410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:54.521410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbiased Online Recurrent Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Corentin Tallec, Yann Ollivier","submitted_at":"2017-02-16T16:38:08Z","abstract_excerpt":"The novel Unbiased Online Recurrent Optimization (UORO) algorithm allows for online learning of general recurrent computational graphs such as recurrent network models. It works in a streaming fashion and avoids backtracking through past activations and inputs. UORO is computationally as costly as Truncated Backpropagation Through Time (truncated BPTT), a widespread algorithm for online learning of recurrent networks. UORO is a modification of NoBackTrack that bypasses the need for model sparsity and makes implementation easy in current deep learning frameworks, even for complex models.\n  Like"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05043","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.05043","created_at":"2026-05-18T00:43:54.521527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05043v3","created_at":"2026-05-18T00:43:54.521527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05043","created_at":"2026-05-18T00:43:54.521527+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IUIHACC22PQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IUIHACC22PQ3EU2","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IUIHACC","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.02649","citing_title":"A Unified Framework of Online Learning Algorithms for Training Recurrent Neural Networks","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2410.05882","citing_title":"Frame forecasting in cine MRI using the PCA respiratory motion model: comparing recurrent neural networks trained online and transformers","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB","json":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB.json","graph_json":"https://pith.science/api/pith-number/3IUIHACC22PQ3EU2PC4OEVALNB/graph.json","events_json":"https://pith.science/api/pith-number/3IUIHACC22PQ3EU2PC4OEVALNB/events.json","paper":"https://pith.science/paper/3IUIHACC"},"agent_actions":{"view_html":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB","download_json":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB.json","view_paper":"https://pith.science/paper/3IUIHACC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05043&json=true","fetch_graph":"https://pith.science/api/pith-number/3IUIHACC22PQ3EU2PC4OEVALNB/graph.json","fetch_events":"https://pith.science/api/pith-number/3IUIHACC22PQ3EU2PC4OEVALNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/action/storage_attestation","attest_author":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/action/author_attestation","sign_citation":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/action/citation_signature","submit_replication":"https://pith.science/pith/3IUIHACC22PQ3EU2PC4OEVALNB/action/replication_record"}},"created_at":"2026-05-18T00:43:54.521527+00:00","updated_at":"2026-05-18T00:43:54.521527+00:00"}