{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KV6VYIZDWYC5YHRWBBCJZDR4P6","short_pith_number":"pith:KV6VYIZD","schema_version":"1.0","canonical_sha256":"557d5c2323b605dc1e3608449c8e3c7fb1c70b050ee8156b39295d23407b1344","source":{"kind":"arxiv","id":"1507.02000","version":3},"attestation_state":"computed","paper":{"title":"An optimal randomized incremental gradient method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.ML"],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Yi Zhou","submitted_at":"2015-07-08T00:49:52Z","abstract_excerpt":"In this paper, we consider a class of finite-sum convex optimization problems whose objective function is given by the summation of $m$ ($\\ge 1$) smooth components together with some other relatively simple terms. We first introduce a deterministic primal-dual gradient (PDG) method that can achieve the optimal black-box iteration complexity for solving these composite optimization problems using a primal-dual termination criterion. Our major contribution is to develop a randomized primal-dual gradient (RPDG) method, which needs to compute the gradient of only one randomly selected smooth compo"},"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":"1507.02000","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-08T00:49:52Z","cross_cats_sorted":["cs.CC","stat.ML"],"title_canon_sha256":"d536930e4bd0dbf36564c6aab816ecf03ca5b52c65f891ede082ecb7033992f6","abstract_canon_sha256":"70c1c703dfa785dc8d28e8be843c1c69c2042b5e75a187c2dbdbdfd6e7e43b9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:20.690117Z","signature_b64":"p7xn6konkjrX63vzsWHhLx1jEZHOGoS7sqP9PWe/RIFdc70SU5k9CFYUPl38ep6mBiEqSpDud3sHnuJeQZt/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"557d5c2323b605dc1e3608449c8e3c7fb1c70b050ee8156b39295d23407b1344","last_reissued_at":"2026-05-18T01:29:20.689470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:20.689470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal randomized incremental gradient method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.ML"],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Yi Zhou","submitted_at":"2015-07-08T00:49:52Z","abstract_excerpt":"In this paper, we consider a class of finite-sum convex optimization problems whose objective function is given by the summation of $m$ ($\\ge 1$) smooth components together with some other relatively simple terms. We first introduce a deterministic primal-dual gradient (PDG) method that can achieve the optimal black-box iteration complexity for solving these composite optimization problems using a primal-dual termination criterion. Our major contribution is to develop a randomized primal-dual gradient (RPDG) method, which needs to compute the gradient of only one randomly selected smooth compo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02000","kind":"arxiv","version":3},"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":"1507.02000","created_at":"2026-05-18T01:29:20.689575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02000v3","created_at":"2026-05-18T01:29:20.689575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02000","created_at":"2026-05-18T01:29:20.689575+00:00"},{"alias_kind":"pith_short_12","alias_value":"KV6VYIZDWYC5","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KV6VYIZDWYC5YHRW","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KV6VYIZD","created_at":"2026-05-18T12:29:29.992203+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/KV6VYIZDWYC5YHRWBBCJZDR4P6","json":"https://pith.science/pith/KV6VYIZDWYC5YHRWBBCJZDR4P6.json","graph_json":"https://pith.science/api/pith-number/KV6VYIZDWYC5YHRWBBCJZDR4P6/graph.json","events_json":"https://pith.science/api/pith-number/KV6VYIZDWYC5YHRWBBCJZDR4P6/events.json","paper":"https://pith.science/paper/KV6VYIZD"},"agent_actions":{"view_html":"https://pith.science/pith/KV6VYIZDWYC5YHRWBBCJZDR4P6","download_json":"https://pith.science/pith/KV6VYIZDWYC5YHRWBBCJZDR4P6.json","view_paper":"https://pith.science/paper/KV6VYIZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02000&json=true","fetch_graph":"https://pith.science/api/pith-number/KV6VYIZDWYC5YHRWBBCJZDR4P6/graph.json","fetch_events":"https://pith.science/api/pith-number/KV6VYIZDWYC5YHRWBBCJZDR4P6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KV6VYIZDWYC5YHRWBBCJZDR4P6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KV6VYIZDWYC5YHRWBBCJZDR4P6/action/storage_attestation","attest_author":"https://pith.science/pith/KV6VYIZDWYC5YHRWBBCJZDR4P6/action/author_attestation","sign_citation":"https://pith.science/pith/KV6VYIZDWYC5YHRWBBCJZDR4P6/action/citation_signature","submit_replication":"https://pith.science/pith/KV6VYIZDWYC5YHRWBBCJZDR4P6/action/replication_record"}},"created_at":"2026-05-18T01:29:20.689575+00:00","updated_at":"2026-05-18T01:29:20.689575+00:00"}