{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VUONTA5VATYAFPGNSPV6OWNGGL","short_pith_number":"pith:VUONTA5V","schema_version":"1.0","canonical_sha256":"ad1cd983b504f002bccd93ebe759a632fb03b15cb422accc42dd5d628eb76b31","source":{"kind":"arxiv","id":"2106.08775","version":2},"attestation_state":"computed","paper":{"title":"Momentum-inspired Low-Rank Coordinate Descent for Diagonally Constrained SDPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.MS","math.IT","stat.ML"],"primary_cat":"math.OC","authors_text":"Anastasios Kyrillidis, Cameron Wolfe, JA Lara Benitez, Junhyung Lyle Kim, Mohammad Taha Toghani, Zhiwei Zhang","submitted_at":"2021-06-16T13:35:40Z","abstract_excerpt":"We present a novel, practical, and provable approach for solving diagonally constrained semi-definite programming (SDP) problems at scale using accelerated non-convex programming. Our algorithm non-trivially combines acceleration motions from convex optimization with coordinate power iteration and matrix factorization techniques. The algorithm is extremely simple to implement, and adds only a single extra hyperparameter -- momentum. We prove that our method admits local linear convergence in the neighborhood of the optimum and always converges to a first-order critical point. Experimentally, w"},"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":"2106.08775","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-06-16T13:35:40Z","cross_cats_sorted":["cs.IT","cs.LG","cs.MS","math.IT","stat.ML"],"title_canon_sha256":"d30fdec98bcd0d35d7b3378d45870a96c0558526c2ac402f2f71e5ac34666709","abstract_canon_sha256":"0f20d023f7dc45e2c7066a306f0f30be874ec4248a145c286dee9a0a1ef3bc9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:00.248381Z","signature_b64":"vg32FbTt6oqHpQJ/cHThRFF8Tjl0dfegLUFUkrahc7V9U4K5As2W2MVrzmJU92kUAo6BvEAiSzeqtaRhbDouCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad1cd983b504f002bccd93ebe759a632fb03b15cb422accc42dd5d628eb76b31","last_reissued_at":"2026-07-05T05:39:00.247930Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:00.247930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Momentum-inspired Low-Rank Coordinate Descent for Diagonally Constrained SDPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.MS","math.IT","stat.ML"],"primary_cat":"math.OC","authors_text":"Anastasios Kyrillidis, Cameron Wolfe, JA Lara Benitez, Junhyung Lyle Kim, Mohammad Taha Toghani, Zhiwei Zhang","submitted_at":"2021-06-16T13:35:40Z","abstract_excerpt":"We present a novel, practical, and provable approach for solving diagonally constrained semi-definite programming (SDP) problems at scale using accelerated non-convex programming. Our algorithm non-trivially combines acceleration motions from convex optimization with coordinate power iteration and matrix factorization techniques. The algorithm is extremely simple to implement, and adds only a single extra hyperparameter -- momentum. We prove that our method admits local linear convergence in the neighborhood of the optimum and always converges to a first-order critical point. Experimentally, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08775","kind":"arxiv","version":2},"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/2106.08775/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":"2106.08775","created_at":"2026-07-05T05:39:00.247986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.08775v2","created_at":"2026-07-05T05:39:00.247986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08775","created_at":"2026-07-05T05:39:00.247986+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUONTA5VATYA","created_at":"2026-07-05T05:39:00.247986+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUONTA5VATYAFPGN","created_at":"2026-07-05T05:39:00.247986+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUONTA5V","created_at":"2026-07-05T05:39:00.247986+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/VUONTA5VATYAFPGNSPV6OWNGGL","json":"https://pith.science/pith/VUONTA5VATYAFPGNSPV6OWNGGL.json","graph_json":"https://pith.science/api/pith-number/VUONTA5VATYAFPGNSPV6OWNGGL/graph.json","events_json":"https://pith.science/api/pith-number/VUONTA5VATYAFPGNSPV6OWNGGL/events.json","paper":"https://pith.science/paper/VUONTA5V"},"agent_actions":{"view_html":"https://pith.science/pith/VUONTA5VATYAFPGNSPV6OWNGGL","download_json":"https://pith.science/pith/VUONTA5VATYAFPGNSPV6OWNGGL.json","view_paper":"https://pith.science/paper/VUONTA5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.08775&json=true","fetch_graph":"https://pith.science/api/pith-number/VUONTA5VATYAFPGNSPV6OWNGGL/graph.json","fetch_events":"https://pith.science/api/pith-number/VUONTA5VATYAFPGNSPV6OWNGGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUONTA5VATYAFPGNSPV6OWNGGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUONTA5VATYAFPGNSPV6OWNGGL/action/storage_attestation","attest_author":"https://pith.science/pith/VUONTA5VATYAFPGNSPV6OWNGGL/action/author_attestation","sign_citation":"https://pith.science/pith/VUONTA5VATYAFPGNSPV6OWNGGL/action/citation_signature","submit_replication":"https://pith.science/pith/VUONTA5VATYAFPGNSPV6OWNGGL/action/replication_record"}},"created_at":"2026-07-05T05:39:00.247986+00:00","updated_at":"2026-07-05T05:39:00.247986+00:00"}