Pareto optimization with small data by learning across common objective spaces
In multi-objective optimization, it becomes prohibitively difficult to cover the Pareto front (PF) as the number of points scales exponentially with the dimensionality of the objective space. The challenge is exacerbated in expensive optimization domains where evaluation data is at a premium. To ove...
Saved in:
Main Authors: | Tan, Chin Sheng, Gupta, Abhishek, Ong, Yew-Soon, Pratama, Mahardhika, Tan, Puay Siew, Lam, Siew-Kei |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/169428 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Finding the non-dominated Pareto set for multi-objective simulation models
by: Lee, L.H., et al.
Published: (2014) -
Finding the non-dominated Pareto set for multi-objective simulation models
by: Lee, L.H., et al.
Published: (2014) -
Pareto-optimal solutions based multi-objective particle swarm optimization control for batch processes
by: Jia, L., et al.
Published: (2014) -
Pareto-optimal solutions based multi-objective particle swarm optimization control for batch processes
by: Jia, L., et al.
Published: (2014) -
Pareto Simulated Annealing (SA)-based multi-objective optimization for mems design and application
by: Ong, A.O., et al.
Published: (2014)