Metraipolis › archive › dc_6bf86fb7ca41

In-Context Preference-Conditioned Pareto Set Learning from Limited Offline Data — arXiv:2610.21736

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21736
License (as archived)
CC0-1.0
Archived
2026-10-16T09:03:55.058Z
SHA-256 of the archived text
60a781c7052920f9bec171f1b0867ee70675c21a973fded68e6783d1d8ab8d37
Stable URL of this page
https://metraipolis.com/documento/dc_6bf86fb7ca41

How to cite

In-Context Preference-Conditioned Pareto Set Learning from Limited Offline Data — arXiv:2610.21736 — arXiv (en), https://arxiv.org/abs/2610.21736 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6bf86fb7ca41 (Metraipolis archive dc_6bf86fb7ca41, sha256 60a781c7052920f9bec171f1b0867ee70675c21a973fded68e6783d1d8ab8d37)
BibTeX
@misc{dc6bf86fb7ca41,
  title = {In-Context Preference-Conditioned Pareto Set Learning from Limited Offline Data — arXiv:2610.21736},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21736},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6bf86fb7ca41; sha256 60a781c7052920f9bec171f1b0867ee70675c21a973fded68e6783d1d8ab8d37},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21736. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Multi-objective optimization involves diverse preferences over conflicting objectives. Rather than returning a finite set of trade-off solutions, preference-conditioned Pareto set learning seeks to map a specified preference directly to a corresponding Pareto optimal solution. Yet in many real-world scenarios, optimization must proceed offline without further objective evaluations, leaving only a limited static dataset that sparsely covers the decision and objective spaces. Existing methods either optimize separately for each preference or train a problem-specific Pareto solution model, requiring repeated search across preferences or repeated training across problems. We introduce in-context preference-conditioned Pareto set learning (ICPSL), a framework that amortizes both preference-wise solution search and problem-specific model construction. ICPSL pretrains a foundation-style hypernetwork on a large and diverse set of synthetic prior data. Given the offline observations of an unseen problem, the pretrained hypernetwork learns to generate a problem-specific, preference-conditioned Pareto solution model in a single forward pass. The generated model can then be reused to predict solutions for arbitrary preferences without problem-specific training or preference-wise search. Experiments on synthetic and real-world problems show that ICPSL produces high-quality Pareto solutions while providing substantial speedups in problem-specific solution-model construction.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.21736 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:44:17.784Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).