{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2MUIKRHCYQVCB4AJ5CI4KWRVSE","short_pith_number":"pith:2MUIKRHC","schema_version":"1.0","canonical_sha256":"d3288544e2c42a20f009e891c55a35911389903effe9c121cc1f607e179f97e0","source":{"kind":"arxiv","id":"2307.01169","version":1},"attestation_state":"computed","paper":{"title":"Analyzing and Improving Greedy 2-Coordinate Updates for Equality-Constrained Optimization via Steepest Descent in the 1-Norm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Aaron Mishkin, Amrutha Varshini Ramesh, Jennifer She, Jonathan Wilder Lavington, Mark Schmidt, Yihan Zhou","submitted_at":"2023-07-03T17:27:18Z","abstract_excerpt":"We consider minimizing a smooth function subject to a summation constraint over its variables. By exploiting a connection between the greedy 2-coordinate update for this problem and equality-constrained steepest descent in the 1-norm, we give a convergence rate for greedy selection under a proximal Polyak-Lojasiewicz assumption that is faster than random selection and independent of the problem dimension $n$. We then consider minimizing with both a summation constraint and bound constraints, as arises in the support vector machine dual problem. Existing greedy rules for this setting either gua"},"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":"2307.01169","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-03T17:27:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"30face40ab2dc2abbdeae9d95396713aa902be959578d46191e2f841c1ed593a","abstract_canon_sha256":"d1343bf598b77b5956a4c91033ae403c016c4969db4b7426e3d32029f351c9fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:04.693513Z","signature_b64":"6xwQuiuoigWEEmTNZc8AXrdO1otKryZOdJ6XC2OsR20BDrHejIBRZm4fZAZLSh7+lCnA1M5h1D00V9nghMfsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3288544e2c42a20f009e891c55a35911389903effe9c121cc1f607e179f97e0","last_reissued_at":"2026-07-05T06:27:04.692932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:04.692932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing and Improving Greedy 2-Coordinate Updates for Equality-Constrained Optimization via Steepest Descent in the 1-Norm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Aaron Mishkin, Amrutha Varshini Ramesh, Jennifer She, Jonathan Wilder Lavington, Mark Schmidt, Yihan Zhou","submitted_at":"2023-07-03T17:27:18Z","abstract_excerpt":"We consider minimizing a smooth function subject to a summation constraint over its variables. By exploiting a connection between the greedy 2-coordinate update for this problem and equality-constrained steepest descent in the 1-norm, we give a convergence rate for greedy selection under a proximal Polyak-Lojasiewicz assumption that is faster than random selection and independent of the problem dimension $n$. We then consider minimizing with both a summation constraint and bound constraints, as arises in the support vector machine dual problem. Existing greedy rules for this setting either gua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01169","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.01169/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":"2307.01169","created_at":"2026-07-05T06:27:04.692991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01169v1","created_at":"2026-07-05T06:27:04.692991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01169","created_at":"2026-07-05T06:27:04.692991+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MUIKRHCYQVC","created_at":"2026-07-05T06:27:04.692991+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MUIKRHCYQVCB4AJ","created_at":"2026-07-05T06:27:04.692991+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MUIKRHC","created_at":"2026-07-05T06:27:04.692991+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/2MUIKRHCYQVCB4AJ5CI4KWRVSE","json":"https://pith.science/pith/2MUIKRHCYQVCB4AJ5CI4KWRVSE.json","graph_json":"https://pith.science/api/pith-number/2MUIKRHCYQVCB4AJ5CI4KWRVSE/graph.json","events_json":"https://pith.science/api/pith-number/2MUIKRHCYQVCB4AJ5CI4KWRVSE/events.json","paper":"https://pith.science/paper/2MUIKRHC"},"agent_actions":{"view_html":"https://pith.science/pith/2MUIKRHCYQVCB4AJ5CI4KWRVSE","download_json":"https://pith.science/pith/2MUIKRHCYQVCB4AJ5CI4KWRVSE.json","view_paper":"https://pith.science/paper/2MUIKRHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01169&json=true","fetch_graph":"https://pith.science/api/pith-number/2MUIKRHCYQVCB4AJ5CI4KWRVSE/graph.json","fetch_events":"https://pith.science/api/pith-number/2MUIKRHCYQVCB4AJ5CI4KWRVSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MUIKRHCYQVCB4AJ5CI4KWRVSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MUIKRHCYQVCB4AJ5CI4KWRVSE/action/storage_attestation","attest_author":"https://pith.science/pith/2MUIKRHCYQVCB4AJ5CI4KWRVSE/action/author_attestation","sign_citation":"https://pith.science/pith/2MUIKRHCYQVCB4AJ5CI4KWRVSE/action/citation_signature","submit_replication":"https://pith.science/pith/2MUIKRHCYQVCB4AJ5CI4KWRVSE/action/replication_record"}},"created_at":"2026-07-05T06:27:04.692991+00:00","updated_at":"2026-07-05T06:27:04.692991+00:00"}