{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ITH23XK4E5GICD4DKZKIYLFQYE","short_pith_number":"pith:ITH23XK4","schema_version":"1.0","canonical_sha256":"44cfaddd5c274c810f8356548c2cb0c1359a494f962619736e64efc1aaec7aa0","source":{"kind":"arxiv","id":"1901.08164","version":4},"attestation_state":"computed","paper":{"title":"Decoupled Greedy Learning of CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Edouard Oyallon, Eugene Belilovsky, Michael Eickenberg","submitted_at":"2019-01-23T23:20:44Z","abstract_excerpt":"A commonly cited inefficiency of neural network training by back-propagation is the update locking problem: each layer must wait for the signal to propagate through the full network before updating. Several alternatives that can alleviate this issue have been proposed. In this context, we consider a simpler, but more effective, substitute that uses minimal feedback, which we call Decoupled Greedy Learning (DGL). It is based on a greedy relaxation of the joint training objective, recently shown to be effective in the context of Convolutional Neural Networks (CNNs) on large-scale image classific"},"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":"1901.08164","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-23T23:20:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"38b42eaba9ac048bbd6be4af2f17e1d04fa54430ba8a715f96eb01e2a00ef21e","abstract_canon_sha256":"66fe8bf7908b823a4f817131f454018c316944ad92fd48299ef49e5845040c05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:39.199852Z","signature_b64":"2cixef35q0U8yInbbMuIdcXlcSjTjicDrdOzKPROYjGHMLsH7sZLrwKHvQs5/yXua4XnvcS29O/4Dip+hJhbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44cfaddd5c274c810f8356548c2cb0c1359a494f962619736e64efc1aaec7aa0","last_reissued_at":"2026-07-05T01:11:39.199430Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:39.199430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoupled Greedy Learning of CNNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Edouard Oyallon, Eugene Belilovsky, Michael Eickenberg","submitted_at":"2019-01-23T23:20:44Z","abstract_excerpt":"A commonly cited inefficiency of neural network training by back-propagation is the update locking problem: each layer must wait for the signal to propagate through the full network before updating. Several alternatives that can alleviate this issue have been proposed. In this context, we consider a simpler, but more effective, substitute that uses minimal feedback, which we call Decoupled Greedy Learning (DGL). It is based on a greedy relaxation of the joint training objective, recently shown to be effective in the context of Convolutional Neural Networks (CNNs) on large-scale image classific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08164","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.08164/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1901.08164","created_at":"2026-07-05T01:11:39.199487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08164v4","created_at":"2026-07-05T01:11:39.199487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08164","created_at":"2026-07-05T01:11:39.199487+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITH23XK4E5GI","created_at":"2026-07-05T01:11:39.199487+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITH23XK4E5GICD4D","created_at":"2026-07-05T01:11:39.199487+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITH23XK4","created_at":"2026-07-05T01:11:39.199487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02625","citing_title":"On the Acceleration of Deep Learning Model Parallelism with Staleness","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE","json":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE.json","graph_json":"https://pith.science/api/pith-number/ITH23XK4E5GICD4DKZKIYLFQYE/graph.json","events_json":"https://pith.science/api/pith-number/ITH23XK4E5GICD4DKZKIYLFQYE/events.json","paper":"https://pith.science/paper/ITH23XK4"},"agent_actions":{"view_html":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE","download_json":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE.json","view_paper":"https://pith.science/paper/ITH23XK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08164&json=true","fetch_graph":"https://pith.science/api/pith-number/ITH23XK4E5GICD4DKZKIYLFQYE/graph.json","fetch_events":"https://pith.science/api/pith-number/ITH23XK4E5GICD4DKZKIYLFQYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE/action/storage_attestation","attest_author":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE/action/author_attestation","sign_citation":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE/action/citation_signature","submit_replication":"https://pith.science/pith/ITH23XK4E5GICD4DKZKIYLFQYE/action/replication_record"}},"created_at":"2026-07-05T01:11:39.199487+00:00","updated_at":"2026-07-05T01:11:39.199487+00:00"}