Dynamic Multi-Objective Optimization Problems
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Benchmarking Continuous Dynamic Multi-Objective Optimization: Survey and Generalized Test Suite
Announce Type: replace Abstract: The field of Dynamic Multi-Objective Optimization (DMOO) has witnessed a surge of interest from both academia and industry, as numerous time-evolving real-world applications can be naturally formulated as Dynamic Multi-Objective Optimization Problems (DMOPs). This growing demand thus necessitates advanced benchmarks to rigorously evaluate optimization algorithms under realistic conditions. This paper introduces a comprehensive and principled framework for...
Multi-Objective Preference Optimization: Improving Human Alignment of Generative Models
Announce Type: replace Abstract: Post-training LLMs with RLHF and preference optimization methods (e.g., DPO, IPO) has greatly improved alignment, yet these approaches assume a single objective. In reality, humans express multiple, often conflicting objectives, such as helpfulness and harmlessness, with no natural scalarization. We study the multi-objective preference alignment problem, where a policy must balance several objectives simultaneously.
FIRM: Federated In-client Regularized Multi-objective Alignment for Large Language Models
Announce Type: replace Abstract: Aligning Large Language Models (LLMs) with human values often involves balancing multiple, conflicting objectives such as helpfulness and harmlessness. Training these models is computationally intensive, and centralizing the process raises significant data privacy concerns. Federated Learning (FL) offers a compelling alternative, but existing Federated Multi-Objective Optimization (FMOO) methods face severe communication bottlenecks as their reliance on...
Speeding Up the NSGA-II via Dynamic Population Sizes
Announce Type: replace Abstract: Multi-objective evolutionary algorithms (MOEAs) are among the most widely and successfully applied optimizers for multi-objective problems. However, to store many optimal trade-offs (the Pareto optima) simultaneously, MOEAs are typically run with a large population of solution candidates. This slows down the algorithm and renders the choice of the population size a crucial design decision.
Speeding Up the NSGA-II via Dynamic Population Sizes
arXiv:2509.01739v3 Announce Type: replace Abstract: Multi-objective evolutionary algorithms (MOEAs) are among the most widely and successfully applied optimizers for multi-objective problems. However, to store many optimal trade-offs (the Pareto optima) simultaneously, MOEAs are typically run with a large population of solution candidates. This slows down the algorithm and renders the choice of the population size a crucial design decision.