{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RCQ7N5ILUUTU7IQMN47OE2ZYYG","short_pith_number":"pith:RCQ7N5IL","schema_version":"1.0","canonical_sha256":"88a1f6f50ba5274fa20c6f3ee26b38c18f474d7e6a5722b8c91783825739c902","source":{"kind":"arxiv","id":"1106.4574","version":1},"attestation_state":"computed","paper":{"title":"Better Mini-Batch Algorithms via Accelerated Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrew Cotter, Karthik Sridharan, Nathan Srebro, Ohad Shamir","submitted_at":"2011-06-22T20:59:20Z","abstract_excerpt":"Mini-batch algorithms have been proposed as a way to speed-up stochastic convex optimization problems. We study how such algorithms can be improved using accelerated gradient methods. We provide a novel analysis, which shows how standard gradient methods may sometimes be insufficient to obtain a significant speed-up and propose a novel accelerated gradient algorithm, which deals with this deficiency, enjoys a uniformly superior guarantee and works well in practice."},"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":"1106.4574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-22T20:59:20Z","cross_cats_sorted":[],"title_canon_sha256":"bef95f71c8b097d6153659efc610362bab3ec07f418a6a7d984b36c0a332767c","abstract_canon_sha256":"6c469c335b27c46d987a422eaede9acbcf0c61fca980a0c6cea2651346112a2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:32.551729Z","signature_b64":"PEqIFnKDdl4pTPZMnfOc0WHwvvImvtJYPqs6bzepS/qsELYWr0eheVFVwp1wFE8ZoOH4GFmlDnqLfkOaQUbnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88a1f6f50ba5274fa20c6f3ee26b38c18f474d7e6a5722b8c91783825739c902","last_reissued_at":"2026-05-18T04:19:32.551305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:32.551305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Mini-Batch Algorithms via Accelerated Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrew Cotter, Karthik Sridharan, Nathan Srebro, Ohad Shamir","submitted_at":"2011-06-22T20:59:20Z","abstract_excerpt":"Mini-batch algorithms have been proposed as a way to speed-up stochastic convex optimization problems. We study how such algorithms can be improved using accelerated gradient methods. We provide a novel analysis, which shows how standard gradient methods may sometimes be insufficient to obtain a significant speed-up and propose a novel accelerated gradient algorithm, which deals with this deficiency, enjoys a uniformly superior guarantee and works well in practice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4574","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":"1106.4574","created_at":"2026-05-18T04:19:32.551376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.4574v1","created_at":"2026-05-18T04:19:32.551376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4574","created_at":"2026-05-18T04:19:32.551376+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCQ7N5ILUUTU","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCQ7N5ILUUTU7IQM","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCQ7N5IL","created_at":"2026-05-18T12:26:41.206345+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/RCQ7N5ILUUTU7IQMN47OE2ZYYG","json":"https://pith.science/pith/RCQ7N5ILUUTU7IQMN47OE2ZYYG.json","graph_json":"https://pith.science/api/pith-number/RCQ7N5ILUUTU7IQMN47OE2ZYYG/graph.json","events_json":"https://pith.science/api/pith-number/RCQ7N5ILUUTU7IQMN47OE2ZYYG/events.json","paper":"https://pith.science/paper/RCQ7N5IL"},"agent_actions":{"view_html":"https://pith.science/pith/RCQ7N5ILUUTU7IQMN47OE2ZYYG","download_json":"https://pith.science/pith/RCQ7N5ILUUTU7IQMN47OE2ZYYG.json","view_paper":"https://pith.science/paper/RCQ7N5IL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.4574&json=true","fetch_graph":"https://pith.science/api/pith-number/RCQ7N5ILUUTU7IQMN47OE2ZYYG/graph.json","fetch_events":"https://pith.science/api/pith-number/RCQ7N5ILUUTU7IQMN47OE2ZYYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCQ7N5ILUUTU7IQMN47OE2ZYYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCQ7N5ILUUTU7IQMN47OE2ZYYG/action/storage_attestation","attest_author":"https://pith.science/pith/RCQ7N5ILUUTU7IQMN47OE2ZYYG/action/author_attestation","sign_citation":"https://pith.science/pith/RCQ7N5ILUUTU7IQMN47OE2ZYYG/action/citation_signature","submit_replication":"https://pith.science/pith/RCQ7N5ILUUTU7IQMN47OE2ZYYG/action/replication_record"}},"created_at":"2026-05-18T04:19:32.551376+00:00","updated_at":"2026-05-18T04:19:32.551376+00:00"}