{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DK6VYV6HIN4F6H4UXWES6BTHCX","short_pith_number":"pith:DK6VYV6H","schema_version":"1.0","canonical_sha256":"1abd5c57c743785f1f94bd892f066715f0ad4c48199391bbef607b815a705626","source":{"kind":"arxiv","id":"2401.00108","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Optimization under Hidden Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Ilyas Fatkhullin, Niao He, Yifan Hu","submitted_at":"2023-12-30T01:09:29Z","abstract_excerpt":"In this work, we consider constrained stochastic optimization problems under hidden convexity, i.e., those that admit a convex reformulation via non-linear (but invertible) map $c(\\cdot)$. A number of non-convex problems ranging from optimal control, revenue and inventory management, to convex reinforcement learning all admit such a hidden convex structure. Unfortunately, in the majority of applications considered, the map $c(\\cdot)$ is unavailable or implicit; therefore, directly solving the convex reformulation is not possible. On the other hand, the stochastic gradients with respect to the "},"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":"2401.00108","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-30T01:09:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"afdba38238897b01e187a6e77ac2ed1ccc6b48c20d684fb4dce68da8178f4a26","abstract_canon_sha256":"75a2a13606a800c38ca129f8b9f392ec94553b303946bc63b667e131fa08a713"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:27.948256Z","signature_b64":"jDL2B+zrEvn1stJS1G2kO+SAJ3AOGqufDcskbue/Nj4NpLXM5ozoX2OXJMeLiuq5WgBwWnZrEH6PcgGSmOZ3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1abd5c57c743785f1f94bd892f066715f0ad4c48199391bbef607b815a705626","last_reissued_at":"2026-07-05T09:33:27.947762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:27.947762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Optimization under Hidden Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Ilyas Fatkhullin, Niao He, Yifan Hu","submitted_at":"2023-12-30T01:09:29Z","abstract_excerpt":"In this work, we consider constrained stochastic optimization problems under hidden convexity, i.e., those that admit a convex reformulation via non-linear (but invertible) map $c(\\cdot)$. A number of non-convex problems ranging from optimal control, revenue and inventory management, to convex reinforcement learning all admit such a hidden convex structure. Unfortunately, in the majority of applications considered, the map $c(\\cdot)$ is unavailable or implicit; therefore, directly solving the convex reformulation is not possible. On the other hand, the stochastic gradients with respect to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.00108","kind":"arxiv","version":2},"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/2401.00108/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":"2401.00108","created_at":"2026-07-05T09:33:27.947829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.00108v2","created_at":"2026-07-05T09:33:27.947829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.00108","created_at":"2026-07-05T09:33:27.947829+00:00"},{"alias_kind":"pith_short_12","alias_value":"DK6VYV6HIN4F","created_at":"2026-07-05T09:33:27.947829+00:00"},{"alias_kind":"pith_short_16","alias_value":"DK6VYV6HIN4F6H4U","created_at":"2026-07-05T09:33:27.947829+00:00"},{"alias_kind":"pith_short_8","alias_value":"DK6VYV6H","created_at":"2026-07-05T09:33:27.947829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06935","citing_title":"Mathematical methods of reinforcement learning","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX","json":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX.json","graph_json":"https://pith.science/api/pith-number/DK6VYV6HIN4F6H4UXWES6BTHCX/graph.json","events_json":"https://pith.science/api/pith-number/DK6VYV6HIN4F6H4UXWES6BTHCX/events.json","paper":"https://pith.science/paper/DK6VYV6H"},"agent_actions":{"view_html":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX","download_json":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX.json","view_paper":"https://pith.science/paper/DK6VYV6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.00108&json=true","fetch_graph":"https://pith.science/api/pith-number/DK6VYV6HIN4F6H4UXWES6BTHCX/graph.json","fetch_events":"https://pith.science/api/pith-number/DK6VYV6HIN4F6H4UXWES6BTHCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX/action/storage_attestation","attest_author":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX/action/author_attestation","sign_citation":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX/action/citation_signature","submit_replication":"https://pith.science/pith/DK6VYV6HIN4F6H4UXWES6BTHCX/action/replication_record"}},"created_at":"2026-07-05T09:33:27.947829+00:00","updated_at":"2026-07-05T09:33:27.947829+00:00"}