{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:S4AMAHIWR55VJ6XA2LZVA3I5WW","short_pith_number":"pith:S4AMAHIW","schema_version":"1.0","canonical_sha256":"9700c01d168f7b54fae0d2f3506d1db5ace20a6d7f5fe8a04b3b390fef527a65","source":{"kind":"arxiv","id":"2106.11943","version":3},"attestation_state":"computed","paper":{"title":"Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Hassan Mortagy, Jai Moondra, Swati Gupta","submitted_at":"2021-06-22T17:29:24Z","abstract_excerpt":"Optimization algorithms such as projected Newton's method, FISTA, mirror descent, and its variants enjoy near-optimal regret bounds and convergence rates, but suffer from a computational bottleneck of computing ``projections'' in potentially each iteration (e.g., $O(T^{1/2})$ regret of online mirror descent). On the other hand, conditional gradient variants solve a linear optimization in each iteration, but result in suboptimal rates (e.g., $O(T^{3/4})$ regret of online Frank-Wolfe). Motivated by this trade-off in runtime v/s convergence rates, we consider iterative projections of close-by poi"},"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.11943","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-22T17:29:24Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b99574ef8a8c2a7b092a1a51cce977e78c0220cb2ae9fa57a7ab33dfe3990ae0","abstract_canon_sha256":"5f04e5a3d88530a87afa3889b42d70e3a820d78252f23c4b86688a4a056dba1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:52.401258Z","signature_b64":"f5ua1AgBwMPoNneR8gRzx27c4vGOveCUMZbIqfcIwt4W6GoojNZIVOEA4ua4tBwVsgNXKwAfGpnFngEGqqXYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9700c01d168f7b54fae0d2f3506d1db5ace20a6d7f5fe8a04b3b390fef527a65","last_reissued_at":"2026-07-05T05:49:52.400862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:52.400862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Hassan Mortagy, Jai Moondra, Swati Gupta","submitted_at":"2021-06-22T17:29:24Z","abstract_excerpt":"Optimization algorithms such as projected Newton's method, FISTA, mirror descent, and its variants enjoy near-optimal regret bounds and convergence rates, but suffer from a computational bottleneck of computing ``projections'' in potentially each iteration (e.g., $O(T^{1/2})$ regret of online mirror descent). On the other hand, conditional gradient variants solve a linear optimization in each iteration, but result in suboptimal rates (e.g., $O(T^{3/4})$ regret of online Frank-Wolfe). Motivated by this trade-off in runtime v/s convergence rates, we consider iterative projections of close-by poi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.11943","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/2106.11943/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.11943","created_at":"2026-07-05T05:49:52.400918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.11943v3","created_at":"2026-07-05T05:49:52.400918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.11943","created_at":"2026-07-05T05:49:52.400918+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4AMAHIWR55V","created_at":"2026-07-05T05:49:52.400918+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4AMAHIWR55VJ6XA","created_at":"2026-07-05T05:49:52.400918+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4AMAHIW","created_at":"2026-07-05T05:49:52.400918+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/S4AMAHIWR55VJ6XA2LZVA3I5WW","json":"https://pith.science/pith/S4AMAHIWR55VJ6XA2LZVA3I5WW.json","graph_json":"https://pith.science/api/pith-number/S4AMAHIWR55VJ6XA2LZVA3I5WW/graph.json","events_json":"https://pith.science/api/pith-number/S4AMAHIWR55VJ6XA2LZVA3I5WW/events.json","paper":"https://pith.science/paper/S4AMAHIW"},"agent_actions":{"view_html":"https://pith.science/pith/S4AMAHIWR55VJ6XA2LZVA3I5WW","download_json":"https://pith.science/pith/S4AMAHIWR55VJ6XA2LZVA3I5WW.json","view_paper":"https://pith.science/paper/S4AMAHIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.11943&json=true","fetch_graph":"https://pith.science/api/pith-number/S4AMAHIWR55VJ6XA2LZVA3I5WW/graph.json","fetch_events":"https://pith.science/api/pith-number/S4AMAHIWR55VJ6XA2LZVA3I5WW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4AMAHIWR55VJ6XA2LZVA3I5WW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4AMAHIWR55VJ6XA2LZVA3I5WW/action/storage_attestation","attest_author":"https://pith.science/pith/S4AMAHIWR55VJ6XA2LZVA3I5WW/action/author_attestation","sign_citation":"https://pith.science/pith/S4AMAHIWR55VJ6XA2LZVA3I5WW/action/citation_signature","submit_replication":"https://pith.science/pith/S4AMAHIWR55VJ6XA2LZVA3I5WW/action/replication_record"}},"created_at":"2026-07-05T05:49:52.400918+00:00","updated_at":"2026-07-05T05:49:52.400918+00:00"}