- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes SMOP, a label-free neural proxy for multi-period resource allocation. I do not believe the current work establishes a sufficiently challenging optimization problem or a reliable theoretical contribution to justify acceptance.
-
The practical difficulty of the underlying power-system problem is overstated. The paper considers fixed-commitment economic dispatch (ED), where unit commitment decisions are given and only continuous generation dispatch variables are optimized. With linear generation costs, generation limits, ramping constraints, and period-wise power balance, this is a structured linear programming (LP) problem. The paper does not address the combinatorial difficulty of unit commitment (UC), where on/off decisions, startup and shutdown decisions, and minimum up/down times introduce integer variables. Nor does it address security-constrained unit commitment (SCUC), which additionally incorporates transmission network constraints and contingency requirements. These are substantially more challenging problems in practical power-system operations. Moreover, the paper evaluates instances with only 10, 50, and 100 generators over 24 periods. Its own results report HiGHS solution times of approximately 7.78, 38.9, and 81.08 ms, respectively. Thus, the proposed speedups of up to 42.58× are measured against an already fast LP solver on relatively small instances. The absolute time savings are only on the order of milliseconds to tens of milliseconds per instance, while the reported neural-network training time ranges from approximately 86 to 400 seconds. The paper does not establish that this trade-off addresses a meaningful bottleneck in actual power-system operations.
-
Proposition 1 does not establish the claimed full-horizon feasibility guarantee, and Algorithm 4 can violate the original power-balance constraint. See this counterexample (TeX format):
Consider an instance with generators and periods. All units are committed, and the parameters are
|p_{g,t}-p_{g,t-1}|\le 0.5,\qquad p_{g,0}=0.5,$$ $$(D_1,D_2)=(1.5,2.7),\qquad R_t=0.$$ The original instance is feasible: $p_{:,1}=(0.5,0.5,0.5)$ and $p_{:,2}=(0.9,0.9,0.9)$ satisfy all constraints. The linear operating costs are irrelevant to this feasibility argument. **Propagated intervals.** At $t=2$, demand balance and the capacity limits of the other two generators imply $p_{g,2}\ge 2.7-2=0.7$. Backward ramp propagation therefore gives $p_{g,1}\ge 0.2$. Repeated interval tightening reaches the fixed point $$[L^B_{g,1},U^B_{g,1}]=[0.2,1],\qquad [L^B_{g,2},U^B_{g,2}]=[0.7,1], \quad g=1,2,3.$$ All intervals are nonempty, and both aggregate demand checks pass. **An allowed prediction and repair.** Choose strictly positive allocation ratios $$\eta_{:,1}=(0.98,0.01,0.01),$$ which are compatible with a softmax output. The corresponding neural prediction is $$\widetilde p_{:,1} =0.2\mathbf{1}+0.8\eta_{:,1} =(0.984,0.208,0.208).$$ The Euclidean box-balance projection onto $\sum_g p_{g,1}=1.5$ has $\lambda=-0.042$ and returns $$\widehat p_{:,1} =\operatorname{clip} (\widetilde p_{:,1}-\lambda,0.2,1) =(1,0.25,0.25).$$ This dispatch satisfies all first-period constraints. However, the second-period reachable upper bounds become $$U^r_{:,2}=(1,0.75,0.75), \qquad \sum_g U^r_{g,2}=2.5<2.7=D_2.$$ Thus, the first-period projection makes the original second-period demand unreachable, even though the original instance is feasible and the propagated intervals pass the aggregate demand checks. Algorithm 4 clips the second-period target to $\widehat D_2=2.5$, producing a power-balance violation of $0.2$ relative to the original demand. Detecting infeasibility instead would also fail to provide a feasible trajectory for the original instance. 3. The experimental results do not resolve the theoretical failure or establish a compelling practical advantage. The experiments support, at most, a fast empirical proxy for a restricted ED formulation, rather than the broader significance implied by the paper's motivation and theoretical claims.Critical strengths
\
Critical weaknesses
\
Questions for authors
\
3 comments
Response to Weakness 3 from Reviewer Rdin
Weakness 3: Proposition 1 does not establish the claimed full-horizon feasibility guarantee, and Algorithm 4 can violate the original power-balance constraint. See this counterexample (TeX format): Consider an instance with generators and periods. All units are committed, and the parameters are , , , , . The original instance is feasible: and satisfy all constraints. The linear operating costs are irrelevant to this feasibility argument. Propagated intervals. At , demand balance and the capacity limits of the other two generators imply . Backward ramp propagation therefore gives . Repeated interval tightening reaches the fixed point All intervals are nonempty, and both aggregate demand checks pass. An allowed prediction and repair. Choose strictly positive allocation ratios , which are compatible with a softmax output. The corresponding neural prediction is The Euclidean box-balance projection onto has and returns = clip = . This dispatch satisfies all first-period constraints. However, the second-period reachable upper bounds become Thus, the first-period projection makes the original second-period demand unreachable, even though the original instance is feasible and the propagated intervals pass the aggregate demand checks. Algorithm 4 clips the second-period target to , producing a power-balance violation of relative to the original demand. Detecting infeasibility instead would also fail to provide a feasible trajectory for the original instance.
Response: Thank you for providing this counterexample. We have revised Section 4 to introduce an explicit next-period feasibility check and a local feasibility repair. The updated proposition and accompanying remark clarify the scope of these safeguards. (1) Next-period feasibility check and local correction. We have added Corollary 1 in Section 4, which introduces an explicit next-period feasibility check and a local repair. We first adjust the neural dispatch proposal to obtain . SMOP then computes the next-period bounds induced by $ p_t^{(0)} $, i.e., and . It accepts this tentative dispatch only if every next-period interval is nonempty and . If either condition fails, SMOP seeks a replacement dispatch by solving $ ||x-\tilde{p_t}||^2$ s.t. , , , . Under the assumptions of Proposition 1, the final two constraints ensure that a next-period dispatch satisfy all the constraints. The first-period dispatch in the counterexample violates this acceptance criterion and therefore cannot be accepted unchanged. Once the bounds are available, the check requires operations; the local optimization is invoked only when the check fails.
(2) Full-horizon fallback. One-step extendability does not, by itself, establish full-horizon feasibility. If the local correction problem is infeasible, SMOP falls back to the original full-horizon LP, allowing earlier tentative dispatches to be revised. Provided that this LP is feasible and the solver returns a solution that passes the stated constraint checks, the fallback supplies a feasible full-horizon trajectory.
(3) Training regularization. The bound-feasibility loss, , complements these safeguards by penalizing demand outside the dynamically reachable interval. Because future bounds depend on earlier dispatches, this loss provides gradients that encourage decisions with feasible continuations, as explained in Proposition 4. This regularization can reduce the need for correction in training.
Our updated experiments provide empirical evidence under the evaluated settings. For example, all 301 DC-Full validation instances passed the independent constraint audit at a tolerance of , with a maximum violation across all audited constraints of cores. These results support the effectiveness of the evaluated recovery pipeline without establishing an unconditional feasibility guarantee.
Response to Weakness 2 and Weakness 4 from Reviewer Rdin
Weakness 2: Moreover, the paper evaluates instances with only 10, 50, and 100 generators over 24 periods. Its own results report HiGHS solution times of approximately 7.78, 38.9, and 81.08 ms, respectively. Thus, the proposed speedups of up to 42.58× are measured against an already fast LP solver on relatively small instances. The absolute time savings are only on the order of milliseconds to tens of milliseconds per instance, while the reported neural-network training time ranges from approximately 86 to 400 seconds. The paper does not establish that this trade-off addresses a meaningful bottleneck in actual power-system operations.
Response: Thanks for the suggestions. (1) We have added another benchmark of 1310 unit with 17,032 input dimensions mainly in Section 6.4, which taks about 1060 ms for LP solver to find solutions. Experiment demonstrates that SMOP can process all 1,310 machines and that batched inference is substantially faster than the stored LP solve-time baseline under the reported timing scopes. The fastest measured sweep configuration achieves 57.18$ \times $speedup, as shown in Table 4 of Section 6.4. (2) Training time might be long but occurs offline, and the trained model is able to solve a number of instances at a time. Only the inference time matters in reality when comparing with solvers. (3) The benchmark with 1310 units demonstrate the capability of SMOP for practical applications in power grids when hundreds and thousands of units are considered.
Weakness 4: The experimental results do not resolve the theoretical failure or establish a compelling practical advantage. The experiments support, at most, a fast empirical proxy for a restricted ED formulation, rather than the broader significance implied by the paper’s motivation and theoretical claims.
Response: Thank you for the feedback.
-
Feasibility safeguards. We introduce three mitigation strategies to address cases in which the conditions of Proposition 1 are not satisfied. These safeguards support feasibility recovery, with the updated experiments demonstrating small constraint violations within the stated numerical tolerances. We distinguish this empirical evidence from an unconditional theoretical guarantee.
-
Applicability beyond economic dispatch. We extend SMOP to supply-chain optimization and large-scale data-center workload allocation. These benchmarks demonstrate its adaptability across domains and its computational advantages for large-scale, repeated optimization, particularly with batched inference.
-
Broader significance. SMOP provides a foundation for efficient neural proxies for multi-period optimization, combining learned predictions with structured feasibility recovery while maintaining small optimality gaps. Its design also suggests promising directions for mixed-integer multi-period optimization and feasibility-aware combinatorial optimization.
Response to Weakness 1 from Reviewer Rdin
Paper Summary
Weakness 1: This paper proposes SMOP, ...
Response:
Thank you for these questions. We clarify the scope, computational motivation, and contributions of SMOP below.
(1) SMOP targets a class of multi-period optimization problems with spatial and temporal coupling constraints, not a general solution to UC, SCUC, or arbitrary constrained optimization. Fixed-commitment economic dispatch serves as one application; the present framework does not solve the full mixed-integer unit commitment problem. To demonstrate its broader applicability, we have added two benchmarks—supply-chain optimization and large-scale data-center workload allocation—with formulations and implementations described in Sections 2 and 6 and Appendices F.4 and F.5. For supply-chain optimization, we introduce SMOP-HC and SMOP-HC$-\alpha $ and examine their trade-offs in objective quality, constraint violation, and inference time. For data-center allocation, we evaluate inference time against a conventional LP baseline. Additional ablation studies for both benchmarks are provided in the appendix.
(2) We agree that LP solvers are highly effective for fixed-commitment dispatch, particularly for small instances. Our computational motivation is to reduce the cost of repeatedly solving related problems and to exploit batching particular for large instances. Although conventional solvers can also process independent instances concurrently, neural proxies offer a different opportunity to share computation across a batch. In the DC-Full benchmark in Section 6.4, which contains 1,310 machines over 24 periods, the recorded HiGHS runtime averages 1,060.9 ms per instance, whereas the reported SMOP configuration requires 63.67 ms per instance, corresponding to a 16.67-fold speedup.
(3) SMOP combines neural predictions with structured recovery and establishes feasibility results under explicitly stated conditions. We have provided local correction repair and full-horizon fallback required when those conditions fail, ensuring feasibility. The framework also motivates future integration with neural predictors for discrete decisions. Extending this approach to security-constrained unit commitment would additionally require enforcing commitment logic, network constraints, and feasibility across the full horizon; this remains a direction for future research.
(4) We have added DC3, a self-supervised constrained-optimization baseline that combines equality completion with inequality correction. The results in the table indicate that DC3 has difficulty obtaining feasible solutions efficiently satisfying spatial and temporal constraints in our setting. The comparison strengthens the motivation for recovery mechanisms that explicitly account for temporal coupling.
Comparison of dispatch-learning methods on OR-LIB 10 (mean ± sample standard deviation over three random seeds).