arXiv (All)
open access
Learning Polyhedral Conformal Sets for Robust Optimization
Robust optimization (RO) provides a principled framework for decision-making under uncertainty, but its performance critically depends on the choice of the uncertainty set. While large sets ensure reliability, they often lead to overly conservative decisions, whereas small sets risk excluding the tr
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
- Adjustable Robust Optimization with Discrete Uncertainty#796345
- On the consideration of uncertainty in design: optimization - reliability - robustness#257777
- Robust Optimization Under Objective Functional Uncertainty#1011105
- Conformal Robust Set Estimation#1115534
- Computing Robustness to Sparse Diagonal Uncertainty#1083878
Record · ID 973165
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