The main weaknesses concern empirical support, technical novelty, the interpretation of the complexity comparison, and the scope of the robustness guarantees.
-
Insufficient empirical evidence. Neither the main paper nor the supplementary material provides experiments, although the conclusion claims validation through adversarial-attack experiments. Consequently, the submission does not establish whether Wasserstein DRMOO offers meaningful benefits over existing f-divergence DRMOO formulations, or whether its theoretical sample-complexity advantage translates into practical efficiency. The authors should report convergence against iterations, fresh sample draws, or iteration-wise wall-clock time (as Yang et al. [1] did). Robustness comparisons with f-divergence DRMOO across multiple datasets, under comparable tuning and computational budgets, are particularly important for supporting the motivation for changing the uncertainty model.
-
The technical contribution beyond existing methods is insufficiently distinguished. Objective-wise distributional robustness and MGDA-based optimization have already been studied in Yang et al. [1], while the independent cross-Gram estimator, regularized simplex update, and generalized-smooth MGDA analysis build on earlier work such as Zhang et al. [2]. The sample-wise Wasserstein adversarial formulation and its strongly concave inner optimization are also established techniques [3]. Extending these ingredients to Wasserstein DR-MOO is fine, but the manuscript should identify the new analytical obstacles and explain how its treatment goes beyond combining existing components. The current presentation does not convincingly establish a substantial methodological advance.
-
The complexity comparison involves different problem structures and oracle assumptions. The proposed method solves a deterministic adversarial subproblem conditional on each sampled data point, with uniform strong concavity assumption. In contrast, the double-loop f-divergence method in [1] solves an expected objective that is convex in its dual variable using stochastic gradients, without a corresponding uniform strong-convexity assumption. Thus, the difference in inner-loop complexity cannot be attributed solely to an improved multi-objective algorithm. Strong convexity alone would also not guarantee logarithmic sample complexity for a noisy stochastic inner solver. The authors should distinguish the benefits arising from Wasserstein’s sample-wise reformulation and imposed structure from those arising from their algorithm.
-
The inner-loop efficiency claim needs a more explicit characterization of computational cost and conditioning. Lemmas A.5–A.7 provide finite-K approximation bounds, but K=Θ(log(1/ϵ)) suppresses important dependence on the inner condition number and initialization bound. For a standard ascent step size, achieving squared inner-solution error at most r2 requires a bound of the form
$
K=O\left(
\frac{\gamma+L_w}{\gamma-L_w}
\log\frac{C_h}{r^2}
\right).
$
This dependence can become substantial as γ approaches Lw. Moreover, although sample reuse permits the stated fresh-sample complexity, the gradient-evaluation cost includes K inner steps per objective and outer iteration. The authors should distinguish these resource measures, expose the dependence on conditioning and Ch, and discuss the restriction imposed by γ>Lw. Ablations over inner-step would help establish when the claimed efficiency advantage is practically meaningful.
-
The robustness discussion should distinguish inner optimization accuracy, population stationarity, and generalization. Solving the adversarial problem accurately for a sampled data approximates hi∗(x,w); it does not imply that this individual sample loss is close to the population objective Hi(x)=EPi[hi∗(x,W)]. The stochastic optimization argument instead relies on sampling from Pi and controlling robust-gradient noise under the stated moment assumptions. The authors should clarify whether Pi represents a population distribution or an empirical training distribution. If the implementation samples from a fixed dataset, the optimization guarantee targets the corresponding empirical robust objective and does not establish robustness on an unseen population (In that case, generalization error analysis between finite-sample and expected objective is required). Broader claims about out-of-sample robustness therefore require empirical support or a separate statistical analysis.
-
The stochastic assumptions require stronger justification and qualification in the comparison with prior work. Assumption 3 imposes a uniform fourth-moment bound on the centered gradients of the exact robust objectives, which also implies uniformly bounded gradient variance. In related nonconvex DRO analyses, Jin et al. [4] derive generalized smoothness together with an affine gradient-variance bound, while Zhang et al. [5] establish a more precise partially generalized smoothness and partially affine-variance characterization. These analyses accommodate gradient-dependent noise, and Jin et al. provide an example where the DRO dual gradient variance is globally unbounded. The present uniform fourth-moment assumption therefore places a substantive restriction on the stochastic regimes covered by the analysis. Although these works studied different DRO reformulations and gradient oracles, the authors should explicitly compare their assumptions, provide sufficient conditions on the losses, nominal distributions, and transport cost that ensure Assumption 3, and discuss whether their analysis can accommodate gradient-dependent noise. This distinction should also be reflected in the claimed complexity advantages.
References:
[1] Yang et al., From Dual Tracking to Clipping: Provably Faster Distributionally Robust Multi-Objective Optimization.
https://arxiv.org/abs/2605.05660
[2] Zhang et al., MGDA Converges under Generalized Smoothness, Provably.
https://arxiv.org/abs/2405.19440
[3] Sinha et al., Certifying Some Distributional Robustness with Principled Adversarial Training.
https://arxiv.org/abs/1710.10571
[4] Jin et al., Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis, NeurIPS 2021.
https://arxiv.org/abs/2110.12459
[5] Zhang et al., Revisiting Large-Scale Non-convex Distributionally Robust Optimization, ICLR 2025.
https://openreview.net/forum?id=JYwVijuNA7