{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5H5SFYWKX2EZRMX24XZDURMD55","short_pith_number":"pith:5H5SFYWK","schema_version":"1.0","canonical_sha256":"e9fb22e2cabe8998b2fae5f23a4583ef78e86f2f652c6182277f4cc18acc0611","source":{"kind":"arxiv","id":"1902.00126","version":1},"attestation_state":"computed","paper":{"title":"Almost surely constrained convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ahmet Alacaoglu, Ion Necoara, Olivier Fercoq, Volkan Cevher","submitted_at":"2019-01-31T23:30:19Z","abstract_excerpt":"We propose a stochastic gradient framework for solving stochastic composite convex optimization problems with (possibly) infinite number of linear inclusion constraints that need to be satisfied almost surely. We use smoothing and homotopy techniques to handle constraints without the need for matrix-valued projections. We show for our stochastic gradient algorithm $\\mathcal{O}(\\log(k)/\\sqrt{k})$ convergence rate for general convex objectives and $\\mathcal{O}(\\log(k)/k)$ convergence rate for restricted strongly convex objectives. These rates are known to be optimal up to logarithmic factors, ev"},"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":"1902.00126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T23:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"045b7b9b96256a385911ee1dc64c720313556af2d4a2fec47f2dea88b9f30ecf","abstract_canon_sha256":"7c572e6f2cdf62178cead83d5ae8500a15dffb115060276ffc39327311d793d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.208964Z","signature_b64":"qwS86XWIzuBZgzdbKy/Uys6tfCMiA11cyie3l0dabYLxkncU1GCFvljZCmQaFmpl+EhjtXHxF9upJMonZMIvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9fb22e2cabe8998b2fae5f23a4583ef78e86f2f652c6182277f4cc18acc0611","last_reissued_at":"2026-05-17T23:54:58.208507Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.208507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost surely constrained convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ahmet Alacaoglu, Ion Necoara, Olivier Fercoq, Volkan Cevher","submitted_at":"2019-01-31T23:30:19Z","abstract_excerpt":"We propose a stochastic gradient framework for solving stochastic composite convex optimization problems with (possibly) infinite number of linear inclusion constraints that need to be satisfied almost surely. We use smoothing and homotopy techniques to handle constraints without the need for matrix-valued projections. We show for our stochastic gradient algorithm $\\mathcal{O}(\\log(k)/\\sqrt{k})$ convergence rate for general convex objectives and $\\mathcal{O}(\\log(k)/k)$ convergence rate for restricted strongly convex objectives. These rates are known to be optimal up to logarithmic factors, ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00126","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":""},"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":"1902.00126","created_at":"2026-05-17T23:54:58.208579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00126v1","created_at":"2026-05-17T23:54:58.208579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00126","created_at":"2026-05-17T23:54:58.208579+00:00"},{"alias_kind":"pith_short_12","alias_value":"5H5SFYWKX2EZ","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5H5SFYWKX2EZRMX2","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5H5SFYWK","created_at":"2026-05-18T12:33:10.108867+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/5H5SFYWKX2EZRMX24XZDURMD55","json":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55.json","graph_json":"https://pith.science/api/pith-number/5H5SFYWKX2EZRMX24XZDURMD55/graph.json","events_json":"https://pith.science/api/pith-number/5H5SFYWKX2EZRMX24XZDURMD55/events.json","paper":"https://pith.science/paper/5H5SFYWK"},"agent_actions":{"view_html":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55","download_json":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55.json","view_paper":"https://pith.science/paper/5H5SFYWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00126&json=true","fetch_graph":"https://pith.science/api/pith-number/5H5SFYWKX2EZRMX24XZDURMD55/graph.json","fetch_events":"https://pith.science/api/pith-number/5H5SFYWKX2EZRMX24XZDURMD55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/action/storage_attestation","attest_author":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/action/author_attestation","sign_citation":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/action/citation_signature","submit_replication":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/action/replication_record"}},"created_at":"2026-05-17T23:54:58.208579+00:00","updated_at":"2026-05-17T23:54:58.208579+00:00"}