A Robust Chance Constrained Approach to Surgery Scheduling
arXiv:2608.03931
2026
Architecture
1 ideas extracted · analyzed Aug 31, 2026
What the math gives to ML
The paper's transferable contribution is a modular robust chance-constraint interface: uncertainty is converted into reliability-indexed resource reservations, while the downstream optimizer remains agnostic to how those reservations were estimated. Its strongest ML analogue is heterogeneous compute allocation, where token loads, expert runtimes, activation sparsity, or early-exit runtimes fluctuate and tail failures are more damaging than average-case errors. The discrete reliability menu is practical because it turns continuous risk allocation into auditable choices, while an aggregate reliability budget prevents every component from independently selecting an overly conservative buffer. A first implementation should target MoE expert capacity, replacing a single global capacity factor with expert-specific robust reservations selected from a small alpha menu.
Ideas from this paper
✗ Failed on benchmark
2026
Replace the single global MoE capacity factor with expert-specific capacity reservations chosen from a small reliability menu. Experts with highly variable or operationally important token loads receive larger robust buffers, while predictable experts run closer to their mean load. This should reduce token dropping and padding waste simultaneously, especially under distribution shift or bursty routing.
Useful7/10
Difficulty5/10
Novelty5/10