{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4YSZXCV7AMO2IS6E62NGJFXPM4","short_pith_number":"pith:4YSZXCV7","schema_version":"1.0","canonical_sha256":"e6259b8abf031da44bc4f69a6496ef67002e9a36e30c78bd87c9a5d19d616f87","source":{"kind":"arxiv","id":"1406.3339","version":3},"attestation_state":"computed","paper":{"title":"Algorithms for CVaR Optimization in MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Mohammad Ghavamzadeh, Yinlam Chow","submitted_at":"2014-06-12T19:56:16Z","abstract_excerpt":"In many sequential decision-making problems we may want to manage risk by minimizing some measure of variability in costs in addition to minimizing a standard criterion. Conditional value-at-risk (CVaR) is a relatively new risk measure that addresses some of the shortcomings of the well-known variance-related risk measures, and because of its computational efficiencies has gained popularity in finance and operations research. In this paper, we consider the mean-CVaR optimization problem in MDPs. We first derive a formula for computing the gradient of this risk-sensitive objective function. We "},"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":"1406.3339","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-12T19:56:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7d77c7d5687f19f5f65fa13d928fc5d669b182cbcbc1920e9ae9f0b7b16cce3a","abstract_canon_sha256":"3c3b587f4d367c852d5e3b89383d36dae469a548b08665e451d311b4f1e04928"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:52.473267Z","signature_b64":"1BW57fXeFaOJRG0N5XGWr6pNF9FkNqlL/5kC3txcd2oM0iIK1G8MpiJb96eyAa+GvcMSCb9K2xLO7hOHjjG0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6259b8abf031da44bc4f69a6496ef67002e9a36e30c78bd87c9a5d19d616f87","last_reissued_at":"2026-05-18T02:47:52.472819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:52.472819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for CVaR Optimization in MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Mohammad Ghavamzadeh, Yinlam Chow","submitted_at":"2014-06-12T19:56:16Z","abstract_excerpt":"In many sequential decision-making problems we may want to manage risk by minimizing some measure of variability in costs in addition to minimizing a standard criterion. Conditional value-at-risk (CVaR) is a relatively new risk measure that addresses some of the shortcomings of the well-known variance-related risk measures, and because of its computational efficiencies has gained popularity in finance and operations research. In this paper, we consider the mean-CVaR optimization problem in MDPs. We first derive a formula for computing the gradient of this risk-sensitive objective function. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3339","kind":"arxiv","version":3},"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":"1406.3339","created_at":"2026-05-18T02:47:52.472881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3339v3","created_at":"2026-05-18T02:47:52.472881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3339","created_at":"2026-05-18T02:47:52.472881+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YSZXCV7AMO2","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YSZXCV7AMO2IS6E","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YSZXCV7","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16604","citing_title":"R2V Agent: Teaching SLMs When to Ask for Help","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4","json":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4.json","graph_json":"https://pith.science/api/pith-number/4YSZXCV7AMO2IS6E62NGJFXPM4/graph.json","events_json":"https://pith.science/api/pith-number/4YSZXCV7AMO2IS6E62NGJFXPM4/events.json","paper":"https://pith.science/paper/4YSZXCV7"},"agent_actions":{"view_html":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4","download_json":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4.json","view_paper":"https://pith.science/paper/4YSZXCV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3339&json=true","fetch_graph":"https://pith.science/api/pith-number/4YSZXCV7AMO2IS6E62NGJFXPM4/graph.json","fetch_events":"https://pith.science/api/pith-number/4YSZXCV7AMO2IS6E62NGJFXPM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4/action/storage_attestation","attest_author":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4/action/author_attestation","sign_citation":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4/action/citation_signature","submit_replication":"https://pith.science/pith/4YSZXCV7AMO2IS6E62NGJFXPM4/action/replication_record"}},"created_at":"2026-05-18T02:47:52.472881+00:00","updated_at":"2026-05-18T02:47:52.472881+00:00"}