3D-RadVis: Visualization of Pareto front in many-objective optimization
Bibliographic record
Abstract
In many-objective optimization, visualization of true Pareto front or obtained non-dominated solutions is difficult. A proper visualization tool must be able to show the location, range, shape, and distribution of obtained non-dominated solutions. However, existing commonly used visualization tools in many-objective optimization (e.g., parallel coordinates) fail to show the shape of the Pareto front. In this paper, we propose a simple yet powerful visualization method, called 3-dimensional radial coordinate visualization (3D-RadVis). This method is capable of mapping M-dimensional objective space to a 3-dimensional radial coordinate plot while preserving the relative location of solutions, shape of the Pareto front, distribution of solutions, and convergence trend of an optimization process. Furthermore, 3D-RadVis can be used by decision-makers to visually navigate large many-objective solution sets, observe the evolution process, visualize the relative location of a solution, evaluate trade-off among objectives, and select preferred solutions. The visual effectiveness of the proposed method is demonstrated on widely used many-objective benchmark problems containing variety of Pareto fronts (linear, concave, convex, mixed, and disconnected). In addition, we demonstrated the capability of 3D-RadVis for visual progress tracking of the NSGA-III algorithm through generations. It is worthwhile to mention that a suitable visualization is a crucial prerequisite for an effective interactive optimization.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.012 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".