{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ACWDYRHMYBGD3Q742ZLESDELZK","short_pith_number":"pith:ACWDYRHM","schema_version":"1.0","canonical_sha256":"00ac3c44ecc04c3dc3fcd656490c8bcaab32b7a840739afd5409f7f3810b9284","source":{"kind":"arxiv","id":"2310.04614","version":3},"attestation_state":"computed","paper":{"title":"Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Avetik Karagulyan, Hanmin Li, Peter Richt\\'arik","submitted_at":"2023-10-06T22:19:07Z","abstract_excerpt":"Matrix-stepsized gradient descent algorithms have been shown to have superior performance in non-convex optimization problems compared to their scalar counterparts. The det-CGD algorithm, as introduced by Li et al. (2023), leverages matrix stepsizes to perform compressed gradient descent for non-convex objectives and matrix-smooth problems in a federated manner. The authors establish the algorithm's convergence to a neighborhood of a weighted stationarity point under a convex condition for the symmetric and positive-definite matrix stepsize. In this paper, we propose two variance-reduced versi"},"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":"2310.04614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-06T22:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"94ad17e38712058673e596d208d9459b92f955d97d02d42a9a457e817d8d5c88","abstract_canon_sha256":"b7dd9d59038db0e02f022f09f98120c4ae4cae10131e15e9345352206623eef1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:20.886217Z","signature_b64":"/FHD4jBpP6x5v3p4ZURagsmY18Fd8C8jicQfcr+O06tsWdaCmjWTJxLMr6GomVzThVt1tFl4knDg5uq6HZCCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00ac3c44ecc04c3dc3fcd656490c8bcaab32b7a840739afd5409f7f3810b9284","last_reissued_at":"2026-07-05T09:18:20.885811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:20.885811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Avetik Karagulyan, Hanmin Li, Peter Richt\\'arik","submitted_at":"2023-10-06T22:19:07Z","abstract_excerpt":"Matrix-stepsized gradient descent algorithms have been shown to have superior performance in non-convex optimization problems compared to their scalar counterparts. The det-CGD algorithm, as introduced by Li et al. (2023), leverages matrix stepsizes to perform compressed gradient descent for non-convex objectives and matrix-smooth problems in a federated manner. The authors establish the algorithm's convergence to a neighborhood of a weighted stationarity point under a convex condition for the symmetric and positive-definite matrix stepsize. In this paper, we propose two variance-reduced versi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04614","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.04614/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":"2310.04614","created_at":"2026-07-05T09:18:20.885862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04614v3","created_at":"2026-07-05T09:18:20.885862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04614","created_at":"2026-07-05T09:18:20.885862+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACWDYRHMYBGD","created_at":"2026-07-05T09:18:20.885862+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACWDYRHMYBGD3Q74","created_at":"2026-07-05T09:18:20.885862+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACWDYRHM","created_at":"2026-07-05T09:18:20.885862+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/ACWDYRHMYBGD3Q742ZLESDELZK","json":"https://pith.science/pith/ACWDYRHMYBGD3Q742ZLESDELZK.json","graph_json":"https://pith.science/api/pith-number/ACWDYRHMYBGD3Q742ZLESDELZK/graph.json","events_json":"https://pith.science/api/pith-number/ACWDYRHMYBGD3Q742ZLESDELZK/events.json","paper":"https://pith.science/paper/ACWDYRHM"},"agent_actions":{"view_html":"https://pith.science/pith/ACWDYRHMYBGD3Q742ZLESDELZK","download_json":"https://pith.science/pith/ACWDYRHMYBGD3Q742ZLESDELZK.json","view_paper":"https://pith.science/paper/ACWDYRHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04614&json=true","fetch_graph":"https://pith.science/api/pith-number/ACWDYRHMYBGD3Q742ZLESDELZK/graph.json","fetch_events":"https://pith.science/api/pith-number/ACWDYRHMYBGD3Q742ZLESDELZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACWDYRHMYBGD3Q742ZLESDELZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACWDYRHMYBGD3Q742ZLESDELZK/action/storage_attestation","attest_author":"https://pith.science/pith/ACWDYRHMYBGD3Q742ZLESDELZK/action/author_attestation","sign_citation":"https://pith.science/pith/ACWDYRHMYBGD3Q742ZLESDELZK/action/citation_signature","submit_replication":"https://pith.science/pith/ACWDYRHMYBGD3Q742ZLESDELZK/action/replication_record"}},"created_at":"2026-07-05T09:18:20.885862+00:00","updated_at":"2026-07-05T09:18:20.885862+00:00"}