The paper introduces In-Context Preference-Conditioned Pareto Set Learning (ICPSL), a framework that uses a pretrained hypernetwork to generate a problem-specific, preference-conditioned Pareto solution model from limited offline data. ICPSL eliminates the need for repeated preference-wise searches or problem-specific training by producing a reusable model in a single forward pass. Experiments on synthetic and real-world problems demonstrate that ICPSL yields high-quality Pareto solutions while significantly speeding up model construction.
arXiv:2606. 15115v1 Announce Type: new Abstract: Multi-objective optimization (MOO) has emerged as a powerful approach to solving complex optimization problems involving multiple objectives.
arXiv:2607. 27953v1 Announce Type: new Abstract: Combinatorial optimization problems (COPs) underpin many real-world decisions, but their exponentially large search spaces make high-quality solutions costly to obtain.
arXiv:2406. 09770v2 Announce Type: replace-cross Abstract: Solving multi-objective optimization problems for large deep neural networks is a challenging task due to the complexity of the loss landscape and the expensive computational cost of training and evaluating models.
arXiv:2505. 10892v2 Announce Type: replace Abstract: Post-training LLMs with RLHF and preference optimization methods (e.
arXiv:2606. 19521v1 Announce Type: new Abstract: In multi-task learning, handling an increasing number of objectives can quickly become challenging, both in terms of the computational resources and the decision maker's capacity to choose appropriate trade-offs.
arXiv:2602. 07764v2 Announce Type: replace-cross Abstract: Multi-objective reinforcement learning (MORL) seeks to train agents capable of balancing conflicting objectives.
Continuous-Utility Direct Preference Optimization (CU‑DPO) replaces binary preference labels with continuous scores to better capture fine‑grained reasoning quality. The framework aligns language models to multiple prompt‑based cognitive strategies, proving a θ(K log K) sample‑complexity improvement and convergence to an entropy‑regularized utility‑maximizing policy. A two‑stage pipeline—strategy selection via best‑vs‑all comparisons and execution refinement using margin‑stratified pairs—yields significant gains on mathematical reasoning, code generation, and causal reasoning benchmarks.
arXiv:2605. 01712v2 Announce Type: replace Abstract: Pareto set learning (PSL) is an emerging paradigm in multi-objective optimization that trains neural networks to map preference vectors to Pareto optimal solutions.
arXiv:2602. 08261v2 Announce Type: replace Abstract: Auto-bidding systems strive to maximize marketing value while maintaining high compliance with efficiency constraints, such as Target Cost-Per-Action (CPA).
arXiv:2601. 01665v2 Announce Type: replace-cross Abstract: Deep reinforcement learning (DRL) has shown great promise in addressing multi-objective combinatorial optimization problems (MOCOPs).
CM-DPO introduces a Constraint-Margin Direct Preference Optimization method that replaces the binary preference signal of traditional DPO with a continuous margin based on a deterministic symbolic verifier, scaled by violation severity. Hard and soft constraints are separated via a lexicographic objective to prevent hard constraints from being traded off against preferences. Using procedurally generated constraint profiles and minimal-edit distillation within the SynPlan-R framework, an 8B model fine‑tuned with CM‑DPO achieves high pass and solve rates on several planning benchmarks, matching multi‑agent systems with lower latency and outperforming GPT‑4o on unseen tasks.
RecSoup introduces a lightweight two‑stage method for Controllable Multi‑Objective Recommendation (CMOR) that merges multiple objective‑specific models without retraining. The approach first prunes parameters to reduce cross‑objective interference, then adaptively merges them using a learnable preference‑to‑coefficient mapping, enabling dynamic trade‑off control at inference time. Experiments show RecSoup achieves superior Pareto front quality and 165–228× faster inference than parameter‑generation baselines.