Limits of size generalization for GALLOP
Determine whether the size generalization observed for GALLOP policies trained on smaller linear programs extends to substantially larger linear programs than those evaluated in the study.
References
Experiments with more GPU memory would allow us to test whether the observed size generalization extends to substantially larger LPs.
— Reinforcement Learning to Accelerate Primal-Dual Hybrid Gradient for Linear Programming
(2610.01546 - Sul et al., 1 Oct 2026) in Section “Conclusion and Limitations,” subsection “Limitations”
For the Golomb ruler problem the upper bound of the domain is the value of the optimal solution. We are not able to find a generic formula that predicts the value of the optimal solution for a new problem size (this is unlikely to exist in a simple closed form), so that we cannot generate extra solutions for unknown problem sizes.
— Learning Size Independent Constraint Models from Input Data and Positive and Negative Example Solutions
(2610.13640 - Simonis, 9 Oct 2026) in Section Evaluation, discussion following Table 2