A Decoupled Basis-Vector-Driven Generative Framework for Dynamic Multi-Objective Optimization

arXiv cs.LG / 4/2/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper introduces DB-GEN, a decoupled basis-vector-driven generative framework for dynamic multi-objective optimization that targets moving Pareto fronts under continual environmental changes.
  • It addresses non-linear coupling of dynamic modes by using a discrete wavelet transform to separate low-frequency evolutionary trends from high-frequency details.
  • To reduce negative transfer from outdated data, DB-GEN learns transferable basis vectors through sparse dictionary learning rather than memorizing historical instances.
  • It builds a structured latent manifold using topology-aware contrastive constraints on recomposed bases, and mitigates cold-start during switches via surrogate-assisted search that samples from this manifold.
  • Pre-trained on 120 million solutions, the method performs zero-shot online inference without retraining or fine-tuning, achieving millisecond generation with about 0.2 seconds per environmental change and improved Pareto-front tracking accuracy on dynamic benchmarks.

Abstract

Dynamic multi-objective optimization requires continuous tracking of moving Pareto fronts. Existing methods struggle with irregular mutations and data sparsity, primarily facing three challenges: the non-linear coupling of dynamic modes, negative transfer from outdated historical data, and the cold-start problem during environmental switches. To address these issues, this paper proposes a decoupled basis-vector-driven generative framework (DB-GEN). First, to resolve non-linear coupling, the framework employs the discrete wavelet transform to separate evolutionary trajectories into low-frequency trends and high-frequency details. Second, to mitigate negative transfer, it learns transferable basis vectors via sparse dictionary learning rather than directly memorizing historical instances. Recomposing these bases under a topology-aware contrastive constraint constructs a structured latent manifold. Finally, to overcome the cold-start problem, a surrogate-assisted search paradigm samples initial populations from this manifold. Pre-trained on 120 million solutions, DB-GEN performs direct online inference without retraining or fine-tuning. This zero-shot generation process executes in milliseconds, requiring approximately 0.2 seconds per environmental change. Experimental results demonstrate that DB-GEN improves tracking accuracy across various dynamic benchmarks compared to existing algorithms.