acceptodds
Under review as a conference paper at ICLR 2027

SURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization

Abstract

Constructing a finite Pareto representation requires deciding where a limited number of solutions should be placed along a continuous Pareto front (PF). A desired preference distribution provides a direct way to specify this allocation by assigning more solutions to some PF regions and fewer to others. Scalarization generates Pareto solutions by varying objective weights and solving single-objective problems. However, a distribution of scalarization weights generally does not translate into the same distribution of Pareto solutions along the PF, because the weight-to-solution map is nonlinear and unknown in advance. We introduce SURFACE (Scalarization Updates for Redistributing Finite Approximations with Chart Estimation), which adaptively updates scalarization weights to match a desired PF distribution. SURFACE estimates how each region of the weight grid corresponds to an area of the PF from the current scalarized solutions, then redistributes the weights accordingly. The method supports parallel, warm-started, inexact optimization with standard single-objective solvers. For smooth positive preference distributions, we prove that the error decreases geometrically to an finite-sample level, with the same rate for the mismatch between the desired and achieved PF allocation, where is the number of adaptive weights and is the number of objectives. Experiments across diverse benchmarks and comparisons with nine baselines consistently demonstrate strong performance.

Primary area:
optimization
Keywords:
Multi-objective optimization, Pareto front approximation, uniform sampling, scalarization, manifold optimization

Reviews

Among:
Shape:
1234this paper, Bottom 49%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.20 over 5 reviews, above 49% of the others.
Reviewer_QfKCOpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

The paper proposes SURFACE, a method for placing a finite set of Pareto solutions so that their distribution along the Pareto front matches a user-specified preference distribution. Starting from Tchebycheff (or weighted-sum) scalarization, SURFACE reconstructs the weight-to-front mapping from the current scalarized solutions. From this mapping it estimates how much front area each region of the weight simplex represents. It then redistributes the weights through mass equidistribution, using inverse-CDF transport for two objectives and Moser transport for more. The authors give checkable conditions under which Tchebycheff scalarization yields a smooth, non-folding front parameterization. They also prove geometric convergence to a finite-resolution error floor under warm-started inexact solves.

Critical strengths
  • The formulation is clean and practically meaningful. Treating the desired front allocation as an explicit input, rather than an implicit consequence of hypervolume, crowding, or reference vectors, gives a principled target. It connects a priori preference specification with a posteriori front representation.
  • The method is a natural generalization of SURF to more than two objectives and to nonuniform preferences. It never differentiates through the inner optimizer, keeps all scalarized solves parallel and warm-startable, and works with off-the-shelf solvers.
  • The theoretical analysis is careful and complete for its regime.
Critical weaknesses
  • Unfair benchmark comparison. SURFACE and Uniform report close numbers on ZDT1/ZDT4 and on DTLZ2/3/4. This suggests the scalarized solver finds near-exact Pareto points even on multimodal problems, while the evolutionary baselines run end-to-end and degrade on exactly those problems. The gains may therefore reflect solver strength rather than weight redistribution. Please report the inner solver, initialization, and compute budget for all methods. Against Uniform, the fair comparison, the improvements are modest.
  • Reporting inconsistencies. Section 5.2 refers to 11 settings, but Figure 6 ranks only nine. The excluded four-objective tasks are where SURFACE loses on its own target metric to LMPFE and DEA-GNG. On Resource Gathering, SURFACE’s hypervolume is ten times lower than the baselines’, yet its IGD is far better. Is IGD measured against the KL-regularized front rather than the true one?
Questions for authors

Please see weaknesses.

2 comments
AuthorsOpenReview ↗

Clarification: Benchmark Fairness, Computational Budgets, and Evaluation Consistency

We thank the reviewer for recognizing SURFACE's practically meaningful preference formulation and careful, complete theoretical analysis. We provide detailed answers to the concerns as below.

W1. Benchmark Fairness and Inner-Solver Budgets

We provide detailed computational accounting and additional wall-clock comparisons in General Response G.1 at the top of this discussion page. Importantly, SURFACE and Uniform share the same exact ZDT/DTLZ oracle, while iterative solvers permit matched update budgets, isolating adaptive weight redistribution. SURFACE performs KK inner steps per weight over TT rounds, while Uniform allocates KTKT steps to each fixed weight. Both return the same number of solutions. Other baselines use different end-to-end optimization procedures, including population-based search and auxiliary neural-network training in UMOD. As detailed in G.1, the original Resource Gathering comparisons allow several evolutionary baselines substantially longer execution times. Our additional wall-clock-matched comparison further shows that SURFACE achieves the best preference matching, IGD, and HV among the compared methods. For InnerSolver and initialization, Appendix E details the experimental procedures. The ZDT/DTLZ benchmarks use the same Tchebycheff-scalarized optimization procedure for SURFACE and Uniform. The controlled inexact-solve experiment uses warm-started gradient descent, Deep Sea Treasure, Resource Gathering, and Fruit Tree use KL-regularized soft-value iteration, and Minecart uses a common frozen GPI-LS policy set. SURFACE initializes weights on a regular reference mesh and warm-starts each scalarized problem from the preceding round. Stochastic baselines use five seeds with matched returned-solution cardinality. We will clarify the numerical solver configurations, initialization, and computational budgets for each method in Appendix E.

As in General Response G.2, SURFACE's contribution is adaptive weight redistribution, not a stronger inner optimizer. Its modular framework supports both exact and inexact inner optimization, while PF interpolation and MEQ operate in the (M−1)(M-1)-dimensional weight space without differentiating through the inner solver. This makes SURFACE compatible with existing application-specific optimizers. IGD is a complementary metric measuring PF approximation quality, rather than SURFACE's directly targeted preference-mass distribution. Thus, modest IGD improvements over Uniform are expected given the same inner solver and uniform target preference. SURFACE directly targets preference-mass distribution across the PF. For example, it reduces the PF-area residual from 0.5050.505 to 0.3160.316 on ZDT4 and from 1.0781.078 to 0.6930.693 on M=3M=3 DTLZ3 using the same inner solver. The similar results on DTLZ2/3/4 are consistent with their shared PF geometry. These improvements arise from weight redistribution under the same scalarized optimization procedure.

W2. Reporting Consistency and HV–IGD Interpretation

We thank the reviewer for identifying the inconsistency between the 11 settings described in Section 5.2 and the nine shown in the original Figure 6, which we have corrected by including the four-objective cases where LMPFE and DEA-GNG outperform SURFACE on individual metrics. Across all 11 settings, SURFACE retains the best mean PF-area imbalance and IGD ranks (both 1.18), compared with 3.18 and 2.27 for the second best. This correction concerns experimental reporting and does not affect the underlying results, theoretical guarantees, or conclusions.

For Resource Gathering, we clarify that both IGD and HV are evaluated using unregularized environment returns, not the KL-regularized training objectives (Appendix E.4). These metrics characterize different aspects of PF representation: IGD evaluates proximity and coverage relative to the PF reference, while HV measures dominated objective-space volume. The original evolutionary baselines were allowed longer runtimes and optimized their native objectives, whereas SURFACE used KL-regularized policy optimization. These differences can contribute to the higher evolutionary HV in the original comparison. As detailed in General Response G.1, we additionally aligned the KL-regularized objectives across methods and evaluated their unregularized returns under matched computational budgets. Under the same time budget, SURFACE achieves the best HV, IGD, and preference residual. Moreover, SURFACE's HV remains higher than that of the evolutionary baselines even when they are allowed to complete their longer runs under the aligned objective setting. We will incorporate and clarify the these in Appendix E.4.

Together, these clarifications and additional experiments demonstrate the effectiveness of preference-aware weight redistribution independently of inner-solver strength, with consistent improvements under controlled and computationally aligned comparisons.

AuthorsOpenReview ↗

Follow-up: Summary of Responses and Revisions

We thank the reviewer again for their careful evaluation. We hope our corrected benchmark rankings, clarification of the shared inner-solver comparisons, and additional objective-aligned, budget-matched experiments address the reviewer's principal concerns regarding experimental fairness and reporting consistency. As the discussion period concludes, we would sincerely appreciate the reviewer revisiting these results and reconsidering their assessment.

Reviewer_ULm1OpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
2
Soundness
3
Read review
Paper summary

This paper provides an approach to constructing a finite approximation of the Pareto set, where the discretization follows roughly a target density function. The basic idea is to parametrize the Pareto front FPFF_{\mathrm{PF}} by the simplex via the Tchebycheff scalarization, and to pullback a density function θ:FPF→R\theta : \mathcal{F}_{\mathrm{PF}} \to \mathbb{R}. The algorithm iteratively approximates the Pareto front by: (1) selecting weights w\mathbf{w} that form a mesh on the current approximated front, where each cell of the mesh captures roughly the same amount of mass under θ\theta, (2) solving for the solutions of the Tchebycheff scalarized problem under those weights. Under some regularity conditions, the paper also provides a convergence guarantee. There are also experiments.

Critical strengths

The paper studies a fundamental problem in multi-objective optimization, provides a relatively natural algorithm (as far as I can tell), and also what seems to be a reasonable convergence guarantee.

Critical weaknesses

I think the main issue with the paper is the presentation of the ideas. Much of the writing is too terse; I am guessing a lot at what the algorithm is doing, and there are a lot of references to outside techniques that I think should be explained more thoroughly in the main body of the paper. More specifically:

  1. I don't really understand how you are approximating the Pareto front at each iteration to produce PtP_t. When you state that you "use a local quadratically augmented RBF interpolation combined through a partition-of-unity construction" (line 245), I have no idea what that actually means. The reference then points to a whole textbook Wendland 2005. It seems like this is more complicated than just doing piecewise linear approximation on a mesh defined by the previously selected points?
  2. You say that θ:FPF→R\theta: \mathcal{F}_\mathrm{PF} \to \mathbb{R} is a unnormalized density on the Pareto front. However, later in equation (9), it seems to be computed on the approximate Pareto front PtP_t, which is potentially not in the domain of θ\theta. This is rather confusion, especially you don't say until later in Assumption 3 that you extend θ\theta beyond the Pareto front. Perhaps you should assume from the start that θ\theta is defined everywhere in RM\mathbb{R}^M?
  3. The whole discussion around equation (10) is also quite confusing. It seems that this is how you select a mesh. While I think I get what's going on intuitively, I don't see how the Moser transport formally select this. The paper cited (Bruveris et. al. 2018) does not seem to mention a Moser transport, and the proof of Proposition 6 in the appendix reads a bit hand-wavy to me.
  4. The exposition around the analysis is also extremely terse, citing "standard local convergence and sensitivity theory" and the "finite-step analysis of SURF (Jiang et al. 2026)" (line 308). The first is quite vague, and the second work is a new work, so I wouldn't expect a reader to just know what this means.
  5. I'm having a hard time parsing Theorem 1. How should I read this convergence rate? It seems like you have a budget of TNTN calls to the inner solver, and then perhaps the dominating term is N−2/(M−1)N^{-2/(M-1)}?
  6. A side note: you mention that the inner solve can be achieved through "gradient-based optimization for differentiable scalarized objectives" (line 237). Isn't one issue with Tchebycheff scalarization that it isn't differentiable everywhere? It becomes a minmax optimization problem. However, I think it is also fine if you just assume an inner solver.
Questions for authors

I was only able to get a vague gist of what your algorithm and analysis is doing, and I think the main issue is the exposition. The overall idea seems reasonable and it is nice that you seem to get a convergence rate. Intuitively, I imagine a lot of the technical work is in controlling the approximation error, where the weights you sample are determined from PtP_t and not FPF\mathcal{F}_{\mathrm{PF}}. This seems like a nice contribution. However, I think it would be very difficult for someone who wants to implement this algorithm to understand how to do so from how the paper is currently written. For that reason, I recommend a weak reject. It seems like a lot of work to revise the manuscript and to give the contents a proper treatment. Unfortunately, because I think major revisions are needed, I don't know if there is much the authors could do to materially affect my assessment. I think it would be reasonable to have this paper go through a second round of review (perhaps ICML would be a good timeframe), and by then the paper would be much far easier to understand.

3 comments
AuthorsOpenReview ↗

Addressing PF Reconstruction, Preference Density, and Mass Redistribution

We thank the reviewer for recognizing SURFACE's fundamental problem setting, natural algorithmic approach, and convergence guarantee. We have substantially strengthened the exposition and practical reproducibility in the revised manuscript, directly addressing the concerns about PF reconstruction, mass redistribution, and convergence analysis. We detail these revisions below in italic and invite the reviewer to revisit the updated manuscript.

W1. Construction of the Reconstructed Pareto Front PtP_t

We appreciate this question. General Response G.2 at the top of this discussion page provides a step-by-step explanation of SURFACE's algorithm, interpolation procedure, and practical implementation. SURFACE constructs PtP_t by smoothly interpolating the sampled weight–objective pairs. Specifically, local RBF models augmented with quadratic polynomials are fitted on overlapping patches and blended through a smooth partition of unity. This is a standard scattered-data interpolation technique (Wendland, 2005; cited in Section 3 and Appendix C.1). The resulting chart provides the derivatives needed to estimate the PF-area factor JPtJ_{P_t} without differentiating through the inner optimizer.

The revised Section 3 (lines 270–280) provides an accessible explanation of this construction, while Appendix C.1 specifies the interpolation and its stability conditions. Revised Appendix A.3 further provides the explicit local interpolation formula and implementation steps.

We also conducted an additional controlled comparison with the suggested piecewise-linear interpolation on DTLZ2 (M=3M=3), using identical PF samples and transport procedures. Smooth interpolation reduces the reconstruction error from 0.3630.363 to 0.06580.0658 and the density error from 0.4190.419 to 0.3370.337. The independently evaluated target-mass residual decreases from 0.1450.145 to $0.119, demonstrating the benefit of smooth interpolation for preference redistribution.

W2. Domain of the Preference Density ϑ\vartheta

We thank the reviewer for identifying this ambiguity. The target preference is specified over objective values, while its smooth extension permits evaluation on the reconstructed PF.

Since Pt(w)P_t(\mathbf w) may lie outside the true PF, evaluating ϑ(Pt(w))\vartheta(P_t(\mathbf w)) requires a suitable extension. This is explicitly covered by Assumption 3, which requires a positive C2,1C^{2,1} extension to an open neighborhood containing both the true PF and reconstructed charts.

The revised Introduction (lines 53–55) introduces ϑ\vartheta over attainable objective values, while Assumption 3 (lines 305–307) specifies the additional neighborhood regularity. Appendix A.3 (lines 1003–1010) now explicitly explains how this extension is used in density estimation.

This clarifies the domain needed for revised Eq. (10) while preserving the original preference formulation and theoretical guarantees.

W3. Mass Equidistribution and Moser Transport

We appreciate this question and clarify how MEQ converts a target density into updated scalarization weights. Revised Equation (3) specifies the target distribution, and revised Eq. (11) gives the desired allocation: each represented cell should carry approximately equal probability mass under ρt+1\rho_{t+1}. SURFACE realizes this by transporting an initially equal-volume reference tessellation through a map Φ\Phi satisfying ρt+1(Φ(w))det⁡DΦ(w)=ρ0(w),\rho_{t+1}(\Phi(\mathbf w))\det D\Phi(\mathbf w)=\rho_0(\mathbf w), where ρ0\rho_0 is the uniform reference density. By change of variables, each transported reference cell carries equal target mass, and its transported vertices determine the updated scalarization weights. The cited work of Bruveris et al. (2018), establishes the underlying density-transport construction for domains with corners, including simplices. SURFACE develops its finite numerical realization and mesh-stability analysis.

Revised Appendix C.2.1 (lines 1374–1424) details the face-preserving velocity-field construction, its integration, and the resulting mass-conservation identity. Revised Proposition 7 establishes finite mass accuracy, while Proposition 3 summarizes the main stability guarantee. The revised Section 3 (lines 283–293) now explains MEQ as the transport of equal-volume reference cells. Moreover, the revised Appendix C.2 also provides an alternative equal-capacity construction using power cells and semi-discrete optimal transport. For M=2M=2, inverse-CDF transport provides the corresponding one-dimensional realization. These constructions realize the same mass-equidistribution principle through different numerical procedures.

AuthorsOpenReview ↗

Continued Responses

W4. Inexact Inner Solvers and Convergence Analysis

The key between changing scalarization weights and inexact optimization is jointly control parametric sensitivity, warm-started solver error, and PF reconstruction error. The analysis uses a KK-step inner-solver contraction factor ηK\eta_K: ∥xK−x⋆(w)∥≤ηK∥x0−x⋆(w)∥\|x_K-x^\star(\mathbf w)\|\leq\eta_K\|x_0-x^\star(\mathbf w)\|. As the weights change, the optimal x⋆(w)x^\star(\mathbf w) also move. Parametric sensitivity bounds this movement, while warm-started optimization contracts the remaining error. PF interpolation then translates the inexactness errors into estimated geometry and preference density. Crucially, the reconstruction error includes amplification by the inverse mesh scale, as quantified in Lemma 2. Section 4 explicitly connects reconstruction accuracy, finite MEQ stability, and inexact inner-solver contraction through the coupled error Et\mathcal E_t in revised Eq. (13). Appendix D.1 provides the exact-solver analysis, while Appendix D.2 details the inexact-solver, initialization accuracy, and coupled convergence argument. They make the theoretical mechanism self-contained and clarify the role of the inner-solver assumptions without requiring familiarity with SURF.

W5. Interpretation of Theorem 1 and Computational Complexity

We provide detailed computational accounting and additional wall-clock comparisons in General Response G.1 at the top of this page and more algorithm explanation in G.2. Theorem 1 gives Et≤(1−α/4)tE0+O(N−2/(M−1))\mathcal E_t\leq (1-\alpha/4)^t\mathcal E_0+O(N^{-2/(M-1)}). The first term gives linear contraction across outer iterations, while the second gives the converged floor arising from finitely many scalarization weights. For constant damping α\alpha and sufficiently accurate inner solves, T=O(α−1log⁡N)T=O(\alpha^{-1}\log N) suffice to reach the floor. Each round tt involves NN scalarized problems for KK update steps, giving O(NKT)O(NKT) inner optimization steps, with initialization and auxiliary solves accounted for separately. PF interpolation and MEQ operate in the (M−1)(M-1)-dimensional weight space. Revised Section 4 presents the coupled convergence guarantee and its computational implications. Table 1 explicitly characterizes the tradeoffs among the inner budget KK, outer rounds TT, damping α\alpha, and inner-solver convergence regimes.

W6. Nonsmoothness of Tchebycheff Scalarization

We thank the reviewer for highlighting this distinction. We address the nonsmoothness of Tchebycheff scalarization from three perspectives.

  • Practical optimization of TS involves a maximum over objectives, which can be handled by automatic differentiation and optimizers such as Adam. At each iteration, backpropagation computes the gradient through the active (maximizing) objective, or a valid subgradient at ties. For example, in PyTorch:
losses = torch.stack([f1(x), f2(x), f3(x)])
ts_loss = torch.max((losses - z) / w)
ts_loss.backward()
optimizer.step()
  • Tchebycheff scalarization admits an equivalent epigraph formulation with smooth inequality constraints** when the underlying objectives are smooth. Under the stated sensitivity conditions (LICQ, SOSC, and local regularity), this formulation yields a locally smooth weight-to-PF mapping, supporting SURFACE's theoretical analysis.
  • SURFACE is not restricted to standard Tchebycheff scalarization. When the required smoothness conditions do not hold, we can adopt alternative scalarizers, such as smooth Tchebycheff approximations, provided they satisfy the requisite PF coverage and regularity conditions. SURFACE only requires an inner solver meeting the prescribed accuracy conditions, without differentiating through the inner optimizer.

Q. Overall Exposition and Practical Reproducibility

We appreciate the reviewer's emphasis on accessibility and reproducibility. The revised manuscript now provides a substantially clearer explanation of SURFACE, from its geometric intuition to its numerical implementation and convergence guarantees. Specifically, the revised Introduction and Figures 1–3 explain the preference distribution and weight-to-PF geometry; Section 3 presents the algorithm through four concrete operations; Appendix A.3 provides a practical implementation guide; Appendices C.1–C.2 detail interpolation and transport; and Appendix D develops the complete convergence analysis.

As explained in General Response G.2 at the top of this discussion page, SURFACE provides a modular interface for existing inner solvers, while PF interpolation and MEQ are performed independently in the (M−1)(M-1)-dimensional weight space. The supplementary implementation further organizes these components for reproducibility. We hope the substantial revisions address the reviewer's central concerns and sincerely invite the reviewer to revisit the revised manuscript and reconsider the assessment in light of these improvements.

AuthorsOpenReview ↗

Follow-up: Summary of Responses and Revisions

We thank the reviewer again for their thoughtful feedback. We hope our detailed explanations and revisions concerning PF interpolation, Moser transport, and inexact-solver convergence, together with the additional interpolation experiment, address the reviewer's central concerns about implementation and theoretical exposition. As the discussion period approaches its conclusion, we would sincerely appreciate the reviewer's reconsideration.

Reviewer_2y1GOpenReview ↗
Rating
2(+1)
Confidence
2
Informativeness
2
Presentation
1
Soundness
1
Read review
Paper summary

This paper introduces SURFACE, a method for distributing a limited number of solutions more effectively along a Pareto front. The main challenge is that adjusting the weights in scalarization does not necessarily produce the desired distribution of solutions, since the relationship between weights and solutions is nonlinear and difficult to predict. SURFACE addresses this by estimating how different weights map to regions of the Pareto front and then adaptively adjusting them to better match a desired distribution. It also supports parallel optimization and can work with standard solvers. The authors theoretically show that the method achieves a strong convergence rate, and experiments on various benchmarks demonstrate that it consistently performs well compared with nine existing methods.

Critical strengths

The strength of the paper is its complex topic, and its very important standing in multiobjective optimization. The structure of the paper is also quite clear, and the topic is roughly well-described. The mathematical content seems also to be in quite depth, and the eperiments are sophisticated, providing the desired insights which the paper is aiming for. However, the weaknesses surpass its strength by far.

Critical weaknesses

The main weakness of the paper is not its content, but its presentation. The formulas are hardly understandable, because explanations are missing and symbols are not edaquately introduced. I also miss a clear motivation of the topic. The algorithm framework is hardly explained. What I also miss is a comparison of the presented algorithm with existing ones in the literature. Some twelve major critics are:

-> The formula by Ehrgott and Lin falls from heaven, and the explanation about the "componentwise lower reference point" is not complete. WHat is the overall goal of this formula? -> I miss detailed explanations how concretely PF distributions are computed, and why such weights are useful there, and how your method differs to that methods you list in the related work section. -> Notation: The symbols, (e.g. Lipschitz k-th derivative, intrinsic weight-space and so on) require more deeper explanations. Delta_m is not introduced. -> The symbols in Assumption 3 (and similarly in claims below) are hardly explained. Also define pareto patch formally! -> Formalize PF-area density, and explain J(w), and why you are using this. -> Define preference density! -> Give an intuition behind Lemma 1, and its proof to increase readability! -> I miss also intuitions behind the statement of Assumption 1 and Assumption 2. -> I also miss explanations about LICO and SOCS. -> Please, explain or give a proof sketch of Proposition 1! -> Proposition 2 falls from heaven! Provide detailed explanations! -> Surface algorithm: I miss detailed explanations around that algorithm SURFACE. How does the interpolation work? What means "in parallel"? What means MEQ?

Because of these large gaps, the paper is hardly reproducible. SO I recommend "Clear Reject"!

Questions for authors

See box above!

3 comments
AuthorsOpenReview ↗

Guide to the Paper’s Existing Explanations Addressing the Reviewer’s Concerns

We thank the reviewer for recognizing SURFACE's significance, mathematical depth, and sophisticated experiments. We respectfully disagree that its formulations and propositions “fall from heaven” or lack motivation and supporting arguments. The original paper follows a clear progression: the Introduction motivates preference-aware finite PF coverage; Section 2 derives the target weight density and establishes PF geometry; Section 3 develops the reconstruction–redistribution algorithm; and Section 4 proves convergence, with detailed proofs, implementations, and comparisons in the appendices. The requested concepts and explanations were already provided in the original submission, as located below. As a theory-oriented work combining multi-objective optimization, sensitivity analysis, and numerical analysis, we recognize the value of making concepts from several mathematical areas accessible to readers with different backgrounds. We have therefore substantially strengthened the exposition and practical guidance in the revised manuscript and respectfully invite the reviewer to revisit the original technical arguments and the revised presentation when reconsidering the assessment.

ConcernOriginal submissionRevised clarification
TS motivation and reference pointIntroduction motivates TS for nonconvex PFs and defines the componentwise lower reference z\mathbf z; Sec. 2.2 explains full-ray activity.Intro and Sec. 2.1 expand the ray geometry and epigraph form.
Why a PF distribution?Introduction states the finite preference-coverage problem; Fig. 1 illustrates weight-to-PF distortion.Intro and Figs. 1–2 sharpen the motivation.
Preference density ϑ\varthetaSec. 2.1 defines PF-area preference, including ϑ≡1\vartheta\equiv1; Assumption 3 specifies regularity.Introduced earlier in the Intro and explained further in Sec. 2.
PF-area factor J(w)J(\mathbf w)Sec. 2.1 defines the Jacobian-based area factor; Fig. 2 shows its geometric meaning.Sec. 2 and figures add geometric intuition.
Computing target densitySec. 2.1 derives ρϑ∝(ϑ∘fPF)J\rho_\vartheta\propto(\vartheta\circ\mathbf f_{\rm PF})J; App. B.1 proves the change of variables.App. A.3 specifies numerical estimation using reconstructed samples.
PF patch definitionLemma 1 explicitly defines aτ=fPF(τ)a_\tau=\mathbf f_{\rm PF}(\tau); App. A.2 records notation.Sec. 2 and figures illustrate the cell–patch map.
Lemma 1 intuition and proofSec. 2.1/Fig. 2 explain area distortion; App. B.1 gives the full area-formula proof.Sec. 2 makes the mass correspondence more explicit.
ΔM\Delta_M, Ck,1C^{k,1}, intrinsic volumeAll defined in the Introduction's Notation paragraph and App. A.2.App. A.2 clarifies the norms.
Assumptions 1–2; LICQ/SOSCSec. 2.2 states these standard sensitivity conditions and their role; App. B.3 gives sufficient regimes.Sec. 2.1 adds intuition on their theoretical role.
Assumption 3 boundsSec. 4 explicitly gives the positivity, upper bounds, smoothness, and neighborhood extension of ϑ\vartheta.App. A.3 explains evaluation on reconstructed charts.
Proposition 1Sec. 2.2 explains unique-ray injectivity directly after the proposition and cites classical TS coverage.Sec. 2.1 expands the geometric explanation.
Proposition 2Sec. 2.2 states its guarantees; App. B.2 proves sensitivity, tangent rank, and area bounds; App. B.3 verifies DTLZ2.Sec. 2.1 adds intuition; App. B.3 elaborates DTLZ2.
Algorithm and “parallel”Algorithm 1 and Sec. 3 specify independent scalarized solves and their possible concurrent execution.Sec. 3 and new App. A.3 clarify implementation.
InterpolationSec. 3 identifies local quadratically augmented RBF interpolation; App. C.1 gives its construction and analysis.App. A.3 adds an explicit local formula and procedure.
MEQSec. 3 defines equal-mass cells and transport; App. C.2 details Moser realization, accuracy, and mesh stability.Sec. 3/App. A.3 clarify steps; App. C.2 expands realizations.
Comparison to prior methodsIntroduction and App. A.1 compare adaptive scalarization, continuation, geometry, evolutionary, Pareto-set learning, and finite-design methods.Intro highlights prescribed PF-distribution matching.
ReproducibilityAlgorithm 1, Sec. 3, Apps. C.1–C.2 and E specify the workflow, methods, and experimental protocols.New App. A.3 consolidates solver interfaces and implementation choices.
AuthorsOpenReview ↗

Further Explanation: How SURFACE’s Mathematical Foundations Form a Practical Framework

Beyond the individual definitions and proofs located above, we clarify how the mathematical components form a practical optimization framework. SURFACE aims to generate a finite set of Pareto solutions whose allocation matches a prescribed preference distribution on the PF. The original Sections 2–4 systematically develop this connection from geometric motivation to adaptive redistribution and convergence guarantees.

1. Why are PF geometry and weight redistribution necessary?

Scalarization generates Pareto solutions by varying objective weights w\mathbf w, with TS supporting nonconvex PFs. However, uniform scalarization weights generally do not yield uniform PF coverage because the map w↦fPF(w)\mathbf w\mapsto\mathbf f_{\mathrm{PF}}(\mathbf w) introduces geometric distortion. Section 2 characterizes this distortion through the PF-area factor J(w)J(\mathbf w), yielding the target weight density

\vartheta(\mathbf f_{\mathrm{PF}}(\mathbf w))J(\mathbf w).$$ **This relationship follows from the standard area formula**, and Lemma 1 establishes its finite-sample interpretation: equal target mass across weight-space cells corresponds to equal preference-weighted area across their PF patches. Since the PF geometry is generally unknown, SURFACE estimates it from finitely many scalarized solutions and adapts their weights accordingly. **2. How does SURFACE implement this principle?** As detailed in **General Response G.2 at the top of this discussion page**, SURFACE combines three modular components based on established numerical techniques: - **Scalarized optimization:** Independently solve the weighted single-objective problems using an application-specific `InnerSolver`, supporting parallel execution and warm starts. SURFACE uses the returned objective vectors without differentiating through the optimizer. - **PF reconstruction and density estimation:** Interpolate sampled weight–objective pairs to obtain a smooth chart $P_t$, estimate its area factor $J_{P_t}$, and update the preference-weighted density. The theoretical analysis uses quadratically augmented RBF interpolation (Wendland, 2005) for its smoothness and approximation guarantees. - **Mass equidistribution (MEQ):** Redistribute weights so their associated cells carry approximately equal target mass. This uses inverse-CDF transport for two objectives and face-preserving Moser transport (Bruveris et al., 2018) for higher dimensions, with an additional equal-capacity power-cell realization in the revision. **These established numerical building blocks form a modular, solver-compatible framework.** SURFACE's contribution is their geometry-aware integration for prescribed PF distribution matching, together with rigorous convergence guarantees. Reconstruction and transport operate in the $(M-1)$-dimensional weight space, independently of the inner optimizer. The original Section 3 and Appendices C.1–C.2 already specify these constructions. *The revised Section 3 and new Appendix A.3 consolidate them into a practical implementation guide.* **3. How do these components support the theoretical guarantees?** The original Section 2 establishes the weight-to-PF regularity through Propositions 1–2, using classical TS coverage and parametric sensitivity analysis. Section 4 then controls **three sources of error: PF reconstruction, numerical MEQ, and inexact scalarized optimization**. RBF interpolation and Moser transport are selected for the analysis because their approximation accuracy, mass preservation, and stability properties support these bounds. Under the stated regularity and inner-solver contraction conditions, **Theorem 1 proves geometric convergence to an $O(N^{-2/(M-1)})$ finite-resolution floor**. The dominant computational work is typically the scalarized solves, which can be executed independently and in parallel. Further computational-budget and implementation details are provided in **General Responses G.1–G.2**. The original submission already establishes this progression from geometric motivation to algorithmic construction and convergence analysis. New revision further clarifies these connections while preserving the mathematical foundations. We respectfully `invite the reviewer to revisit these original technical arguments and the strengthened exposition in the revised manuscript, and to reconsider their assessment in light of these explanations`.
AuthorsOpenReview ↗

Follow-up: Summary of Responses and Revisions

We thank the reviewer again for their assessment. We have provided detailed explanations of the mathematical foundations and algorithmic constructions, together with substantial revisions to the exposition and implementation guidance, directly addressing the reviewer's principal concerns about clarity and reproducibility. As the discussion period approaches its conclusion, we respectfully invite the reviewer to revisit these improvements and reconsider their assessment.

Reviewer_UEMKOpenReview ↗
Rating
3
Confidence
2
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper proposes SURFACE, a method that adaptively adjusts scalarization weights by estimating the mapping between scalarization weights and the Pareto front, enabling the resulting Pareto solutions to follow a desired preference distribution. The authors provide a theoretical convergence analysis and demonstrate the effectiveness of the proposed method through experimental comparisons with existing baseline methods.

Critical strengths
  • The research problem is interesting and important. It addresses how to distribute a limited number of Pareto-optimal solutions along the Pareto front according to a desired preference distribution.

  • The paper provides a rigorous theoretical analysis of the proposed method, establishing convergence guarantees that further support its effectiveness and reliability.

Critical weaknesses
  • The experimental evaluation covers only six benchmark problems (ZDT1/2/4 and DTLZ2/3/4), which is insufficient to comprehensively evaluate the performance of SURFACE across diverse problem characteristics.

  • The computational efficiency of SURFACE is not sufficiently investigated. The additional overhead introduced by weight redistribution may limit its practical applicability.

Questions for authors
  • How does SURFACE perform on problems with disconnected, degenerate, or highly irregular Pareto fronts, where the theoretical assumptions may not hold?

  • Can the authors provide a sensitivity analysis of the damping parameter (α\alpha) to evaluate its impact on the convergence and performance of SURFACE?

  • Can the authors provide runtime comparisons with the baseline methods to further evaluate the computational efficiency of SURFACE?

2 comments
AuthorsOpenReview ↗

Clarification: Broader Evaluation, Efficiency, and Robustness of SURFACE

We thank the reviewer for recognizing the importance of SURFACE's preference-matching problem and its rigorous convergence analysis. We clarify that the original experiments already cover a broader range of benchmarks than the reviewer noted, and provide additional experiments addressing challenging PF geometries and computational efficiency, as detailed below.

W1 Limited Benchmark Diversity

The original submission already evaluates SURFACE beyond the six ZDT/DTLZ benchmark families mentioned in the review: Section 5.3 and Appendix E.4 include multi-objective reinforcement learning from MO-Gymnasium for Deep Sea Treasure (M=2M=2), Resource Gathering (M=3M=3), and Fruit Tree (M=6M=6). Appendix E.1 also discusses the Minecart policy environment. These experiments span different objective dimensions, multimodal optimization landscapes, and policy optimization problems. Section 5.1 and Appendix E.2 further investigate controlled geometric distortion and finite-resolution behavior. We additionally evaluate disconnected PFs on ZDT3 and DTLZ7 under uniform and nonuniform preferences. The results are included in Figure 8 of the revised manuscript, demonstrating effective preference-based redistribution across disconnected PF components. Together, these experiments support SURFACE's applicability across diverse problem settings.

W2/Q3 Computational Efficiency and Weight-Redistribution Overhead

We provide a detailed theoretical budget analysis, original Resource Gathering runtimes, and additional 100-second wall-clock comparisons in General Response G.1. The key takeaway in G.1 is, the original matched-cardinality comparison in fact favor the evolutionary baselines, giving them longer running time (SURFACE 43.56s v.s. baselines 123.55-319.38s) while under same-time budget, SURFACE achieves better preference.

Q1 Performance on Disconnected, Degenerate, or Irregular Pareto Fronts

Although SURFACE may exhibit less accurate preference matching on irregular or disconnected fronts than on fronts satisfying our theoretical assumptions, our experiments demonstrate that SURFACE remains effective on highly distorted and disconnected Pareto fronts, extending its empirical applicability beyond the regular-chart setting of our convergence theory. The original submission already examines highly distorted PF geometries in Section 5.1, where the PF distortion ratio increases to 6.58×1036.58\times10^3. SURFACE maintains a substantially lower target-mass residual than Uniform weighting throughout, showing its ability to handle severe geometric distortion. Furthermore, the revised manuscript includes additional experiments on disconnected Pareto fronts, including ZDT3 (M=2M=2) and DTLZ7 (M=2,3M=2,3), shown in Figure 8. Under uniform preferences, SURFACE distributes solutions across the disconnected PF regions, while focused preferences increase resolution in desired regions while retaining broader coverage. These results show SURFACE's empirical applicability beyond the smooth, connected PFs covered by our theoretical guarantees. A degenerate PF has intrinsic dimension below M−1M-1, for which preference matching is naturally formulated using the PF's intrinsic-dimensional geometry.

Q2. Ablation of α\alpha

Theorem 1 and Table 1 already characterize the damping–inner-accuracy tradeoff: larger α\alpha accelerates outer convergence but requires stronger inner contraction, while smaller α\alpha allows less accurate inner solves. The coupled error contracts at rate 1−α/41-\alpha/4, subject to αˉ2ηK=O(N−3/(M−1))\bar\alpha^2\eta_K=\mathcal O(N^{-3/(M-1)}), with 0<α≤αˉ<10<\alpha\leq\bar\alpha<1. We further conduct an α×K\alpha\times K ablation on a three-objective strongly convex quadratic problem, fm(x)=12∥x−cm∥2f_m(\mathbf x)=\frac12\|\mathbf x-\mathbf c_m\|^2, with c1=(0,0)\mathbf c_1=(0,0), c2=(1,0)\mathbf c_2=(1,0), and c3=(0,1)\mathbf c_3=(0,1). Weighted-sum scalarization yields x⋆(w)=(w2,w3)⊤\mathbf x^\star(\mathbf w)=(w_2,w_3)^\top, and gradient descent with stepsize 1/21/2 gives ηK=2−K\eta_K=2^{-K}. We use N=63N=63, three pinned corners, warm starts, and T=3T=3 outer rounds.

Value is target-mass residual R^ϑ\widehat{\mathcal R}_\vartheta (↓\downarrow):

α\alpha \ KK1248
0.10.2130.2160.2180.218
0.20.1280.1380.1440.146
0.50.0370.0130.0280.033
0.80.1180.0380.0040.005
1.00.1430.0370.0030.003

The results illustrate the predicted tradeoff: with K=1K=1, moderate damping α=0.5\alpha=0.5 performs best (0.03724), while stronger inner contraction at K=4K=4 supports α=0.8\alpha=0.8 and 1.01.0, achieving 0.00430 and 0.00319. Increasing KK to 8 provides little further improvement. This finite-horizon experiment includes α=1\alpha=1 as an empirical comparison.

AuthorsOpenReview ↗

Follow-up: Summary of Responses and Revisions

We thank the reviewer again for their constructive feedback. We hope our additional experiments on disconnected PFs, damping sensitivity, and computational efficiency directly address the reviewer's main concerns about robustness and practical applicability. As the discussion period concludes, we would appreciate the reviewer revisiting these results and reconsidering their assessment.

Reviewer_DoAiOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

SURFACE redistributes scalarization weights so that a finite set of Pareto solutions matches a prescribed preference density on the Pareto front, rather than an arbitrary grid on the weight simplex. From current scalarized solutions, it reconstructs a chart and an area factor, damps the implied weight density, and places the next weights by mass equidistribution: inverse-CDF transport for two objectives and Moser transport in higher dimensions.

Under regularity conditions for Tchebycheff scalarization, the paper establishes a smooth nonfolding front chart and proves geometric contraction of the coupled density-solver error down to an O(N−2/(M−1))O(N^{-2/(M-1)}) resolution floor. Empirical validation covers an analytic distorted front, ZDT/DTLZ synthetic benchmarks, and weighted-sum policy optimization on three MO-Gymnasium environments. The comparison with uniform weights uses the same inner solver, while the comparison with nine evolutionary and finite-design baselines matches the number of returned solutions rather than the total optimization budget.

Critical strengths
  1. Well-Controlled Comparison Against the Uniform Baseline: The controlled comparison with uniform weighting is the primary empirical result supporting the method. Because both SURFACE and Uniform employ the exact same underlying scalarized solver, the improvements in front allocation can be strictly attributed to the geometry-aware weight updates rather than optimizer discrepancies. On the analytic front, the exact-area reference cleanly separates chart-reconstruction error from transport error, and Figure 5 corroborates finite-resolution errors decaying at empirical rates consistent with the theoretical O(N−1)O(N^{-1}) and O(N−2/5)O(N^{-2/5}) rates for M=3M = 3 and M=6M = 6.

  2. Concrete Algorithmic Generalization Beyond 2D Arc-Length: Relative to prior work such as SURF (which is limited to uniform arc-length allocation on two-objective fronts), SURFACE generalizes the framework to arbitrary prescribed preference densities and higher-dimensional fronts via face-preserving Moser transport. The authors also candidly acknowledge the curse of dimensionality regarding the growth of NN with the number of objectives as an open limitation.

Critical weaknesses
  1. Data Duplication in Table 2 and Compromised Suite-Wide Rankings: The reported comparative ranking cannot be substantiated in its current form. In Table 2, for DTLZ4 at M=3,N=18M = 3, N = 18, the Uniform and SURFACE entries duplicate the preceding DTLZ3 row across all eight printed digits: Uniform is 1.078 / 0.132 / 0.265 / 0.175 and SURFACE is 0.693 / 0.129 / 0.227 / 0.162 across R^ϑ\hat{R}_\vartheta, IGD, Fill, and ΔHV\Delta\text{HV}. While the evolutionary baseline columns change on DTLZ4, the two deterministic scalarization columns were evidently carried over without execution. The appendix also repeats these values. Because DTLZ4 features a severely biased parameterization designed to test non-uniform distortion, this missing result directly affects Figure 6 and Table 5, meaning the claimed "best coverage rank across the suite" is unverified.

  2. Incomparable Optimization Budgets and Theoretical Condition Disconnect:

  • Disproportionate Baseline Budgets: The comparison with evolutionary algorithms matches only the returned cardinality N+MN + M. However, SURFACE executes repeated outer rounds (e.g., 30 outer rounds on Deep Sea Treasure and Resource Gathering, 10 on Fruit Tree), with full scalarized solves per round, while evolutionary baselines are run end-to-end. On Resource Gathering, SURFACE and Uniform attain a hypervolume of only 0.114, whereas SMS-EMOA, NSGA-III, and MOEA/D achieve 0.81-1.17. Reporting better area residual on a severely compromised hypervolume does not support the claim of consistently superior performance over all nine baselines.
  • Misaligned Verification of Theorem 1: Theorem 1 requires N1/(M−1)=Ω(κϑ3/2)N^{1/(M-1)} = \Omega(\kappa_\vartheta^{3/2}) before the asymptotic floor decouples from the condition number. In Figure 4, the authors claim to verify this independence by sweeping the distortion ratio up to 6.58×1036.58 \times 10^3 while keeping N=63N = 63 fixed, without verifying whether N=63N = 63 actually satisfies the theoretical threshold Ω(κϑ3/2)\Omega(\kappa_\vartheta^{3/2}).
Questions for authors
  1. Clarification on DTLZ4 Results: Were the Uniform and SURFACE outputs for DTLZ4 (M=3,N=18M = 3, N = 18) mistakenly copied from the DTLZ3 run? Please provide the corrected raw values from new runs and clarify whether the mean ranks in Table 5 and Figure 6 change after recomputation.
  2. Computational Budget Accounting: For the ZDT/DTLZ benchmarks, what is the exact number of scalarized solves (or total objective function evaluations) consumed by SURFACE across all outer rounds, compared to the function evaluation budgets of NSGA-III, SMS-EMOA, and MOEA/D?
  3. Theoretical Condition in Figure 4: What is the exact value of the condition number κϑ\kappa_\vartheta at each sampled κ\kappa in Figure 4, and does the fixed budget N=63N = 63 strictly satisfy the condition N1/(M−1)=Ω(κϑ3/2)N^{1/(M-1)} = \Omega(\kappa_\vartheta^{3/2}) required by Theorem 1?
  4. Target-Mass Residual Evaluation: Is the reported metric R^ϑ\hat{R}_\vartheta evaluated against the analytical ground-truth front geometry, or is it computed using the reconstructed chart PtP_t produced by SURFACE? If the latter, how is circular evaluation avoided?
3 comments
AuthorsOpenReview ↗

Clarification: Addressing Misunderstandings of SURFACE's Experimental Results and Theoretical Guarantees

We thank the reviewer for recognizing SURFACE's well-controlled Uniform comparison and its generalization beyond two-objective arc-length allocation. We clarify that several concerns arise from misunderstandings of our experimental results and theoretical guarantees.

W1/Q1 Same Uniform/SURFACE data for DTLZ3/4 and their effect on Tab. 5 and Fig. 6

The "identical results" is NOT duplicated records but from the shared PF geometry. DTLZ2/3/4 have the same positive-orthant unit-sphere Pareto front, despite having different decision-space landscapes. Under our Tchebycheff scalarization, they gave fPF(w)=w/∥w∥2f_{\mathrm{PF}}(w)=w/\|w\|_2. As in the supplementary (surface/solvers/), Uniform and SURFACE deterministically attain global solutions, yielding identical objective-space points and metrics. In contrast, other baselines involve stochasticity (e.g., training auxiliary models), leading to varying results. In fact, "duplicate numbers" show the consistency of SURFACE's geometry-based allocation across benchmarks and Tab. 5 and Fig. 6 report results from these distinct benchmark tasks.

W2/Q2 Optimization Budgets and Hypervolume

We provide a detailed theoretical budget analysis, wall-clock runtimes, and additional time-budget experiments in General Response G.1. The key takeaway is, the original matched-cardinality comparison in fact favor the evolutionary baselines, giving them longer running time (43.56s v.s. 123.55-319.38s) while under same-time budget, SURFACE achieves better preference. For higher evolutionary HV values in Resource Gathering, The original experiments favored the evolutionary baselines in two respects: they has longer runtimes and optimized their native objectives without the KL regularization used by SURFACE, favoring their performance on unregularized HV. Our additional experiments align the KL-regularized objectives across methods and evaluate all solutions using the same unregularized environment returns. Under this aligned comparison in G.1, SURFACE achieves higher HV than all evolutionary baselines.

W3/Q3. Figure 4's N=63N=63 Threshold

We first clarifty the claim of Thm. 1 and the experimental purpose of Sec. 5.1. Requirement N=Ω(κϑ3(M−1)/2)N=\Omega(\kappa_\vartheta^{3(M-1)/2}) in Thm. 1 is an asymptotic sufficient condition, not a necessary condition for SURFACE to operate. Once this threshold and the other assumptions hold, Thm. 1 guarantees linear convergence to O(N−2/(M−1))=CN−2/(M−1)\mathcal O(N^{-2/(M-1)})=CN^{-2/(M-1)} error floor, where C=O(1)C=\mathcal O(1) is bounded independently of κϑ\kappa_\vartheta (lines 334–335). Fig. 4 is to examine the C=O(1)C=\mathcal O(1) claim: Uniform weighting exhibits increasing target-mass residuals, whereas SURFACE maintains a residual below 0.970.97 throughout, even as distortion reaches 6.58×1036.58\times10^3. Fig. 5 further shows error decay consistent with the predicted N−2/(M−1)N^{-2/(M-1)} rate.

Sec. 4 defines κϑ=ϑ‾J‾/(ϑ‾J‾)\kappa_\vartheta=\overline\vartheta\overline J/(\underline\vartheta\underline J). Fig. 4 uses ϑ=1\vartheta=1, so κϑ(κ)=e4κ/31+8κ3+8κ23\kappa_\vartheta(\kappa)=e^{4\kappa/3}\sqrt{1+\frac{8\kappa}{3}+\frac{8\kappa^2}{3}}. For M=3M=3, the sufficient condition becomes N=Ω(κϑ3)N=\Omega(\kappa_\vartheta^3). We do not claim that N=63N=63 satisfies this sufficient threshold across all distortion. Rather, the results show that SURFACE maintains effective beyond the sufficient condition. For the reviewer's concern on sharpness of the N=Ω(κϑ3(M−1)/2)N=\Omega(\kappa_\vartheta^{3(M-1)/2}), we illustrate via example: For M=2M=2 PF fPF(w)=(3w,3−3w)f_{\mathrm{PF}}(w)=(3w,3-3w), w∈[1/3,2/3]w\in[1/3,2/3], with preference ϑϵ(u)=u2+ϵ\vartheta_\epsilon(u)=u^2+\epsilon, where u=3w−1u=3w-1. Then κϑ=(1+ϵ)/ϵ\kappa_\vartheta=(1+\epsilon)/\epsilon and the MEQ transport (App. C.2) can use Tϵ=Fϵ−1T_\epsilon=F_\epsilon^{-1}, where Fϵ(u)=u3/3+ϵu1/3+ϵF_\epsilon(u)=\frac{u^3/3+\epsilon u}{1/3+\epsilon}, requiring the first straight-mesh segment to approximate Tϵ′(0)T_\epsilon'(0) within a factor of two necessarily gives $N\geq\frac{1/3+\epsilon}{2\sqrt3,\epsilon^{3/2}} =\Omega(\kappa_\vartheta^\frac{3(M-1)}{2})$ with M=2M=2.

Q4 Target-Mass Residual Evaluation and Circularity

The cross-method comparisons has NO circularity. As in Lemma 1 and App. B.1, R^ϑ\hat{R}_\vartheta can be equivalently expressed via the preference-weighted PF area. For benchmarks with analytically known PFs (Sec.5.1-5.2), we use the ground-truth PF geometry and area density (App. E.1). For MO-Gymnasium tasks, we use independently constructed PF-area-weighted reference samples and Voronoi assignments, where each reference sample is assigned to its nearest returned Pareto solution, and the accumulated preference-weighted mass measures that solution's coverage (App.E.4). These procedures are implemented in the supplementary code (surface/evaluation/). Thus, all methods are evaluated against the same independently constructed reference within each benchmark, ensuring fair and consistent comparisons. The constructed PtP_t in SURFACE is not used for comparative performance.

AuthorsOpenReview ↗

Follow-up: Summary of Responses and Revisions

We thank the reviewer again for their careful assessment. As the discussion period approaches its conclusion, we hope our clarification of the identical DTLZ3/4 results through shared PF geometry, together with the additional budget-matched experiments, addresses the concerns regarding experimental validity and computational fairness. We would sincerely appreciate the reviewer's reconsideration of our responses and updated manuscript.

Reviewer_2y1GOpenReview ↗

Still weak reject!

Many thanks for your clarifications! Due to the detailed explanations, and the fact that I am not from this research area, I can increase my score to weak reject. But still, I recommend polishing and rewriting the paper carefully, and submitting to a different venue!

Comments on the paper

2 comments
AuthorsOpenReview ↗

General Response G.1

We thank all reviewers for their careful assessments, constructive feedback, and recognition of SURFACE's contributions. We have provided a revised manuscript with substantially improved clarity, theoretical exposition, and practical implementation guidance. Below, we provide shared clarifications on computational efficiency, benchmark fairness, algorithmic implementation, and reproducibility before addressing the individual reviews. Unless explicitly marked as revised, references to sections, figures, tables, equations, and propositions throughout our responses refer to the original submission.

General Resposne G.1: Computational Efficiency and Budget-Matched Comparisons

We first clarify SURFACE's theoretical computational budget and weight-redistribution overhead, then present runtime comparisons from our experiments. We additionally conducted time-budget-matched comparisons, providing further evidence of SURFACE's computational efficiency and preference-matching performance.

Theoretical computational budget. As discussed in Sections 3 and 4 (Theorem 1 and Table 1), Uniform weighting allocates KTKT optimization steps to each fixed weight, while SURFACE performs KK steps per weight over TT outer rounds. SURFACE additionally performs PF interpolation and MEQ in the (M−1)(M-1)-dimensional weight space, where typically M≪nM\ll n, with relatively small overhead per outer round. In General Response G.2 below, we provide an additional illustration for M=3M=3 LLM alignment on the Reddit summarization task, where our experiments require only 2.69 s per round for PF interpolation and MEQ, compared with an average of 489.4 s for a 64-update run of the InnerSolver using Proximal Policy Optimization (PPO) on an A100 GPU. Since Theorem 1 establishes geometric outer convergence, the computational cost is typically dominated by the (N+M)KT(N+M)KT inner updates. This makes matching the total inner-solver budget through KTKT steps for Uniform and KK steps over TT rounds for SURFACE a natural comparison. For the other baselines, matching computational budgets is more challenging due to differences in optimization procedures, such as population-based search and auxiliary neural-network training in UMOD, which incur different computational and data-exposure costs. Thus, the original submission matches returned solution cardinality for consistent PF representation comparisons, and we further assess computational fairness through additional wall-clock comparisons.

Experimental budgets. As described in Sections 5.2–5.3 and Appendix E.4, all methods return the same number of solutions. For ZDT/DTLZ, the synthetic InnerSolver evaluates analytical global PF solutions, so repeated SURFACE calls involve closed-form evaluations rather than iterative optimization, while evolutionary baselines use evaluation-budgeted search. In the MO-Gym experiments, SURFACE and Uniform use a deterministic, high-accuracy soft-value solver, requiring no gradient backpropagation. Thus, SURFACE's additional computational work primarily comes from PF reconstruction and MEQ, alongside repeated scalarized solves. On the same NVIDIA H100 GPU, the recorded Resource Gathering runtimes are 43.56 s for SURFACE, compared with 123.55 s for MOEA/D, 171.56 s for NSGA-III, and 319.38 s for SMS-EMOA (artifacts/mogym/seed7_metrics.csv in the supplementary material). Hence, the existing full-budget comparison allows substantially longer execution times for these evolutionary baselines, while SURFACE completes its preference redistribution more efficiently.

Additional time-budget-matched comparison. To assess computational fairness, we conducted a Resource Gathering (M=3M=3) experiment on an NVIDIA A100 GPU under a common 100-second wall-clock budget, aligning the KL-regularized objectives across methods and evaluating unregularized returns.

MethodR^ϑ\widehat{\mathcal R}_\vartheta ↓IGD$_{\rm area}$ ↓HV ↑
SURFACE0.7960.08260.1139
Uniform1.1150.09450.1138
MOEA/D17.48 ± 3.51.437 ± 0.0050.0111 ± 0.0001
NSGA-III20.00 ± 01.440 ± 0.0030.0110 ± 0.00002
SMS-EMOA20.00 ± 01.421 ± 0.0160.0113 ± 0.0003
MOEA/D-AWA20.00 ± 01.444 ± 0.0020.0110 ± 0.00001
UMOD18.95 ± 2.31.446 ± 0.0010.0110 ± 0.00001

Results are reported as mean ± standard deviation over five seeds for stochastic methods.

SURFACE achieves the best preference matching, IGD, and HV within the common budget. In contrast, the baselines showed further progress only in longer runs of 185–786 seconds. We will incorporate the computational accounting and additional runtime comparisons into the revised Appendix E.

AuthorsOpenReview ↗

General Response G.2

General Resposne G.2: SURFACE Algorithm, PF Reconstruction, and Practical Reproducibility

Algorithm 1 and Section 3 present the SURFACE framework, with PF interpolation and MEQ details in Appendices C.1 and C.2. Each SURFACE outer iteration consists of four steps: (i) update the NN scalarized problems at the current weights using InnerSolver, with warm starts from the preceding round; (ii) reconstruct a smooth PF chart PtP_t by interpolating the returned weight–objective pairs from (i) (Appendix C.1); (iii) estimate the PF-area factor JPt(w)=1Mdet⁡(DPt(w)⊤DPt(w))J_{P_t}(\mathbf w)=\frac{1}{\sqrt M}\sqrt{\det(DP_t(\mathbf w)^\top DP_t(\mathbf w))} and update the preference-weighted density with damping α\alpha; and (iv) redistribute the weights through mass equidistribution (MEQ) (Appendix C.2).

Specifically, step (i) can accommodate different inner solvers for different types of objectives, e.g., Adam for differentiable objectives and policy-update methods for reinforcement learning. The implementation of (ii) is detailed in Section 3 and Appendix C.1: SURFACE conducts smooth interpolation using an off-the-shelf method to construct Pt:ΔM→RMP_t:\Delta_M\rightarrow \mathbb{R}^M from the sampled pairs and corner points from (i). In Appendix C.1, the specific method used for our analysis consists of local RBF models augmented with quadratic polynomials on overlapping patches, combined smoothly using a partition of unity. This is a standard scattered-data interpolation technique described in Wendland (2005, §9.4 for compactly supported kernels, §§11.2–11.3 for approximation estimates, and particularly §15.4 for partition-of-unity interpolation). Smooth interpolation provides the differentiability of PtP_t required for the PF-area estimation in (iii). The implementation of (iv) is detailed in Appendix C.2, using inverse-CDF transport for M=2M=2 and multidimensional transport for M≥3M\geq3.

This separation makes SURFACE an engineering-friendly framework compatible with different encapsulated inner solvers. Section 3 permits both exact and inexact optimization, including gradient descent or Adam (Kingma & Ba, 2015) for differentiable objectives and PPO (Schulman et al., 2017) or GRPO (Shao et al., 2024) for scalarized reinforcement-learning rewards. Appendix E further demonstrates different solving procedures, including warm-started gradient descent for the controlled quadratic experiment, KL-regularized soft-value iteration for Deep Sea Treasure, Resource Gathering, and Fruit Tree, and weight-conditioned GPI-LS policy selection for Minecart. SURFACE only requires scalarization weights, returned objective values, and optional solver states for warm starts, without differentiating through the inner solver. The supplementary code follows this modular design, with a common solver interface (surface/api/solver.py), separate implementations for scalarized optimization (surface/solvers/), PF reconstruction (surface/geometry/), and MEQ (surface/transport/), together with experimental configurations and regression tests. We also added Appendix A.3, Practical Implementation of SURFACE, detailing initialization, interpolation, density estimation, weight redistribution, and computational accounting. These components allow existing optimization procedures to be integrated while keeping the geometric redistribution mechanism unchanged.

SURFACE's computational cost consists of the inner optimization of the scalarized subproblems in (i) and the per-outer-iteration overhead of (ii) interpolation and (iv) MEQ, both of which operate in the (M−1)(M-1)-dimensional weight space. Typically, M≪nM\ll n, even when x∈Rn\mathbf x\in\mathbb{R}^n is high-dimensional, making the additional overhead relatively small. During the rebuttal period, we consider M=3M=3 PEFT-based LLM alignment on Reddit summarization (Stiennon et al., 2020), with summary quality, verbosity, and factual faithfulness as objectives, following RACO (Chen et al., ICML 2026). Using PPO as the encapsulated InnerSolver, the saved NVIDIA A100 training logs report an average of 489.4 seconds for one 64-update adapter-training job at a scalarization weight. Separately, our M=3M=3 SURFACE computational profile estimates approximately 0.83 seconds for PF interpolation and density formation and 1.86 seconds for MEQ transport per outer round, totaling 2.69 seconds per round, or 81 seconds over 30 rounds. These component-level timings illustrate the relatively small geometric overhead compared with expensive LLM inner training, while the corresponding operations remain confined to the two-dimensional weight simplex.

Together, these results highlight SURFACE's modular solver integration, accurate PF interpolation, and efficient low-dimensional weight redistribution, supporting practical implementation across diverse optimization and learning applications.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.