Automatic Construction of Parallel Algorithm Portfolios for Multi-objective Optimization

• URL: http://arxiv.org/abs/2211.09498v3
• Date: Wed, 7 Jun 2023 00:58:19 GMT
• Title: Automatic Construction of Parallel Algorithm Portfolios for Multi-objective Optimization
• Abstract summary: We advocate using the Parallel Portfolio Algorithm (PAP), which runs multiple MOEAs independently in parallel and gets the best out of them. Since the manual construction of PAPs is non-trivial and tedious, we propose to automatically construct high-performance PAPs. We show that the automatically constructed MOEAs/PAP can even rival the state-of-the-art ensemble MOEAs designed by human experts.
• Score: 2.9649783577150837
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It has been widely observed that there exists no universal best Multi-objective Evolutionary Algorithm (MOEA) dominating all other MOEAs on all possible Multi-objective Optimization Problems (MOPs). In this work, we advocate using the Parallel Algorithm Portfolio (PAP), which runs multiple MOEAs independently in parallel and gets the best out of them, to combine the advantages of different MOEAs. Since the manual construction of PAPs is non-trivial and tedious, we propose to automatically construct high-performance PAPs for solving MOPs. Specifically, we first propose a variant of PAPs, namely MOEAs/PAP, which can better determine the output solution set for MOPs than conventional PAPs. Then, we present an automatic construction approach for MOEAs/PAP with a novel performance metric for evaluating the performance of MOEAs across multiple MOPs. Finally, we use the proposed approach to construct a MOEAs/PAP based on a training set of MOPs and an algorithm configuration space defined by several variants of NSGA-II. Experimental results show that the automatically constructed MOEAs/PAP can even rival the state-of-the-art ensemble MOEAs designed by human experts, demonstrating the huge potential of automatic construction of PAPs in multi-objective optimization.

Related papers

• General-Purpose Co-Evolutionary Construction of Parallel Algorithm Portfolios for Multi-Objective Binary Optimization [23.8937164783691]
  This paper proposes a domain-agnostic co-evolution of parameterized search for multi-objective binary optimization(DACMO)<n>First, we propose a neural instance representation architecture that decouples domain-invariant and instance-specific features.<n>Second, we introduce LLM-based automatic search operator generation into PAP construction, extending the search space from parameter tuning to operator-level algorithm design.
  arXiv  Detail & Related papers  (2026-05-15T08:32:47Z)
• MOA: Multi-Objective Alignment for Role-Playing Agents [68.67837397211903]
  We present MOA, a reinforcement-learning framework that enables multi-dimensional, fine-grained rubric optimization for general RPAs.<n>To address the issues of model output diversity and quality, we have also employed thought-augmented rollout with off-policy guidance.<n>This demonstrates the great potential of MOA in building RPAs that can simultaneously meet the demands of role knowledge, persona style, diverse scenarios, and complex multi-turn conversations.
  arXiv  Detail & Related papers  (2025-12-10T15:35:11Z)
• Parametric Pareto Set Learning for Expensive Multi-Objective Optimization [16.780031024741223]
  Parametric multi-objective optimization (PMO) addresses the challenge of solving an infinite family of multi-objective optimization problems.<n>Traditional methods require re-execution for each parameter configuration, leading to prohibitive costs when objective evaluations are computationally expensive.
  arXiv  Detail & Related papers  (2025-11-08T03:05:28Z)
• LLM4CMO: Large Language Model-aided Algorithm Design for Constrained Multiobjective Optimization [54.35609820607923]
  Large language models (LLMs) offer new opportunities for assisting with algorithm design.<n>We propose LLM4CMO, a novel CMOEA based on a dual-population, two-stage framework.<n>LLMs can serve as efficient co-designers in the development of complex evolutionary optimization algorithms.
  arXiv  Detail & Related papers  (2025-08-16T02:00:57Z)
• Pareto Multi-Objective Alignment for Language Models [7.9051473654430655]
  Large language models (LLMs) are increasingly deployed in real-world applications that require careful balancing of multiple, often conflicting, objectives.<n>We propose a principled and computationally efficient algorithm designed explicitly for multi-objective alignment (MOA) in LLMs.<n>PAMA transforms multi-objective RLHF into a convex optimization with a closed-form solution, significantly enhancing scalability.
  arXiv  Detail & Related papers  (2025-08-11T08:54:14Z)
• Self-Improvement Towards Pareto Optimality: Mitigating Preference Conflicts in Multi-Objective Alignment [74.25832963097658]
  Multi-Objective Alignment (MOA) aims to align responses with multiple human preference objectives. We find that DPO-based MOA approaches suffer from widespread preference conflicts in the data.
  arXiv  Detail & Related papers  (2025-02-20T08:27:00Z)
• EPS-MoE: Expert Pipeline Scheduler for Cost-Efficient MoE Inference [49.94169109038806]
  This paper introduces EPS-MoE, a novel expert pipeline scheduler for MoE. Our results demonstrate an average 21% improvement in prefill throughput over existing parallel inference methods.
  arXiv  Detail & Related papers  (2024-10-16T05:17:49Z)
• Decoding-Time Language Model Alignment with Multiple Objectives [116.42095026960598]
  Existing methods primarily focus on optimizing LMs for a single reward function, limiting their adaptability to varied objectives. Here, we propose $textbfmulti-objective decoding (MOD)$, a decoding-time algorithm that outputs the next token from a linear combination of predictions. We show why existing approaches can be sub-optimal even in natural settings and obtain optimality guarantees for our method.
  arXiv  Detail & Related papers  (2024-06-27T02:46:30Z)
• Efficient Adaptation in Mixed-Motive Environments via Hierarchical Opponent Modeling and Planning [51.52387511006586]
  We propose Hierarchical Opponent modeling and Planning (HOP), a novel multi-agent decision-making algorithm. HOP is hierarchically composed of two modules: an opponent modeling module that infers others' goals and learns corresponding goal-conditioned policies. HOP exhibits superior few-shot adaptation capabilities when interacting with various unseen agents, and excels in self-play scenarios.
  arXiv  Detail & Related papers  (2024-06-12T08:48:06Z)
• Expensive Multi-Objective Bayesian Optimization Based on Diffusion Models [17.19004913553654]
  Multi-objective Bayesian optimization (MOBO) has shown promising performance on various expensive multi-objective optimization problems (EMOPs) We propose a novel Composite Diffusion Model based Pareto Set Learning algorithm, namely CDM-PSL, for expensive MOBO. Our proposed algorithm attains superior performance compared with various state-of-the-art MOBO algorithms.
  arXiv  Detail & Related papers  (2024-05-14T14:55:57Z)
• Pre-Evolved Model for Complex Multi-objective Optimization Problems [3.784829029016233]
  Multi-objective optimization problems (MOPs) necessitate the simultaneous optimization of multiple objectives. This paper proposes the concept of pre-evolving for MOEAs to generate high-quality populations for diverse complex MOPs.
  arXiv  Detail & Related papers  (2023-12-11T05:16:58Z)
• FP3O: Enabling Proximal Policy Optimization in Multi-Agent Cooperation with Parameter-Sharing Versatility [13.882557160892686]
  Existing multi-agent PPO algorithms lack compatibility with different types of parameter sharing. We develop a practical algorithm called Full-Pipeline PPO (FP3O) by several approximations.
  arXiv  Detail & Related papers  (2023-10-08T07:26:35Z)
• Multi-objective Pointer Network for Combinatorial Optimization [10.286195356515355]
  Multi-objective optimization problems (MOCOPs) exist in various real applications. Deep reinforcement learning (DRL) methods have been proposed to generate approximate optimal solutions to the optimization problems. This study proposes a single-model deep reinforcement learning framework, called multi-objective Pointer Network (MOPN)
  arXiv  Detail & Related papers  (2022-04-25T14:02:34Z)
• Permutation Invariant Policy Optimization for Mean-Field Multi-Agent Reinforcement Learning: A Principled Approach [128.62787284435007]
  We propose the mean-field proximal policy optimization (MF-PPO) algorithm, at the core of which is a permutation-invariant actor-critic neural architecture. We prove that MF-PPO attains the globally optimal policy at a sublinear rate of convergence. In particular, we show that the inductive bias introduced by the permutation-invariant neural architecture enables MF-PPO to outperform existing competitors.
  arXiv  Detail & Related papers  (2021-05-18T04:35:41Z)
• Model-based Multi-agent Policy Optimization with Adaptive Opponent-wise Rollouts [52.844741540236285]
  This paper investigates the model-based methods in multi-agent reinforcement learning (MARL) We propose a novel decentralized model-based MARL method, named Adaptive Opponent-wise Rollout Policy (AORPO)
  arXiv  Detail & Related papers  (2021-05-07T16:20:22Z)
• The Surprising Effectiveness of MAPPO in Cooperative, Multi-Agent Games [67.47961797770249]
  Multi-Agent PPO (MAPPO) is a multi-agent PPO variant which adopts a centralized value function. We show that MAPPO achieves performance comparable to the state-of-the-art in three popular multi-agent testbeds.
  arXiv  Detail & Related papers  (2021-03-02T18:59:56Z)
• Automatic Preference Based Multi-objective Evolutionary Algorithm on Vehicle Fleet Maintenance Scheduling Optimization [16.435391367609586]
  A preference based multi-objective evolutionary algorithm is proposed for generating solutions in an automatically detected knee point region. The newly proposed algorithm can generate the preference region accurately and that it can obtain better solutions in the preference region.
  arXiv  Detail & Related papers  (2021-01-23T18:48:23Z)
• Learning Robust State Abstractions for Hidden-Parameter Block MDPs [55.31018404591743]
  We leverage ideas of common structure from the HiP-MDP setting to enable robust state abstractions inspired by Block MDPs. We derive instantiations of this new framework for both multi-task reinforcement learning (MTRL) and meta-reinforcement learning (Meta-RL) settings.
  arXiv  Detail & Related papers  (2020-07-14T17:25:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.