{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RXKNTXU3PZGHE4BSCC2BOE4QWQ","short_pith_number":"pith:RXKNTXU3","schema_version":"1.0","canonical_sha256":"8dd4d9de9b7e4c72703210b4171390b42e28543d515ebef624a6ca4fe0000baa","source":{"kind":"arxiv","id":"2202.11599","version":2},"attestation_state":"computed","paper":{"title":"NysADMM: faster composite convex optimization via low-rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Madeleine Udell, Shipu Zhao, Zachary Frangella","submitted_at":"2022-02-23T16:23:17Z","abstract_excerpt":"This paper develops a scalable new algorithm, called NysADMM, to minimize a smooth convex loss function with a convex regularizer. NysADMM accelerates the inexact Alternating Direction Method of Multipliers (ADMM) by constructing a preconditioner for the ADMM subproblem from a randomized low-rank Nystr\\\"om approximation. NysADMM comes with strong theoretical guarantees: it solves the ADMM subproblem in a constant number of iterations when the rank of the Nystr\\\"om approximation is the effective dimension of the subproblem regularized Gram matrix. In practice, ranks much smaller than the effect"},"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":"2202.11599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-02-23T16:23:17Z","cross_cats_sorted":[],"title_canon_sha256":"696b0202d7c0e05056183076655affb3e7609fb1b52ba2b258452f51fdc7cf91","abstract_canon_sha256":"5ff8cc9f8d5b305cbbdaf492fb029d13f78e1cea25958fae8ffa6888d9a1cd25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:36:47.594687Z","signature_b64":"YEXXgDemJgD0enqvxHlKgLqxicRLJbntq08iOU1tTd/pklG2VcnkqI2D++DV4SbOYGnLYzzXA2TSHo+7NY5jDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dd4d9de9b7e4c72703210b4171390b42e28543d515ebef624a6ca4fe0000baa","last_reissued_at":"2026-07-05T04:36:47.594271Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:36:47.594271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NysADMM: faster composite convex optimization via low-rank approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Madeleine Udell, Shipu Zhao, Zachary Frangella","submitted_at":"2022-02-23T16:23:17Z","abstract_excerpt":"This paper develops a scalable new algorithm, called NysADMM, to minimize a smooth convex loss function with a convex regularizer. NysADMM accelerates the inexact Alternating Direction Method of Multipliers (ADMM) by constructing a preconditioner for the ADMM subproblem from a randomized low-rank Nystr\\\"om approximation. NysADMM comes with strong theoretical guarantees: it solves the ADMM subproblem in a constant number of iterations when the rank of the Nystr\\\"om approximation is the effective dimension of the subproblem regularized Gram matrix. In practice, ranks much smaller than the effect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.11599","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/2202.11599/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":"2202.11599","created_at":"2026-07-05T04:36:47.594336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.11599v2","created_at":"2026-07-05T04:36:47.594336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.11599","created_at":"2026-07-05T04:36:47.594336+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXKNTXU3PZGH","created_at":"2026-07-05T04:36:47.594336+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXKNTXU3PZGHE4BS","created_at":"2026-07-05T04:36:47.594336+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXKNTXU3","created_at":"2026-07-05T04:36:47.594336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13434","citing_title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ","json":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ.json","graph_json":"https://pith.science/api/pith-number/RXKNTXU3PZGHE4BSCC2BOE4QWQ/graph.json","events_json":"https://pith.science/api/pith-number/RXKNTXU3PZGHE4BSCC2BOE4QWQ/events.json","paper":"https://pith.science/paper/RXKNTXU3"},"agent_actions":{"view_html":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ","download_json":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ.json","view_paper":"https://pith.science/paper/RXKNTXU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.11599&json=true","fetch_graph":"https://pith.science/api/pith-number/RXKNTXU3PZGHE4BSCC2BOE4QWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RXKNTXU3PZGHE4BSCC2BOE4QWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ/action/storage_attestation","attest_author":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ/action/author_attestation","sign_citation":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ/action/citation_signature","submit_replication":"https://pith.science/pith/RXKNTXU3PZGHE4BSCC2BOE4QWQ/action/replication_record"}},"created_at":"2026-07-05T04:36:47.594336+00:00","updated_at":"2026-07-05T04:36:47.594336+00:00"}