- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes MFPI-Net, a neural solver inspired by the classical Modified Fixed-Point Iteration (MFPI) algorithm for solving Absolute Value Equations (AVEs). Building upon the convergence theory of MFPI, the authors provide theoretical guarantees on approximation accuracy and stability. The proposed framework adopts a two-stage approach: MFPI-Net first generates an approximate solution, which is subsequently refined through numerical linear solves to obtain a high-accuracy solution. Experiments are conducted on synthetically generated AVE instances with problem dimensions ranging from 1,000 to 10,000. The results demonstrate that the proposed method achieves low residual errors with relatively short solving times.
Critical strengths
-
The paper is clearly written and easy to follow. It addresses a meaningful numerical optimization problem.
-
The paper provides substantial theoretical and empirical analyses. Unrolling MFPI into a learnable neural solver is also an interesting direction.
Critical weaknesses
-
Limited evaluation on established benchmarks. The experiments are primarily conducted on synthetically generated instances. Evaluations on established LP or combinatorial optimization benchmarks would better demonstrate the effectiveness and practical applicability of the proposed method.
-
Limited baseline comparisons. The current baseline comparisons are relatively limited. It would be helpful to include comparisons with widely used optimization solvers, such as Gurobi, COPT, or SCIP, particularly for the LP experiments, to better assess the competitiveness of the proposed framework.
-
Concerns about scalability. The proposed method relies heavily on computing the inverse of a matrix, which raises concerns about its scalability to larger problems. Moreover, as shown in Table 13, MFPI-Net does not consistently outperform PDHG-Net, particularly on larger instances. These results raise questions about the advantages of the proposed method for large-scale optimization.
Questions for authors
-
In Table 1, the classical MFPI algorithm already solves the generated instances within a few seconds. Could the authors evaluate MFPI-Net on more challenging benchmarks to better demonstrate its advantages over conventional numerical methods?
-
The proposed framework still relies on numerical refinement to obtain high-accuracy solutions. Could the authors provide more detailed statistics on the quality of the solutions produced by MFPI-Net before refinement? For example, what are the residual errors and solution accuracies achieved by the first stage alone?
-
Could the authors compare MFPI-Net followed by numerical refinement against classical MFPI followed by the same refinement procedure under matched computational budgets? Such a comparison would help clarify how much of the improvement comes from the learned initialization rather than the refinement stage.
6 comments
Page 2 of 4
Responses to the questions
Response to Q1. Our data-generation procedure follows established practice in AVE algorithm research, including the MFPI [6] and SOR-like [7] studies. Longer wall-clock runtimes alone do not make a benchmark more informative. The most important scientific result of these experiments is whether the network produces good approximate solutions, reduces the numerical work required, and handles instances that challenge the source algorithm. Our experiments establish all three.
The short MFPI runtimes also reflect our comparison protocol: we implemented MFPI in PyTorch on the same GPU and with the same batch sizes as MFPI-Net, giving the classical baseline the same batching advantages. Even with this acceleration, MFPI requires 2.124 s per instance at in Table 1's lower-accuracy setting, compared with 0.409 s for MFPI-Net. The speedup grows from approximately at to at . More fundamentally, a single forward pass of MFPI-Net reaches the residual accuracy that requires 40.2–41.0 classical MFPI iterations. This directly demonstrates that the network has learned an effective approximate solution map.
The paper also already includes substantially harder instances. Section 4.2 and Appendix E.6 examine AVEs outside : the prescribed MFPI parameter rules provide no admissible parameters, and both FPI and cold-start generalized Newton fail to converge within 10,000 iterations on the tested instances. MFPI-Net predicts the correct signs and enables high-accuracy recovery. For the LP-derived AVEs, Appendix E.7 further shows that FPI residuals remain around after 30,000 iterations, whereas MFPI-Net achieves residuals around . These results establish an expansion of solving capability as well as acceleration. Together with the additional WA benchmark in W1, they directly address the request for more challenging evaluation.
Response to Q2. The requested first-stage statistics are already reported separately from refinement. Table 1's left panel evaluates MFPI-Net alone, with RES ranging from to . On the harder instances in Table 2, the network alone achieves RES of –. It correctly predicts the solution signs in both settings. Here, RES is the mean squared equation residual, .
Appendix E.2 further reports 100% component-wise sign accuracy up to dimension 25,000. In the reported experiments, sign errors arise in the near-zero-component setting of Appendix E.5, where even small prediction errors can change a component's sign. In that setting, first-stage RES is – and component-wise sign accuracy is 99.8%–99.9%. This percentage measures individual components, rather than exact recovery of an entire sign pattern. The second stage corrects the remaining errors. Thus, both the accuracy of the neural output itself and the effect of refinement are explicitly quantified.
Response to Q3. We have added a direct comparison that fixes the second-stage sign-correction procedure and varies only the initialization: MFPI-Net output versus classical MFPI stopped after 5, 10, ..., 40 iterations. The experiment uses and the same final stopping threshold as the paper, . All times below include matrix preparation, the first stage, and the second stage.
| First-stage initializer | Component-wise sign accuracy | Second-stage iterations | Total time (s) |
|---|---|---|---|
| MFPI-Net | 100% | 1 | 0.0048 |
| MFPI, 5 iterations | 98.42% | 2 | 0.0125 |
| MFPI, 10 iterations | 99.34% | 2 | 0.0130 |
| MFPI, 15 iterations | 99.76% | 2 | 0.0136 |
| MFPI, 20 iterations | 99.89% | 2 | 0.0137 |
| MFPI, 25 iterations | 100% | 1 | 0.00739 |
| MFPI, 30 iterations | 100% | 1 | 0.00740 |
| MFPI, 35 iterations | 100% | 1 | 0.00743 |
| MFPI, 40 iterations | 100% | 1 | 0.00744 |
MFPI-Net predicts all signs correctly and requires one refinement step. Among the tested MFPI budgets, 25 iterations are first needed to reach the same sign accuracy and one-step refinement.
Page 3 of 4
Classical MFPI and SOR-like methods are conventionally formulated as standalone iterative solvers, without a separate second stage for sign correction [6,7]. Adding such a stage introduces an additional switching decision: how many classical iterations should be performed before refinement begins? The baseline algorithms do not prescribe this transition, and a fixed iteration count does not by itself certify that the signs are correct. MFPI-Net learns to produce an accurate approximation and reliable signs at a fixed network depth, making it an effective first stage. Table 1 demonstrates its solution accuracy relative to approximately 40 MFPI iterations, and the new comparison separately establishes its value when both initializers receive the same refinement.
MFPI-Net thus delivers a core contribution of algorithm unrolling and learning to optimize: a neural network directly produces high-quality approximate solutions, reducing the subsequent numerical work required to reach high accuracy [8].
Clarification of the paper's novel contributions
We thank the reviewer again for the thoughtful and constructive feedback. The concerns raised do not undermine the paper's core innovations. We recognize that the manuscript may not have communicated the strengths and main contributions of the work clearly enough. We would therefore like to summarize the following three key contributions.
First, a continuous-time analysis of learned initialization and numerical refinement. To our knowledge, this is the first dynamical-systems analysis in deep unrolling to connect a finite-depth error bound to the design of a two-stage solver. By interpreting the MFPI-Net updates as a discretization of a continuous-time dynamical system, Section 3.2 bounds the finite-depth solution error in terms of three interpretable sources. The bound motivates using a moderately deep network to generate a useful initialization and utilizing numerical refinement to attain high accuracy. Prior theoretical work in deep unrolling and learning to optimize has largely focused on approximation within a single learned stage. Our analysis fills this gap by providing a basis for designing and analyzing hybrid optimization solvers.
Second, an empirical demonstration of unrolling beyond the base algorithm's prescribed convergence regime. Our LP and convex QP experiments, together with tests on AVEs satisfying , provide, to our knowledge, the first numerical evidence that a trained unrolled network can produce useful approximations beyond the prescribed convergence regime of its underlying algorithm. In the latter tests, MFPI's standard parameter-selection rules yield no admissible parameters, and cold-start generalized Newton fails to converge within 10,000 iterations. MFPI-Net still produces high-quality approximations that enable numerical refinement. This finding broadens the potential use of deep unrolling by showing how learned initialization can extend the range of problems a solver can address.
Third, an AVE-based warm-start strategy for linear and convex quadratic programming. AVEs can encode the optimality conditions of both LPs and convex QPs, but the difficulty of solving the resulting AVEs with conventional methods has limited the practical use of this reformulation. MFPI-Net makes this route viable by approximating the reformulated AVEs even outside the standard convergence regime. We map these approximate solutions back to high-quality warm starts for conventional LP and QP solvers. The resulting two-stage framework provides a common route to accelerating both classes of convex optimization problems through their AVE reformulations.
We acknowledge that the current method has limitations. In particular, the reviewer correctly identifies matrix inversion as a computational bottleneck that constrains scalability, and addressing this bottleneck remains an important direction for future work. These limitations, however, do not undermine the three core contributions established above. We respectfully ask the reviewer to carefully weigh these contributions alongside the acknowledged limitations and reconsider the assessment in light of the theoretical results and experimental evidence.
Page 1 of 4
We thank the reviewer for the careful reading and constructive feedback. We address the concerns and questions below. While we believe that these concerns do not diminish the paper's core contributions, we recognize that we may not have communicated their novelty clearly enough in the manuscript. We therefore conclude our response by clarifying the three central contributions of this work.
Responses to the weaknesses
Response to W1. PageRank is an established application benchmark for LP algorithms, used in the PDLP/PDHG literature [1] and PDHG-Net [2]. Our LP evaluation therefore already follows benchmark practice in this field.
We have additionally evaluated the WA benchmark used by PDHG-Net [2], consisting of LP relaxations of combinatorial optimization problems from ML4CO [3]. Following its data-generation procedure, we use two parameter settings, yielding AVE dimensions of 750 and 2700 after reformulation. The results are:
These results demonstrate that the learned AVE solutions also provide effective initializations for LP relaxations from a distinct combinatorial optimization benchmark, reducing PDLP iterations by 20.2%–31.1%.
Response to W2. This paper studies neural AVE solving; it is not an LP-specific study aimed at developing a solver that outperforms state-of-the-art commercial or other LP solvers. The LP experiments, together with the additional QP experiments, evaluate MFPI-Net on AVEs obtained from concrete optimization applications. Their central purpose is to demonstrate the network's robustness on these application-derived AVEs and its ability to produce sufficiently accurate approximate solutions to accelerate existing optimization solvers.
To assess the practical value of these approximations, the paper already compares cold starts and MFPI-Net warm starts for cuPDLPx [4] and HPR-LP [5], state-of-the-art GPU LP solvers, alongside PDLP and SCS. To our knowledge, no prior work on algorithm unrolling has reported comparisons with these GPU LP solvers. These comparisons directly test whether the learned AVE solutions reduce the work required by established solvers. We now add COPT 8.07, using its CPU-based barrier and primal simplex methods in the same experimental environment as the paper. The following table reports solving times in seconds on the PageRank LPs:
COPT is slower than cuPDLPx at every reported size, with the gap increasing substantially as the problem grows. Thus, the commercial-solver comparison confirms the strength of the existing GPU baselines on these instances.
The decisive evidence is therefore whether the network can solve application-derived AVEs well enough to improve an existing solver's initialization. Wall-clock time also reflects hardware, implementation, preprocessing, and solver-specific heuristics. Holding the refinement solver fixed, the reduction in its iteration count directly measures how much numerical work the learned approximation removes. Table 3 demonstrates this benefit across all four LP solvers and all tested sizes, establishing both the quality of the neural AVE approximations and their practical value for LP solving.
Response to W3. Computing A−1 remains a computational bottleneck in the current method. Its cost is included in the reported solving times, and reducing this cost is explicitly identified as future work in the paper.
Table 13 establishes a clear empirical comparison: MFPI-Net outperforms PDHG-Net at the three smaller sizes, while PDHG-Net performs better at the three larger sizes. PDHG-Net directly unrolls the LP-specific algorithm underlying PDLP [1], whereas MFPI-Net addresses AVEs and their LP/QP reformulations. Even at the larger sizes, MFPI-Net reduces PDLP iterations by 32.0%–44.5% and total solving time by 26.9%–36.5%. These are substantial gains over cold-start solving. The paper's central advances concern the theoretical basis for learned approximation and refinement, the practical use of AVE reformulations, and the expansion of MFPI's demonstrated solving scope. Architectural complexity or the largest speedup on every LP size is not the criterion that defines these contributions.