{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CUQPWMVR5AJOWLZW7ZMCRTXLXR","short_pith_number":"pith:CUQPWMVR","schema_version":"1.0","canonical_sha256":"1520fb32b1e812eb2f36fe5828ceebbc53fefada76762b88e83a8582e67b8de1","source":{"kind":"arxiv","id":"1810.00737","version":1},"attestation_state":"computed","paper":{"title":"Risk-Averse Stochastic Convex Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian Rivera Cardoso, Huan Xu","submitted_at":"2018-10-01T14:48:42Z","abstract_excerpt":"Motivated by applications in clinical trials and finance, we study the problem of online convex optimization (with bandit feedback) where the decision maker is risk-averse. We provide two algorithms to solve this problem. The first one is a descent-type algorithm which is easy to implement. The second algorithm, which combines the ellipsoid method and a center point device, achieves (almost) optimal regret bounds with respect to the number of rounds. To the best of our knowledge this is the first attempt to address risk-aversion in the online convex bandit problem."},"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":"1810.00737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:48:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"83b98fdd16af0434b9d38cec91524ab4911ff3ed40f50164aa84ae3db33777a9","abstract_canon_sha256":"8a8df69cf48e029d2c3107025cb57aa162dd583cf7bed00c02dd82c251ccd2c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:24.961525Z","signature_b64":"Ny++impKSbwOphHbfSD9QKq1y0DFUTYB2CPfedQMVu8qINVzdJjqxQbXrSYohuc1sMyKjXBc2KdChHZIpcL5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1520fb32b1e812eb2f36fe5828ceebbc53fefada76762b88e83a8582e67b8de1","last_reissued_at":"2026-05-18T00:04:24.961073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:24.961073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Risk-Averse Stochastic Convex Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian Rivera Cardoso, Huan Xu","submitted_at":"2018-10-01T14:48:42Z","abstract_excerpt":"Motivated by applications in clinical trials and finance, we study the problem of online convex optimization (with bandit feedback) where the decision maker is risk-averse. We provide two algorithms to solve this problem. The first one is a descent-type algorithm which is easy to implement. The second algorithm, which combines the ellipsoid method and a center point device, achieves (almost) optimal regret bounds with respect to the number of rounds. To the best of our knowledge this is the first attempt to address risk-aversion in the online convex bandit problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00737","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":"1810.00737","created_at":"2026-05-18T00:04:24.961138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00737v1","created_at":"2026-05-18T00:04:24.961138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00737","created_at":"2026-05-18T00:04:24.961138+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUQPWMVR5AJO","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUQPWMVR5AJOWLZW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUQPWMVR","created_at":"2026-05-18T12:32:19.392346+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/CUQPWMVR5AJOWLZW7ZMCRTXLXR","json":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR.json","graph_json":"https://pith.science/api/pith-number/CUQPWMVR5AJOWLZW7ZMCRTXLXR/graph.json","events_json":"https://pith.science/api/pith-number/CUQPWMVR5AJOWLZW7ZMCRTXLXR/events.json","paper":"https://pith.science/paper/CUQPWMVR"},"agent_actions":{"view_html":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR","download_json":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR.json","view_paper":"https://pith.science/paper/CUQPWMVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00737&json=true","fetch_graph":"https://pith.science/api/pith-number/CUQPWMVR5AJOWLZW7ZMCRTXLXR/graph.json","fetch_events":"https://pith.science/api/pith-number/CUQPWMVR5AJOWLZW7ZMCRTXLXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/action/storage_attestation","attest_author":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/action/author_attestation","sign_citation":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/action/citation_signature","submit_replication":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/action/replication_record"}},"created_at":"2026-05-18T00:04:24.961138+00:00","updated_at":"2026-05-18T00:04:24.961138+00:00"}