{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TZFYSHAVCSQV5ARWNDWG37XHVP","short_pith_number":"pith:TZFYSHAV","schema_version":"1.0","canonical_sha256":"9e4b891c1514a15e823668ec6dfee7abcd6ace7ebbcfb464e87b6c6ba0a627ac","source":{"kind":"arxiv","id":"2412.03983","version":2},"attestation_state":"computed","paper":{"title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Shanqi Liu, Xin Liu","submitted_at":"2024-12-05T08:58:41Z","abstract_excerpt":"This paper studies online convex optimization with unknown linear budget constraints, where only the gradient information of the objective and the bandit feedback of constraint functions are observed. We propose a safe and efficient Lyapunov-optimization algorithm (SELO) that can achieve an $O(\\sqrt{T})$ regret and zero cumulative constraint violation. The result also implies SELO achieves $O(\\sqrt{T})$ regret when the budget is hard and not allowed to be violated. The proposed algorithm is computationally efficient as it resembles a primal-dual algorithm where the primal problem is an unconst"},"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":"2412.03983","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-05T08:58:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5cea86ac75983b4d712768320eee3ae0323ba0463b8b86669e88c0f5f7ebdef3","abstract_canon_sha256":"2fc3a24a92823cabfc309132c1da0540d4767e289f94b6a6b835cdc0b268fabe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:11.420890Z","signature_b64":"xQZ71nYPqasMBxndglitAqz6FdtBZrrWNrmfQb9dCSokEyoHiv0lCU0W3zVNEuFrF2ku0O7hvW+Ej0T4+XwoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e4b891c1514a15e823668ec6dfee7abcd6ace7ebbcfb464e87b6c6ba0a627ac","last_reissued_at":"2026-07-05T10:26:11.420290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:11.420290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Shanqi Liu, Xin Liu","submitted_at":"2024-12-05T08:58:41Z","abstract_excerpt":"This paper studies online convex optimization with unknown linear budget constraints, where only the gradient information of the objective and the bandit feedback of constraint functions are observed. We propose a safe and efficient Lyapunov-optimization algorithm (SELO) that can achieve an $O(\\sqrt{T})$ regret and zero cumulative constraint violation. The result also implies SELO achieves $O(\\sqrt{T})$ regret when the budget is hard and not allowed to be violated. The proposed algorithm is computationally efficient as it resembles a primal-dual algorithm where the primal problem is an unconst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03983","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/2412.03983/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":"2412.03983","created_at":"2026-07-05T10:26:11.420383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03983v2","created_at":"2026-07-05T10:26:11.420383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03983","created_at":"2026-07-05T10:26:11.420383+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZFYSHAVCSQV","created_at":"2026-07-05T10:26:11.420383+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZFYSHAVCSQV5ARW","created_at":"2026-07-05T10:26:11.420383+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZFYSHAV","created_at":"2026-07-05T10:26:11.420383+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/TZFYSHAVCSQV5ARWNDWG37XHVP","json":"https://pith.science/pith/TZFYSHAVCSQV5ARWNDWG37XHVP.json","graph_json":"https://pith.science/api/pith-number/TZFYSHAVCSQV5ARWNDWG37XHVP/graph.json","events_json":"https://pith.science/api/pith-number/TZFYSHAVCSQV5ARWNDWG37XHVP/events.json","paper":"https://pith.science/paper/TZFYSHAV"},"agent_actions":{"view_html":"https://pith.science/pith/TZFYSHAVCSQV5ARWNDWG37XHVP","download_json":"https://pith.science/pith/TZFYSHAVCSQV5ARWNDWG37XHVP.json","view_paper":"https://pith.science/paper/TZFYSHAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03983&json=true","fetch_graph":"https://pith.science/api/pith-number/TZFYSHAVCSQV5ARWNDWG37XHVP/graph.json","fetch_events":"https://pith.science/api/pith-number/TZFYSHAVCSQV5ARWNDWG37XHVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZFYSHAVCSQV5ARWNDWG37XHVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZFYSHAVCSQV5ARWNDWG37XHVP/action/storage_attestation","attest_author":"https://pith.science/pith/TZFYSHAVCSQV5ARWNDWG37XHVP/action/author_attestation","sign_citation":"https://pith.science/pith/TZFYSHAVCSQV5ARWNDWG37XHVP/action/citation_signature","submit_replication":"https://pith.science/pith/TZFYSHAVCSQV5ARWNDWG37XHVP/action/replication_record"}},"created_at":"2026-07-05T10:26:11.420383+00:00","updated_at":"2026-07-05T10:26:11.420383+00:00"}