Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.17889 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912985987940352 |
|---|---|
| author | Dinh, Phuong Mai Huynh, Van-Nam |
| author_facet | Dinh, Phuong Mai Huynh, Van-Nam |
| contents | Many practical applications of multi-objective optimization (MOO), including engineering design, autonomous systems, and machine learning, often yield complex Pareto frontiers (e.g., discontinuous, degenerate, or non-convex), which pose challenges for traditional scalarization and Pareto Set Learning (PSL) methods that struggle to approximate them accurately. In this paper, we propose GaussianPSL, a novel framework that uses soft partitions of the Pareto decision/objective space to address the challenges posed by complex Pareto frontiers. Our method dynamically partitions the space, enabling simple MLP networks to learn localized features within each region and then aggregate this information for the final prediction. This partition-aware strategy enhances both exploration and convergence, reduces sensitivity to initialization, and improves robustness against local optima. Experimental results demonstrate that the proposed approach consistently outperforms standard PSL models in learning complex Pareto fronts while maintaining model simplicity. Overall, GaussianPSL offers a new direction for effective, scalable MOO in challenging frontier geometries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_17889 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | GaussianPSL: Soft partitioning for complex PSL problem Dinh, Phuong Mai Huynh, Van-Nam Machine Learning Many practical applications of multi-objective optimization (MOO), including engineering design, autonomous systems, and machine learning, often yield complex Pareto frontiers (e.g., discontinuous, degenerate, or non-convex), which pose challenges for traditional scalarization and Pareto Set Learning (PSL) methods that struggle to approximate them accurately. In this paper, we propose GaussianPSL, a novel framework that uses soft partitions of the Pareto decision/objective space to address the challenges posed by complex Pareto frontiers. Our method dynamically partitions the space, enabling simple MLP networks to learn localized features within each region and then aggregate this information for the final prediction. This partition-aware strategy enhances both exploration and convergence, reduces sensitivity to initialization, and improves robustness against local optima. Experimental results demonstrate that the proposed approach consistently outperforms standard PSL models in learning complex Pareto fronts while maintaining model simplicity. Overall, GaussianPSL offers a new direction for effective, scalable MOO in challenging frontier geometries. |
| title | GaussianPSL: Soft partitioning for complex PSL problem |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2509.17889 |