{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:W6W2NXSXKXOJELTS6MWLYALK5G","short_pith_number":"pith:W6W2NXSX","schema_version":"1.0","canonical_sha256":"b7ada6de5755dc922e72f32cbc016ae9b6e9dce803b83f710d874be38c745fb1","source":{"kind":"arxiv","id":"1908.02734","version":4},"attestation_state":"computed","paper":{"title":"Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Digvijay Boob, Guanghui Lan, Qi Deng","submitted_at":"2019-08-07T17:10:52Z","abstract_excerpt":"Functional constrained optimization is becoming more and more important in machine learning and operations research. Such problems have potential applications in risk-averse machine learning, semisupervised learning, and robust optimization among others. In this paper, we first present a novel Constraint Extrapolation (ConEx) method for solving convex functional constrained problems, which utilizes linear approximations of the constraint functions to define the extrapolation (or acceleration) step. We show that this method is a unified algorithm that achieves the best-known rate of convergence"},"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":"1908.02734","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-07T17:10:52Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a58b96cc4215b32d1a4f7a0ce0861a0676e531dcfb10937c8b28e1e8194f18e9","abstract_canon_sha256":"8ada19fcfd5a4f2a2bcd879e69e6531eb89d2001b4330a65daa1e084a23a09b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:53.126811Z","signature_b64":"K6oU8xzJXyG6iseoxW64eEltNIi4iNLxqg0Ksj8E6aKLl//FvZhOaXmmXhcEBb3NT1VqiWnthJMPW7leVKxMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7ada6de5755dc922e72f32cbc016ae9b6e9dce803b83f710d874be38c745fb1","last_reissued_at":"2026-07-05T03:51:53.126425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:53.126425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Digvijay Boob, Guanghui Lan, Qi Deng","submitted_at":"2019-08-07T17:10:52Z","abstract_excerpt":"Functional constrained optimization is becoming more and more important in machine learning and operations research. Such problems have potential applications in risk-averse machine learning, semisupervised learning, and robust optimization among others. In this paper, we first present a novel Constraint Extrapolation (ConEx) method for solving convex functional constrained problems, which utilizes linear approximations of the constraint functions to define the extrapolation (or acceleration) step. We show that this method is a unified algorithm that achieves the best-known rate of convergence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02734","kind":"arxiv","version":4},"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/1908.02734/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":"1908.02734","created_at":"2026-07-05T03:51:53.126481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02734v4","created_at":"2026-07-05T03:51:53.126481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02734","created_at":"2026-07-05T03:51:53.126481+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6W2NXSXKXOJ","created_at":"2026-07-05T03:51:53.126481+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6W2NXSXKXOJELTS","created_at":"2026-07-05T03:51:53.126481+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6W2NXSX","created_at":"2026-07-05T03:51:53.126481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11518","citing_title":"Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G","json":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G.json","graph_json":"https://pith.science/api/pith-number/W6W2NXSXKXOJELTS6MWLYALK5G/graph.json","events_json":"https://pith.science/api/pith-number/W6W2NXSXKXOJELTS6MWLYALK5G/events.json","paper":"https://pith.science/paper/W6W2NXSX"},"agent_actions":{"view_html":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G","download_json":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G.json","view_paper":"https://pith.science/paper/W6W2NXSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02734&json=true","fetch_graph":"https://pith.science/api/pith-number/W6W2NXSXKXOJELTS6MWLYALK5G/graph.json","fetch_events":"https://pith.science/api/pith-number/W6W2NXSXKXOJELTS6MWLYALK5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G/action/storage_attestation","attest_author":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G/action/author_attestation","sign_citation":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G/action/citation_signature","submit_replication":"https://pith.science/pith/W6W2NXSXKXOJELTS6MWLYALK5G/action/replication_record"}},"created_at":"2026-07-05T03:51:53.126481+00:00","updated_at":"2026-07-05T03:51:53.126481+00:00"}