Research map / Learning theory and algorithms / Prediction and decision losses
Robust Optimization for Tree-Structured Stochastic Network Design
Xiaojian Wu, Akshat Kumar, Daniel Sheldon, Shlomo Zilberstein
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the MRR policy instead of the midpoint policy | Robust river network design · Massachusetts river network, 2028 culverts and 166 dams | robust ratio | Improved |
| Use the MRR policy instead of the midpoint or worst policy | Robust river network design · Massachusetts river network, 2028 culverts and 166 dams | regret | Improved |
| Increase uncertainty interval size β | MRR policy · Massachusetts river network, 2028 culverts and 166 dams | robust ratio | Hurt |
| Increase uncertainty interval size β | MRR policy · Massachusetts river network, 2028 culverts and 166 dams | regret | Hurt |
| Use the rounded dynamic programming algorithm with K_u = 5 instead of μ = 0.1 | RDP adversary optimization · 22-node network | runtime: about 20 times faster | Improved |
| Use the rounded dynamic programming algorithm with K_u = 5 instead of exact DP | RDP adversary optimization · 22-node network | runtime: 100--600 times faster | Improved |
| Use RDP to select adversarial policy-parameter pairs | Robust river network design · 22-node network | robust ratio approximation quality | Improved |
| Use RDP with K in the convergence area | Robust river network design · Massachusetts river network, 2028 culverts and 166 dams | robust ratio convergence: within 2 minutes | Improved |
| Use the MRR policy instead of the midpoint policy | Robust river network design · Large network, 9335 nodes, 5% budget | robustness | Improved |
| Approximate adversarial objective values using rounded value functions (ablation) | RDP adversary optimization · Tree-structured stochastic network design | adversary optimization approximation ratio: at most (1 + ε) OPT | Improved |
Closest papers by meaning
- Constraint-aware Pareto Optimization for Tree-Structured Networks: Addressing Decarbonization Targets with Hydropower Expansion (AAAI 2025 · similarity 0.85)
- Scaling Up Pareto Optimization for Tree Structures with Affine Transformations: Evaluating Hybrid Floating Solar-Hydropower Systems in the Amazon (AAAI 2024 · similarity 0.82)
- The Merit of River Network Topology for Neural Flood Forecasting (ICML 2024 · similarity 0.82)
- Physics-Guided Fair Graph Sampling for Water Temperature Prediction in River Networks (AAAI 2025 · similarity 0.81)
- Topology-Aware Conformal Prediction for Stream Networks (NeurIPS 2025 · similarity 0.81)
- Decision-Making for Land Conservation: A Derivative-Free Optimization Framework with Nonlinear Inputs (AAAI 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
