Research map / Learning theory and algorithms / Prediction and decision losses
Optimizing Resilience in Large Scale Networks
Xiaojian Wu, 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 SAA + primal-dual algorithm instead of M-Greedy | GPTNP resilience optimization · Deerfield complete network, 10% budget | test travel time (x10^6 s): 11.4 -> 9.8 | Improved |
| use SAA + primal-dual algorithm instead of M-Greedy | GPTNP resilience optimization · Deerfield complete network, 10% budget | running time (h): 46.2 -> 6.1 | Improved |
| use SAA + primal-dual algorithm instead of random policy | GPTNP resilience optimization · Deerfield complete network, 20% budget | test travel time (x10^6 s): 19.8 -> 3.6 | Improved |
| use primal-dual algorithm instead of greedy baseline | GPTNP on sub-network (10037 edges) · Deerfield sub-network, 10% budget | travel time: within 1.3 times the value of Greedy | Hurt |
| use primal-dual algorithm instead of greedy baseline | GPTNP on sub-network · Deerfield sub-network, 20% budget | travel time | No clear effect |
| use primal-dual algorithm instead of greedy baseline | GPTNP on sub-network · Deerfield sub-network | training time: 30-60 times faster | Improved |
| use primal-dual algorithm instead of greedy when all survival probabilities are 0 | small BSW-SPSG problem · survival probability 0 network | travel time | Improved |
| increase SAA training samples from 10 to 200 (ablation) | SAA method · Istanbul Earthquake Preparation | testing value | No clear effect |
| train on 30 or 60 samples instead of 10 (ablation) | SAA method · Deerfield sub-network, 20% budget | testing travel time | No clear effect |
Closest papers by meaning
- Robust Optimization for Tree-Structured Stochastic Network Design (AAAI 2017 · similarity 0.85)
- Robust Decision Making for Stochastic Network Design (AAAI 2016 · similarity 0.84)
- BO4Mob: Bayesian Optimization Benchmarks for High-Dimensional Urban Mobility Problem (NeurIPS 2025 · similarity 0.80)
- QGym: Scalable Simulation and Benchmarking of Queuing Network Controllers (NeurIPS 2024 · similarity 0.80)
- Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search (AAAI 2024 · similarity 0.80)
- Amortized Network Intervention to Steer the Excitatory Point Processes (ICLR 2024 · similarity 0.79)
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.
