cs.LGJul 16, 2026

Regularity-Aware Stochastic MGDA with Adaptive Per-Iterate Conflict-Avoidant Update

Authors: Chentong Huang, Lisha Chen

Organizations: Dept. of Electrical and Computer Engineering, University of Rochester, Rochester, NY 14627

Abstract

Multi-objective learning (MOL) aims to optimize multiple objectives simultaneously. The multi-gradient descent algorithm (MGDA) constructs a common descent or conflict-avoidant (CA) direction by solving a gradient-aggregation subproblem. In stochastic settings, the vanilla stochastic MGDA method, SMG, replaces full-batch gradients with mini-batch estimates, causing bias in the resulting CA direction. Existing analyses control this error using continuity of the CA-direction mapping, but do not distinguish how its sensitivity varies with the geometry of the MGDA subproblem. Motivated by this limitation, we show that the MGDA direction map is Lipschitz continuous under reduced nondegeneracy, whereas its general 1/21/2-Hölder exponent on bounded sets is sharp. This geometry motivates the Multi-objective Regularity-aware (MoRe) method, which retains adaptive MGDA aggregation in the regular regime and switches to a fixed-weight linear scalarization (LS) near degeneracy. The fallback branch skips the MGDA subproblem solve, which can reduce aggregation cost on fallback iterations while avoiding a potentially noise-sensitive update. Theoretically, we establish a per-iterate CA guarantee, and a O~(T−1)\widetilde{\mathcal O}(T^{-1}) convergence rate, improving upon the previously established O~(T−1/4)\widetilde{\mathcal O}(T^{-1/4}) SMG guarantee, where O~\widetilde{\mathcal O} hides logarithmic factors. Experiments demonstrate favorable multi-task performance and convergence behavior consistent with the theoretical rate.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

May 28, 2026

A Unified Framework for Gradient Aggregation in Multi-Objective Optimization

Many machine learning problems involve multiple inherent trade-offs that are best addressed by gradient-based multi-objective optimization (MOO) algorithms. Existing methods are often proposed with various motivations, analyzed case by case, and differ algorithmically in how the component gradients are aggregated at each step. In this work, we develop a unifying framework for gradient aggregation in MOO, establishing (optimal) rates of convergence to Pareto stationarity, the standard measure of performance in MOO. Central to our analysis is a sufficient alignment condition, from which we derive a theorem showing that non-conflicting directions, when chosen within the convex hull of gradients, form a fundamental sufficient condition for convergence. We further show that feasibility can be ensured through projection onto the dual cone, broadening the scope of methods that admit convergence guarantees. In parallel, we present a primal optimization perspective of gradient aggregation that encompasses established algorithms, clarifies their theoretical relationships, and enables the design of new variants. As an illustration, we introduce capped MGDA, derived from a CVaR-based formulation, and demonstrate its robustness in adversarial federated learning. Finally, we validate our theory through experiments on synthetic problems and practical benchmarks.
Oct 9, 2026

Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates

Multiple-gradient descent is typically formulated in Euclidean geometry, whereas matrix-aware optimizers use directions induced by other norms. We analyze a single-loop multi-objective method combining a norm-constrained linear minimization oracle with entropic updates of task weights. For any finite-dimensional norm pair, we establish an O(T−1/2)O(T^{-1/2}) ergodic stationarity rate in the deterministic setting, deriving the required trajectory gradient bound from smoothness and lower-boundedness in the unregularized case. With stochastic gradients and a bounded-gradient assumption, one persistent blended-gradient momentum buffer yields an O(T−1/4)O(T^{-1/4}) rate whose leading term has no explicit dependence on the number of tasks. We also establish static regret for the inner weighting objective on arbitrary bounded gradient sequences and, with entropy regularization and a weight floor, iteration-wise inner-gap control after burn-in while retaining ergodic stationarity, conditional on a trajectory gradient bound. The optimal blended gradient can be nonunique in spectral and sign geometries, motivating a selection-independent inner gap. Our analysis extends the spectral construction studied by concurrent MOON to general norms. Experiments compare the method with existing multi-task optimizers and examine its oracle, weighting, and momentum choices.
May 7, 2026

From Dual Tracking to Clipping: Provably Faster Distributionally Robust Multi-Objective Optimization

Multi-objective optimization (MOO) has received growing attention in applications that require learning under multiple criteria. However, most existing MOO formulations do not explicitly account for distributional shifts in the data. We introduce distributionally robust multi-objective optimization (DR-MOO), which minimizes multiple objectives under their respective worst-case distributions. We propose Pareto-type solution concepts for DR-MOO and develop multi-gradient descent algorithms (MGDA) with provable guarantees. Leveraging a Lagrangian dual reformulation, we first design a double-loop MGDA that uses an inner loop to estimate dual variables and achieves a total sample complexity O(ε−8)\mathcal{O}(ε^{-8}) for reaching an εε-Pareto-stationary point. To further improve convergence, we combine large-batch sampling with gradient clipping to accommodate generalized smoothness and control bias in stochastic preference updates, eliminating the need for double sampling. This yields a single-loop double-clip MGDA with substantially improved sample complexity O(ε−4)\mathcal{O}(ε^{-4}). Our theory applies to nonconvex problems without requiring uniformly bounded gradients of the dual objectives. Experiments demonstrate that our methods are competitive with state-of-the-art MGDA baselines.