- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes TWARD, a two-time-scale weight-adaptation method for gradient-based multi-objective optimization. The fast time scale runs gradient descent on a soft achievement scalarization function (ASF) in the decision variable x, while the slow time scale updates the weight vector λ on the simplex via entropic mirror descent. The weight update combines an objective-space RBF repulsion term, which pushes nearby particles apart on the front, with a centering term that keeps the adaptive reference point near the ray from z. A key construction is that, because λ enters the ASF as logλ, a desired displacement in objective space can be mapped to a displacement in logλ in closed form, avoiding the solution-map Jacobian. An outer evolutionary loop searches the genome (λ,τ) with convergence and spacing tests, aiming to cross disconnected or degenerate fronts.
Critical strengths
-
The coupling between the scalarization and the weight dynamics is clean and non-trivial. Making λ an additive shift of the reference point, so that logλ moves linearly with objective-space displacement, is a neat trick that avoids inverting the solution map and gives the slow-scale update a closed-form geometric meaning. This is the main technical idea that distinguishes the method from standard preference-based gradient solvers.
-
The two-time-scale separation is well motivated and the fixed-λ analysis is honest about its scope. Lemma 1 and Theorem 1 quantify how the smoothness constant and the iteration complexity depend on τ, and the paper uses this to justify the temperature ladder rather than treating τ as an arbitrary knob. The observation that a single τ is sufficient for representability but not for reachability by descent is a useful clarification.
-
The empirical study is broad and the budget matching is taken seriously. The paper evaluates on 33 problems across four benchmark families, compares against a reasonable set of gradient and aggregation baselines, and matches the Jacobian-evaluation budget between TWARD and LibMOON-style methods. The appendix also reports tuning-seed versus held-out-seed behavior and a spacing-radius sweep, which is more transparency than many papers provide.
Critical weaknesses
-
The theory does not cover the algorithm that is actually run. Theorem 1 analyzes gradient descent on S_{λ,τ} at fixed λ, and the proof relies on the fast scale treating λ as frozen. The actual method alternates fast x-updates with slow λ-updates and an outer evolutionary loop with restarts, convergence tests, and spacing tests. There is no convergence guarantee for the coupled two-time-scale dynamics, no bound on the approximation error introduced by the repulsion-to-weight inversion on curved fronts, and no argument that the outer loop finds a well-spread subset of the front. The paper acknowledges that the inversion is exact only on locally flat patches and approximate on curved fronts, but it does not quantify how this approximation affects coverage or stationarity.
-
The method is heavily hyperparameter-dependent, and the paper tunes per problem.
-
The empirical comparison is not uniformly favorable, and the paper’s “matches or improves” framing is too generous. On WFG1, WFG3, WFG4, and several ZCAT instances, TWARD is not the best method; MOO-SVGD or HVGrad is better on WFG1/WFG3, and the paper’s own tables show gaps. On DTLZ1 and DTLZ3, the paper explains that all gradient methods struggle because of the multimodal distance term, which is fair, but this also means the benchmark does not discriminate between methods there. The main comparison lacks statistical tests.
-
The Jacobian budget is matched, but TWARD uses many short trajectories with restarts while the baselines use long trajectories per ray; this is a legitimate budget match, but it changes the optimization dynamics and should be discussed. The paper also does not compare against a simple baseline that runs the same soft-ASF scalarization with fixed weights and the same number of restarts, which would isolate the contribution of the weight adaptation from the contribution of restarts and repulsion.
Questions for authors
-
Can you provide a convergence or approximation analysis for the coupled two-time-scale dynamics, or at least bound the error introduced by the repulsion-to-weight inversion δ log λ=−δF/(τs) on curved fronts? How large is this error in practice, and does it explain any of the coverage gaps on WFG1/WFG3?
-
Table 5 shows per-problem tuning of seven hyperparameters. What is the recommended default configuration for a new problem, and how sensitive is the method to these choices? Can you report a sensitivity study or a tuning protocol that does not require per-instance search?
-
The comparison matches Jacobian evaluations, but TWARD uses G=4 generations with short inner trajectories and restarts, while the baselines use one long run per ray. Can you add an ablation with fixed weights but the same restart/repulsion budget, to isolate the effect of weight adaptation from the effect of restarts?
-
On WFG1/WFG3 and some ZCAT instances, TWARD is not the best method. Can you clarify the scope of the claim “matches or improves” and identify the geometries where the method is expected to be weaker?
2 comments
Q1. Can you provide a convergence or approximation analysis for the coupled two-time-scale dynamics, or at least bound the error introduced by the repulsion-to-weight inversion on curved fronts? How large is this error in practice, and does it explain any of the coverage gaps on WFG1/WFG3?
Thank you. C2 bounds the lag of the coupled dynamics and Fig. 87 of the revised paper measures it. C1 bounds the error of the lift by , and in practice the median cosine between the actual and predicted move is 0.97 (Fig. 86 of the revised paper). The lift does not explain the WFG1/WFG3 gaps. On WFG3 it is as accurate as elsewhere (cosine 1.00, length ratio 1.00), and on WFG1 convergence is the bottleneck, since no TWARD-S particle passes the convergence test even before the update. [Revised: Sec. 4.2, App. E.1 and E.2]
Q2. Table 5 6 now shows per-instance tuning of seven hyperparameters. What is the recommended default configuration for a new problem, and how sensitive is the method to these choices? Can you report a sensitivity study or a tuning protocol that does not require per-instance search?
Thank you. As a default we take, for each hyperparameter, the median of its tuned values over the 33 problems: , , , , , , . Leaving any single problem out changes only the smallest temperature (0.2 to 0.25), so the default is not fitted to the problem it is tested on. Run unchanged on all 33 problems, it raises the median IGD by 18% relative to per-problem tuning, stays within 25% on 20 problems, and still beats the best tuned baseline on 18. It transfers to WFG (+26%) and ZCAT (+15%) but not to ZDT3 and DTLZ2/5/6, whose tuned step sizes and temperatures are much smaller (on DTLZ6 no run converges). One-at-a-time sweeps on DTLZ2, DTLZ5, DTLZ7, WFG7 and ZCAT2 show that is forgiving (at most 40% within a factor of 2), while and the ladder cost far more when too small than when too large. Halving them costs up to 92% and , doubling them at most 32% and 36% ( is in 5nES Q5). We therefore recommend starting from the default and tuning only the ladder and the step sizes, erring towards larger and . Both and the spacing radius act on normalised objectives, so they need no rescaling across problems. The per-problem values are in Table 6 (Table 5 of the submission). [Revised: Sec. 5.4, App. E.5]
Q3. The comparison matches Jacobian evaluations, but TWARD uses generations with short inner trajectories and restarts, while the baselines use one long run per ray. Can you add an ablation with fixed weights but the same restart/repulsion budget, to isolate the effect of weight adaptation from the effect of restarts?
Thank you. Yes, see the ablation table in our reply to 5nES Q3. With the same restarts, archive and budget, fixed weights are 30% worse in median IGD (24% with random genomes), while keeping the weight adaptation with random genomes costs only 1.7%. [Revised: Sec. 5.1, Table 1, App. E.3]
Q4. On WFG1/WFG3 and some ZCAT instances, TWARD is not the best method. Can you clarify the scope of the claim "matches or improves" and identify the geometries where the method is expected to be weaker?
Thank you. We have restated the scope as follows [Revised: Sec. 1, 5.4, App. E.7]. Our methods have the best IGD on 27 of 33 problems at the matched budget, with the largest margins on disconnected, degenerate and curved-Pareto-set geometries (DTLZ5–7, ZCAT). They are not best on six. On ZDT3, WFG2, ZCAT14 and ZCAT17, HVGrad, which ascends the hypervolume directly, is better. On WFG4 MOO-SVGD is better, and on WFG5 Agg-PBI is ahead by 0.001. On degenerate connected fronts (WFG3, DTLZ6) the solver alone (TWARD-S) is better than TWARD, because convergence rather than finding new regions is the bottleneck. On the strongly biased WFG1 the two are within 0.3%.
We thank the reviewer for the thorough review and for highlighting the logλ shift of the reference point and the transparency of the empirical study. W1 and Q1 are answered in C1 and C2 of the general response at the top of this page, and we summarise them here.
Thank you. We agree that Theorem 1 alone does not cover the algorithm that is run. C1 bounds the error of the lift (Eq. 14) on curved fronts, and Q1 reports its size. C2 shows that, with gradient descent, the particles follow the moving weights and the weights follow the bilevel loop, both up to O(ηλ/ηx). C2 is local, does not show that the weights converge, and does not cover Adam, the running scale s or the outer loop. We have stated this in the paper. [Revised: Sec. 4.2 and 6, App. E.1 and E.2]. The error of the lift changes where a point ends on the front, not whether it is stationary, since every archived point passes the convergence test. Its effect on coverage is measured in Q3, where freezing the weights worsens 30 of 33 problems. For the outer loop we have no coverage guarantee. The spacing test keeps archived points at least r apart, which bounds the size of the archive. Since a share of every generation is drawn at random, any region farther than r from the archive receives a new point with positive probability in each generation. Replacements within r can sometimes remove a point that dominates its replacement. We measured this in Rcsj Q2, and it is rare. [Revised: Sec. 4.3, App. E.9]
Thank you. We agree this is a limitation and answer it in Q2.
Thank you. We agree that "matches or improves" is too generous and have restated the scope as in Q4. [Revised: Sec. 1 and 6] On WFG1 and WFG3, both TWARD and TWARD-S are ahead of every baseline in IGD and HV in our tables (e.g. WFG3 IGD: TWARD-S 0.022, TWARD 0.035, best baseline HVGrad 0.043). The gap there is between our two variants, which Q4 explains. We agree that DTLZ1/DTLZ3 do not discriminate between gradient methods, which is why they are reported separately (Appendix B.7). Two-sided Wilcoxon rank-sum tests over 5 seeds, between our best variant and the best baseline on each problem, show ours significantly better at the 5% level on 25 of 33 problems and worse on two (ZDT3 vs. HVGrad, WFG4 vs. MOO-SVGD). [Revised: Sec. 5.4, App. E.7, Table 13]
Thank you. This choice is deliberate and we have added a discussion of it [Revised: Sec. 5.4, App. E.4]. Appendix D.10 shows that, at fixed cardinality, more steps per trajectory mostly refine regions already found, while restarts with new genomes reach new ones. Where convergence rather than finding new regions is the bottleneck, the long-trajectory variant TWARD-S is better (5nES Q6). The control baseline is in Q3 below (Sec. 5.1, Table 1, App. E.3).