Evolving Generalizable Parallel Algorithm Portfolios for Binary Optimization Problems via Domain-Agnostic Instance Generation
Identification
- Clé publique
- radar:r-86574912f3a3a17e0afe6a01d0f189ad
- Auteurs
- Zhiyuan Wang · Shengcai Liu · Peng Yang · Ke Tang
- Année déclarée
- 2025
- Langue déclarée
- en
- Type source
- article
- Première détection
- 2026-11-14T02:38:50.569629+00:00
- Dernière observation des métadonnées
- 2026-11-14T02:38:50.569629+00:00
- Dernière vérification HTTP
- Non effectuée
Institutions déclarées par la source
Southern University of Science and Technology
Pays d’affiliation déclarés
CN
Résumé documentaire — langue originale
Generalization is the core objective when training optimizers from data. However, limited training instances often constrain the generalization capability of the trained optimizers. Co-evolutionary approaches address this challenge by simultaneously evolving a parallel algorithm portfolio (PAP) and an instance population to eventually obtain PAPs with good generalization. Yet, when applied to a specific problem class, these approaches have a major limitation. They require practitioners to provide instance generators specially tailored to the problem class, which is often non-trivial to design. This work proposes a general-purpose, off-the-shelf PAP construction approach, named domain-agnostic co-evolution of parameterized search (DACE), for binary optimization problems where decision variables take values of 0 or 1. The key novelty of DACE lies in its neural network-based domain-agnostic instance representation and generation mechanism that eliminates the need for domain-specific instance generators. The strong generality of DACE is validated across three real-world binary optimization problems: the complementary influence maximization problem (CIMP), the compiler arguments optimization problem (CAOP), and the contamination control problem (CCP). Given only a small set of training instances from these problem classes, DACE, without requiring domain knowledge, constructs PAPs with even better generalization performance than existing approaches on all three classes, despite their use of domain-specific instance generators.
Identifiants
- OPENALEX
- https://openalex.org/W4416366522
- DOI
- 10.1109/tevc.2025.3635185
Repères documentaires
- Famille documentaire
- article
- Types déclarés par les sources
- article
- Éditeurs
- Institute of Electrical and Electronics Engineers
Les mentions d’entités ne constituent pas une preuve de reconnaissance juridique. La juridiction étudiée est distincte du pays d’affiliation des auteurs.
Sources
OpenAlex · Document 1
Citer cette référence
Zhiyuan Wang; Shengcai Liu; Peng Yang; Ke Tang. Evolving Generalizable Parallel Algorithm Portfolios for Binary Optimization Problems via Domain-Agnostic Instance Generation. 2025. https://doi.org/10.1109/tevc.2025.3635185
JSON · CSL-JSON · BibTeX · RIS · CSV · JSON-LD ·
APA, Chicago, ISO 690 : formats bibliographiques fondés sur les champs disponibles. OSCOLA / Bluebook : données structurées uniquement ; aucune conformité juridique complète n’est revendiquée sans vérification des éléments nécessaires.
- APA
- Zhiyuan Wang; Shengcai Liu; Peng Yang; Ke Tang. (2025). Evolving Generalizable Parallel Algorithm Portfolios for Binary Optimization Problems via Domain-Agnostic Instance Generation. https://doi.org/10.1109/tevc.2025.3635185
- Chicago
- Zhiyuan Wang; Shengcai Liu; Peng Yang; Ke Tang. Evolving Generalizable Parallel Algorithm Portfolios for Binary Optimization Problems via Domain-Agnostic Instance Generation. 2025. https://doi.org/10.1109/tevc.2025.3635185
- ISO 690
- Zhiyuan Wang; Shengcai Liu; Peng Yang; Ke Tang. Evolving Generalizable Parallel Algorithm Portfolios for Binary Optimization Problems via Domain-Agnostic Instance Generation. 2025. https://doi.org/10.1109/tevc.2025.3635185
Warning: Undefined array key "last_link_verified" in /home/clients/e27d81e12f04d2bfd747aa264540ac56/sites/_UDTR_APP/legal_library_reference.php on line 31
UDTR — Bibliothèque juridique mondiale des droits de la Nature. Evolving Generalizable Parallel Algorithm Portfolios for Binary Optimization Problems via Domain-Agnostic Instance Generation. Notice documentaire: https://www.declarationuniverselledesdroitsdelarbre.org/global-rights-of-nature-radar/reference/r-86574912f3a3a17e0afe6a01d0f189ad/ · Dernière vérification HTTP : non effectuée
Données de cette version figée
Dossiers et relations documentaires
Rôles des sources
Source bibliographique / publication d’origine · https://doi.org/10.1109/tevc.2025.3635185
Un lien vers une autorité ne prouve pas à lui seul une affirmation juridique. Les résumés et les textes intégraux restent soumis aux conditions de leur source.
Statut documentaire
Pertinence à examiner
Bibliothèque
Cette identité n’est pas encore intégrée à la Bibliothèque juridique.