{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:M7YCNOKIKTBDPWNIPRONZ2IUWF","short_pith_number":"pith:M7YCNOKI","schema_version":"1.0","canonical_sha256":"67f026b94854c237d9a87c5cdce914b14123e0c1f8dfef23be54948bd0013840","source":{"kind":"arxiv","id":"2004.04729","version":2},"attestation_state":"computed","paper":{"title":"Dithered backprop: A sparse and quantized backpropagation algorithm for more efficient deep neural network training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kevin Kepp, Simon Wiedemann, Temesgen Mehari, Wojciech Samek","submitted_at":"2020-04-09T17:59:26Z","abstract_excerpt":"Deep Neural Networks are successful but highly computationally expensive learning systems. One of the main sources of time and energy drains is the well known backpropagation (backprop) algorithm, which roughly accounts for 2/3 of the computational complexity of training. In this work we propose a method for reducing the computational cost of backprop, which we named dithered backprop. It consists in applying a stochastic quantization scheme to intermediate results of the method. The particular quantisation scheme, called non-subtractive dither (NSD), induces sparsity which can be exploited by"},"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":"2004.04729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-09T17:59:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"525e128f6257a9a809e41934fd64e807db926d4d23c3e987fef2e15a490ec409","abstract_canon_sha256":"9caa36714a53203a095e0ecdb7c74dd6bbede9bb5814167f3ab3a60772ce6f3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:31.556076Z","signature_b64":"FN8ef9GUi17xdl46qrzrG/ANWKxiqSyN/ucMzr5T9jK86JNTYy7YzPLVO1K83/37Z3WwSx21veypqbAJdBu1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67f026b94854c237d9a87c5cdce914b14123e0c1f8dfef23be54948bd0013840","last_reissued_at":"2026-07-05T00:55:31.555690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:31.555690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dithered backprop: A sparse and quantized backpropagation algorithm for more efficient deep neural network training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kevin Kepp, Simon Wiedemann, Temesgen Mehari, Wojciech Samek","submitted_at":"2020-04-09T17:59:26Z","abstract_excerpt":"Deep Neural Networks are successful but highly computationally expensive learning systems. One of the main sources of time and energy drains is the well known backpropagation (backprop) algorithm, which roughly accounts for 2/3 of the computational complexity of training. In this work we propose a method for reducing the computational cost of backprop, which we named dithered backprop. It consists in applying a stochastic quantization scheme to intermediate results of the method. The particular quantisation scheme, called non-subtractive dither (NSD), induces sparsity which can be exploited by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.04729","kind":"arxiv","version":2},"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/2004.04729/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":"2004.04729","created_at":"2026-07-05T00:55:31.555746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.04729v2","created_at":"2026-07-05T00:55:31.555746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.04729","created_at":"2026-07-05T00:55:31.555746+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7YCNOKIKTBD","created_at":"2026-07-05T00:55:31.555746+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7YCNOKIKTBDPWNI","created_at":"2026-07-05T00:55:31.555746+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7YCNOKI","created_at":"2026-07-05T00:55:31.555746+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF","json":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF.json","graph_json":"https://pith.science/api/pith-number/M7YCNOKIKTBDPWNIPRONZ2IUWF/graph.json","events_json":"https://pith.science/api/pith-number/M7YCNOKIKTBDPWNIPRONZ2IUWF/events.json","paper":"https://pith.science/paper/M7YCNOKI"},"agent_actions":{"view_html":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF","download_json":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF.json","view_paper":"https://pith.science/paper/M7YCNOKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.04729&json=true","fetch_graph":"https://pith.science/api/pith-number/M7YCNOKIKTBDPWNIPRONZ2IUWF/graph.json","fetch_events":"https://pith.science/api/pith-number/M7YCNOKIKTBDPWNIPRONZ2IUWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF/action/storage_attestation","attest_author":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF/action/author_attestation","sign_citation":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF/action/citation_signature","submit_replication":"https://pith.science/pith/M7YCNOKIKTBDPWNIPRONZ2IUWF/action/replication_record"}},"created_at":"2026-07-05T00:55:31.555746+00:00","updated_at":"2026-07-05T00:55:31.555746+00:00"}