{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T6PBMGKWELQG5TA764ZU3ZW2KX","short_pith_number":"pith:T6PBMGKW","schema_version":"1.0","canonical_sha256":"9f9e16195622e06ecc1ff7334de6da55e78a7a32901af8e115f8a74479908aee","source":{"kind":"arxiv","id":"1910.00762","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Deep Learning by Focusing on the Biggest Losers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Angela H. Jiang, Daniel L.-K. Wong, David G. Andersen, Gauri Joshi, Giulio Zhou, Gregory R. Ganger, Jeffrey Dean, Michael Kaminksy, Michael Kozuch, Padmanabhan Pillai, Zachary C. Lipton","submitted_at":"2019-10-02T03:34:29Z","abstract_excerpt":"This paper introduces Selective-Backprop, a technique that accelerates the training of deep neural networks (DNNs) by prioritizing examples with high loss at each iteration. Selective-Backprop uses the output of a training example's forward pass to decide whether to use that example to compute gradients and update parameters, or to skip immediately to the next example. By reducing the number of computationally-expensive backpropagation steps performed, Selective-Backprop accelerates training. Evaluation on CIFAR10, CIFAR100, and SVHN, across a variety of modern image models, shows that Selecti"},"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":"1910.00762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-02T03:34:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1b6030ec506a23d8cbe83366dac0555bea96b2770716fb9e36f8ce1c78e17401","abstract_canon_sha256":"e770c048aa098a76ef26910f494b10c573b75f8d90754aa25fc5a5ad5bbd3472"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:09:18.848388Z","signature_b64":"Tt0uRBpNJKG26Y84NRK91ZAGqkEFp2Uhc0+RJSx2G5nM6kFcfX27JYhLG45VMBOa2dLWs3lsEnoZpY4gzTCKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f9e16195622e06ecc1ff7334de6da55e78a7a32901af8e115f8a74479908aee","last_reissued_at":"2026-07-05T00:09:18.847962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:09:18.847962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Deep Learning by Focusing on the Biggest Losers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Angela H. Jiang, Daniel L.-K. Wong, David G. Andersen, Gauri Joshi, Giulio Zhou, Gregory R. Ganger, Jeffrey Dean, Michael Kaminksy, Michael Kozuch, Padmanabhan Pillai, Zachary C. Lipton","submitted_at":"2019-10-02T03:34:29Z","abstract_excerpt":"This paper introduces Selective-Backprop, a technique that accelerates the training of deep neural networks (DNNs) by prioritizing examples with high loss at each iteration. Selective-Backprop uses the output of a training example's forward pass to decide whether to use that example to compute gradients and update parameters, or to skip immediately to the next example. By reducing the number of computationally-expensive backpropagation steps performed, Selective-Backprop accelerates training. Evaluation on CIFAR10, CIFAR100, and SVHN, across a variety of modern image models, shows that Selecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00762","kind":"arxiv","version":1},"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/1910.00762/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":"1910.00762","created_at":"2026-07-05T00:09:18.848019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.00762v1","created_at":"2026-07-05T00:09:18.848019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00762","created_at":"2026-07-05T00:09:18.848019+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6PBMGKWELQG","created_at":"2026-07-05T00:09:18.848019+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6PBMGKWELQG5TA7","created_at":"2026-07-05T00:09:18.848019+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6PBMGKW","created_at":"2026-07-05T00:09:18.848019+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.07023","citing_title":"Online Data Selection Is Implicit Alignment","ref_index":63,"is_internal_anchor":true},{"citing_arxiv_id":"2607.05903","citing_title":"K-ABENA: K-Adaptive Backpropagation with Error-based N-exclusion Algorithm : (Compensated Loss-Based Sample Exclusion with Unbiased Gradient Estimation)","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12913","citing_title":"Selecting Samples on Graphs: A Unified Dataset Pruning Framework for Lossless Training Acceleration","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11761","citing_title":"RCAP: Robust, Class-Aware, Probabilistic Dynamic Dataset Pruning","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02453","citing_title":"Initialization is Half the Battle: Generating Diverse Images from a Guidance Potential Posterior","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02565","citing_title":"Policy-based Foveated Imaging and Perception","ref_index":113,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31796","citing_title":"CHERRY: Compressed Hierarchical Experts with Recurrent Representational Yield","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30537","citing_title":"The Long-Term Effects of Data Selection in LLM Fine-Tuning","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2502.12272","citing_title":"Learning to Reason at the Frontier of Learnability","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2502.10248","citing_title":"Step-Video-T2V Technical Report: The Practice, Challenges, and Future of Video Foundation Model","ref_index":271,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07551","citing_title":"Disagreement-Regularized Importance Sampling for Adversarial Label Corruption","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX","json":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX.json","graph_json":"https://pith.science/api/pith-number/T6PBMGKWELQG5TA764ZU3ZW2KX/graph.json","events_json":"https://pith.science/api/pith-number/T6PBMGKWELQG5TA764ZU3ZW2KX/events.json","paper":"https://pith.science/paper/T6PBMGKW"},"agent_actions":{"view_html":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX","download_json":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX.json","view_paper":"https://pith.science/paper/T6PBMGKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.00762&json=true","fetch_graph":"https://pith.science/api/pith-number/T6PBMGKWELQG5TA764ZU3ZW2KX/graph.json","fetch_events":"https://pith.science/api/pith-number/T6PBMGKWELQG5TA764ZU3ZW2KX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX/action/storage_attestation","attest_author":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX/action/author_attestation","sign_citation":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX/action/citation_signature","submit_replication":"https://pith.science/pith/T6PBMGKWELQG5TA764ZU3ZW2KX/action/replication_record"}},"created_at":"2026-07-05T00:09:18.848019+00:00","updated_at":"2026-07-05T00:09:18.848019+00:00"}