{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IS4HFIOMZXHVO74EV3XH5WVQDQ","short_pith_number":"pith:IS4HFIOM","schema_version":"1.0","canonical_sha256":"44b872a1cccdcf577f84aeee7edab01c24ccdb7e44ada84b55ea774d04cded00","source":{"kind":"arxiv","id":"1705.07070","version":1},"attestation_state":"computed","paper":{"title":"EE-Grad: Exploration and Exploitation for Cost-Efficient Mini-Batch SGD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew C. Singer, Maxim Raginsky, Mehmet A. Donmez","submitted_at":"2017-05-19T16:16:42Z","abstract_excerpt":"We present a generic framework for trading off fidelity and cost in computing stochastic gradients when the costs of acquiring stochastic gradients of different quality are not known a priori. We consider a mini-batch oracle that distributes a limited query budget over a number of stochastic gradients and aggregates them to estimate the true gradient. Since the optimal mini-batch size depends on the unknown cost-fidelity function, we propose an algorithm, {\\it EE-Grad}, that sequentially explores the performance of mini-batch oracles and exploits the accumulated knowledge to estimate the one a"},"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":"1705.07070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-19T16:16:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7ff161eab64918cd3ea273dc17b95653224245fbf55a05c71ef9abd3bd68fcf3","abstract_canon_sha256":"f4d2bb640dd7b310114b19d0fea26fab1525d91c87105d715ce54286e221589a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:10.692310Z","signature_b64":"MvxC6QWil9goqVyMS3YkDA/yqIRjncbdA9qh1aCeGslzx30n3l8ZHfbCImW6oUbV0r2lZhydcMoztbN1HorYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b872a1cccdcf577f84aeee7edab01c24ccdb7e44ada84b55ea774d04cded00","last_reissued_at":"2026-05-18T00:44:10.691779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:10.691779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EE-Grad: Exploration and Exploitation for Cost-Efficient Mini-Batch SGD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew C. Singer, Maxim Raginsky, Mehmet A. Donmez","submitted_at":"2017-05-19T16:16:42Z","abstract_excerpt":"We present a generic framework for trading off fidelity and cost in computing stochastic gradients when the costs of acquiring stochastic gradients of different quality are not known a priori. We consider a mini-batch oracle that distributes a limited query budget over a number of stochastic gradients and aggregates them to estimate the true gradient. Since the optimal mini-batch size depends on the unknown cost-fidelity function, we propose an algorithm, {\\it EE-Grad}, that sequentially explores the performance of mini-batch oracles and exploits the accumulated knowledge to estimate the one a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07070","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":""},"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":"1705.07070","created_at":"2026-05-18T00:44:10.691859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07070v1","created_at":"2026-05-18T00:44:10.691859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07070","created_at":"2026-05-18T00:44:10.691859+00:00"},{"alias_kind":"pith_short_12","alias_value":"IS4HFIOMZXHV","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IS4HFIOMZXHVO74E","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IS4HFIOM","created_at":"2026-05-18T12:31:21.493067+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/IS4HFIOMZXHVO74EV3XH5WVQDQ","json":"https://pith.science/pith/IS4HFIOMZXHVO74EV3XH5WVQDQ.json","graph_json":"https://pith.science/api/pith-number/IS4HFIOMZXHVO74EV3XH5WVQDQ/graph.json","events_json":"https://pith.science/api/pith-number/IS4HFIOMZXHVO74EV3XH5WVQDQ/events.json","paper":"https://pith.science/paper/IS4HFIOM"},"agent_actions":{"view_html":"https://pith.science/pith/IS4HFIOMZXHVO74EV3XH5WVQDQ","download_json":"https://pith.science/pith/IS4HFIOMZXHVO74EV3XH5WVQDQ.json","view_paper":"https://pith.science/paper/IS4HFIOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07070&json=true","fetch_graph":"https://pith.science/api/pith-number/IS4HFIOMZXHVO74EV3XH5WVQDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IS4HFIOMZXHVO74EV3XH5WVQDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IS4HFIOMZXHVO74EV3XH5WVQDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IS4HFIOMZXHVO74EV3XH5WVQDQ/action/storage_attestation","attest_author":"https://pith.science/pith/IS4HFIOMZXHVO74EV3XH5WVQDQ/action/author_attestation","sign_citation":"https://pith.science/pith/IS4HFIOMZXHVO74EV3XH5WVQDQ/action/citation_signature","submit_replication":"https://pith.science/pith/IS4HFIOMZXHVO74EV3XH5WVQDQ/action/replication_record"}},"created_at":"2026-05-18T00:44:10.691859+00:00","updated_at":"2026-05-18T00:44:10.691859+00:00"}