{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F56E2NYEDRJPQKJ2NDBZEMW4OS","short_pith_number":"pith:F56E2NYE","schema_version":"1.0","canonical_sha256":"2f7c4d37041c52f8293a68c39232dc74827b50d203d2f7e0a49eb7e971f5d0b2","source":{"kind":"arxiv","id":"2212.09513","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Pin-Yu Chen, Sijia Liu, Songtao Lu, Yangyang Xu, Zichong Li","submitted_at":"2022-12-19T14:48:54Z","abstract_excerpt":"Many real-world problems not only have complicated nonconvex functional constraints but also use a large number of data points. This motivates the design of efficient stochastic methods on finite-sum or expectation constrained problems. In this paper, we design and analyze stochastic inexact augmented Lagrangian methods (Stoc-iALM) to solve problems involving a nonconvex composite (i.e. smooth+nonsmooth) objective and nonconvex smooth functional constraints. We adopt the standard iALM framework and design a subroutine by using the momentum-based variance-reduced proximal stochastic gradient me"},"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":"2212.09513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-19T14:48:54Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"8d302a4ab69b06a755ce3648214dadb93626f235edd08587c786716deb5b9cf9","abstract_canon_sha256":"1b42ffb831c31f3a964ade1d320e196bf82401ae70e50d309a2a1af5fc54e899"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:26:23.027007Z","signature_b64":"wTW9269yLWv914MwwToqLtOoyhBGUnl/LTvviQ6BCGEuS/OMKsXJRgD3YZBYWcgN34go2SFDV4G2QSTYBSchCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f7c4d37041c52f8293a68c39232dc74827b50d203d2f7e0a49eb7e971f5d0b2","last_reissued_at":"2026-07-05T05:26:23.026548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:26:23.026548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Inexact Augmented Lagrangian Method for Nonconvex Expectation Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Pin-Yu Chen, Sijia Liu, Songtao Lu, Yangyang Xu, Zichong Li","submitted_at":"2022-12-19T14:48:54Z","abstract_excerpt":"Many real-world problems not only have complicated nonconvex functional constraints but also use a large number of data points. This motivates the design of efficient stochastic methods on finite-sum or expectation constrained problems. In this paper, we design and analyze stochastic inexact augmented Lagrangian methods (Stoc-iALM) to solve problems involving a nonconvex composite (i.e. smooth+nonsmooth) objective and nonconvex smooth functional constraints. We adopt the standard iALM framework and design a subroutine by using the momentum-based variance-reduced proximal stochastic gradient me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09513","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/2212.09513/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":"2212.09513","created_at":"2026-07-05T05:26:23.026607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09513v1","created_at":"2026-07-05T05:26:23.026607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09513","created_at":"2026-07-05T05:26:23.026607+00:00"},{"alias_kind":"pith_short_12","alias_value":"F56E2NYEDRJP","created_at":"2026-07-05T05:26:23.026607+00:00"},{"alias_kind":"pith_short_16","alias_value":"F56E2NYEDRJPQKJ2","created_at":"2026-07-05T05:26:23.026607+00:00"},{"alias_kind":"pith_short_8","alias_value":"F56E2NYE","created_at":"2026-07-05T05:26:23.026607+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.20008","citing_title":"Stochastic optimization over expectation-formulated generalized Stiefel manifold","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS","json":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS.json","graph_json":"https://pith.science/api/pith-number/F56E2NYEDRJPQKJ2NDBZEMW4OS/graph.json","events_json":"https://pith.science/api/pith-number/F56E2NYEDRJPQKJ2NDBZEMW4OS/events.json","paper":"https://pith.science/paper/F56E2NYE"},"agent_actions":{"view_html":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS","download_json":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS.json","view_paper":"https://pith.science/paper/F56E2NYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09513&json=true","fetch_graph":"https://pith.science/api/pith-number/F56E2NYEDRJPQKJ2NDBZEMW4OS/graph.json","fetch_events":"https://pith.science/api/pith-number/F56E2NYEDRJPQKJ2NDBZEMW4OS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS/action/storage_attestation","attest_author":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS/action/author_attestation","sign_citation":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS/action/citation_signature","submit_replication":"https://pith.science/pith/F56E2NYEDRJPQKJ2NDBZEMW4OS/action/replication_record"}},"created_at":"2026-07-05T05:26:23.026607+00:00","updated_at":"2026-07-05T05:26:23.026607+00:00"}