arXiv (All)
open access
Distributed risk-averse optimization via CVaR
Distributed systems often operate under uncertainty, where minimizing expected loss may overlook rare but severe events. This paper studies a distributed risk-averse convex optimization problem in which agents cooperatively minimize the average of local conditional value-at-risk (CVaR) objectives ov
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning Chance-Constrained MDPs with Bellman Distributional Certificates#1105415
- Softmax gradient policy for variance minimization and risk-averse multi armed bandits#1063878
- Conduit: An Experience Data Plane for Distributed Reinforcement Learning#1050632
- Conduit: An Experience Data Plane for Distributed Reinforcement Learning#1028653
- Risk-Averse Online POMDP Planning via CVaR of the Immediate Cost with Performance Guarantees#1130716
Record · ID 927748
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive