- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
- This paper area is focusing on 2RO and try to enhance a existing learning method to CCG.
- This paper identify a structural limitation of existing methods (mainly Neur2RO) separate aggregation. and it proposes a method CSD to models aligned decision uncertainty before aggregation.
Critical strengths
- A plausible motivation for aligning feature pairs before aggregation.
Critical weaknesses
-
The scope of applicability is unclear. It seems the method requires a meaningful componentwise correspondence between x and xi, but it is not clear how broadly this prerequisite holds across two-stage robust optimization problems.
-
The presentation, experimental design, and analysis of results need further improvement to convincingly demonstrate that the proposed approach addresses the limitation identified in the motivation.
Questions for authors
-
Runtime and solver settings in Table 1. Please explain why CSD’s runtime decreases for and compared with . In particular, and have the same median iteration count but substantially different runtimes. The values around 600 and 660 seconds also appear to reflect time limits; please clarify the difference and report the timeout handling, solver thread counts, and solver gap tolerances.
-
Iteration reporting in Table 2. For and , the reported iteration count is 38.5. Please clarify how this statistic is computed.
-
Applicability to the Neur2RO knapsack benchmark. Have you evaluated the method on the two-stage robust knapsack problem used in Neur2RO? The purpose would be to assess the method’s scope of applicability, rather than simply add another benchmark. This comparison could help establish whether the benefits extend across different recourse structures or are concentrated in particular problem classes.
6 comments
Thank you for the clarification.
Regarding Q1: Could the authors further explain why the number of unstable ReLUs decreases as the problem size increases? This seems counterintuitive, and the current explanation describes the observed pattern without clarifying its underlying cause.
I believe this is an important issue, particularly given the paper's connection to the Neur2RO research line. Understanding how the embedded neural network interacts with the MILP solver, and how its computational complexity changes with problem size, is essential for assessing the scalability and generalizability of the proposed method.
Thank you for asking us to explain the cause. The final-MP decrease reflects differences in the accumulated scenario networks: at matched K=1 and K=2, the unstable counts are similar across n. The structural reason is that exact binary endpoint interpolation (Appendix B.4) replaces the component encoders' ReLU formulations by affine expressions in the binary decisions. The remaining CB scoring block has fixed widths: 48 post-aggregation and 10 value-network ReLUs per scenario. Thus, K retained scenarios give 58K ReLUs; increasing n does not itself increase this per-scenario count.
We checked 90 diagnostic runs: ten instances at each of n=30,40,50 and three training seeds. All runs reach K=1 and K=2. Each entry below is a median over the 30 runs at that size; K=1 uses the common initial scenario, xi=0.
| n | Unstable at K=1 | Unstable at K=2 | K in final MP | Unstable in final MP |
|---|---|---|---|---|
| 30 | 42 | 78 | 4 | 178 |
| 40 | 41 | 72 | 4 | 137 |
| 50 | 43 | 73 | 3 | 103 |
The initial single-scenario counts are almost unchanged across sizes, and the K=2 counts remain close. The differences emerge in the final accumulated MPs. Their scenario sets differ in both size and composition: at n=30, 14 of the 30 runs retain five scenarios, whereas no n=40 or n=50 run does, even though n=30 and n=40 have the same median K.
The increments in unstable units also vary across scenarios. Specifically, , where counts units whose preactivation intervals, computed independently over the binary input box for scenario s, cross zero. In an n=50 run, the initial scenario (0,0,0,0) contributes 40 unstable ReLUs, and the next scenario (-1,-1,-1,-1) contributes 30. Total ReLUs double from 58 to 116, while unstable ReLUs increase from 40 to 70. The new scenario changes every project's cost and revenue multipliers from 1 to 0.5; one corresponding unit's interval moves from [-0.277182, 0.119339] to [-0.773260, -0.162076], making it stable. This gives a concrete mechanism for the unequal increments: scenario features shift activation bounds and change which units cross zero.
To address the MILP interaction and scalability concern, we further analyzed how the accumulated blocks interact through their shared decision x. The full MP still grows with n: at K=2, median binary-variable counts after presolve are 159/174/191. Within this joint MP, shared decisions constrain the activation choices across scenario networks and permit conditional activation fixing.
After interpolation, corresponding preactivations in the first post-aggregation layer are affine: . For binary x,
This follows by minimizing each coefficient-difference term over . A positive bound strictly orders the two preactivations throughout the binary decision domain. We found at least one such pair of individually unstable units under the initial and first added scenarios in 88 of the 90 runs.
At a branch-and-bound node D, let and be valid bounds. The difference bound gives and , hence
L_s(D)\ge-\delta_{ts}&\Rightarrow\operatorname{ReLU}(a_t(x))=a_t(x),\\ U_t(D)\le\delta_{ts}&\Rightarrow\operatorname{ReLU}(a_s(x))=0. \end{aligned}$$ These conditions permit eliminating an activation choice throughout that node, including when the other unit remains individually unstable. They apply whenever valid individual and difference bounds are available. In the same n=50 example, another pair has all 50 coefficient differences positive, giving $\delta_{ts}=0.7130727631-0.1526326555\approx0.5604401$. With the conservative bound 0.5604, branching on $a_s\ge0$ gives $a_t\ge0.5604$, allowing t's ReLU to be replaced by its affine expression; branching on $a_t\le0$ gives $a_s\le-0.5604$, allowing s's output to be fixed to zero. Thus, scenario accumulation contributes different numbers of individually unstable units, and shared-decision relations provide a further mechanism for fixing their activations during joint MILP search.
Thank you for the review and suggestions.
W1. Applicability. CSD requires no one-to-one matching of raw x and ξ. In the standard 2RO formulation of Zeng and Zhao (2013, Section 2, Eq. (1)), recourse constraints are Gy≥h−Ex−Mξ in our notation. A general construction pairs (Ejx,hj−Mjξ) for each row j, retaining row identities and recourse coefficients. Thus, correspondence follows from the model throughout this formulation, even with unequal dimensions or dense couplings; it is not an additional structural prerequisite. Variables can occur in multiple rows, and this construction does not require continuous recourse.
Our benchmark features follow the same principle at the project, item, or facility–customer level. In CB, n project decisions share only four uncertainty factors. CSD learns Q(x,ξ) within Neur2RO's C&CG interface. We have clarified feature-level correspondence in the abstract, introduction, Section 3, and Figure 3; Appendix G details DFLP's indices.
Connection between motivation and evidence. Theorem 1 characterizes the information a separate scenario representation must retain to predict values across decisions. In the constructed recourse families, Separate requires at least r scenario dimensions, whereas CSD uses a scalar pooled state. We test the resulting scenario-selection behavior directly. On 297 held-out DFLP pairs, CSD recovers 91.1% of decision-conditioned ranking reversals versus 0.1% for Separate. Shuffling correspondence while preserving the data and model size raises CSD's median downstream gap from 0.00% to 82.32% and reduces median iterations from 9 to 2. These experiments connect correspondence to scenario ordering, premature termination, and decision quality.
The CB/RAP/DFLP comparisons use the same features, labels, splits, training budgets, and C&CG settings, with comparable parameter counts. Figure 2(b) increases both hidden widths and representation dimensions; Appendix C specifies the full configurations. Section 4 links the theoretical analysis to the scenario-recovery experiments.
Q1. CB runtime and solver settings. In Table 1, the 600 s medians are for CSD at n=20,30, and the roughly 660 s medians are for Separate at n=30,40,50. For this timing comparison, we profiled 10 randomly selected instances per seed (11,17,23), or 30 runs per architecture–size group.
CSD. At n=20,30, median cumulative MP times were 585.44/584.53 s, versus 12.19/13.67 s for AP. Median MP runtime shares were 96.4%–97.6%.
Separate. AP solves took about 600 s cumulatively, accounting for roughly 90% of runtime.
These MP/AP times are consistent with Table 1's median total runtimes of about 600 s for CSD and 660 s for Separate.
The CSD activation analysis at n=30,40,50 uses the same model and solver configuration as the main CB experiments, as specified in Appendix B.2. The table reports group medians for the last MP of each run.
Unstable ReLUs introduce binary activation choices; their bounds and couplings affect relaxation strength. Both counts decrease at larger n, suggesting a potential contributor to faster solves. Equal iteration counts need not imply equal runtimes.
The Table 1 runs used total/MP/AP time limits of 3,600/1,800/300 s, consistent with Appendix B.2, with each MP/AP call capped by the remaining total budget. We use two solver threads; relative MP/AP tolerances and the C&CG stopping tolerance are 10−4. At a subproblem time limit, available incumbents are used. Runs returning decisions remain in the time and iteration statistics; their gaps are included when evaluation completes.
Q2. Why 38.5 iterations? Table 2 reports medians. For (n,K)=(25,8), 50 test instances and three training seeds give 150 case–seed runs. The median averages the 75th and 76th sorted integer counts, yielding 38.5. “Instances” counts distinct cases; statistics pool all three seeds (Section 6.1 and Appendix I).
Q3. Neur2RO knapsack benchmark. We added the original KP benchmark: 504 instances, n=20,30,…,80, all four published correlation classes, seeds 11, 17, and 23, and a 3,600 s total budget per run. KP tests binary recourse coupled by a knapsack capacity under continuous budgeted profit uncertainty; item decisions are paired with their profit-deviation features.
Table 4 reports median reference gaps of 0.321% for CSD and 0.637% for Separate, a 49.7% reduction, with lower medians in every size group. Both use the same independent fixed-decision evaluation; all 1,512 evaluations per architecture are certified. Median runtimes are 535.44 s and 43.86 s, respectively. These results extend the evidence to a different recourse structure and quantify the quality–runtime trade-off. Appendices F and I give the formulation and evaluation protocol.