Online Learning-Based Adaptive Hybrid Benders Decomposition for Risk-Averse Optimal Sizing

arXiv:2609.26364 · eess.SY, cs.SY · Submitted 2026-09-22 · Read on arXiv

eess.SY, cs.SY

Submitted: 2026-09-22

Updated: 2026-09-22

Terminology

• Benders Decomposition — 8× in this paper
• Accuracy — 2× in this paper · explained in 1 episode
• Aggregation — 2× in this paper · explained in 1 episode
• Core — 2× in this paper · explained in 2 episodes
• Adaptive Selection — 1× in this paper · explained in 1 episode
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• Regularization — 1× in this paper · explained in 3 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 episodes

Sources

• Learning to Cut: Reinforcement Learning for Benders Decomposition
• The Proxy Benders Decomposition
• Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems
• ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programming

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
• Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model
• Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
• Decentralized Power-Optimal Coordination for Spacecraft Swarms Using Time-Varying Magnetorquer Actuation