REVIEW 2 cited by
Python Tool for Visualizing Variability of Pareto Fronts over Multiple Runs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Hyperparameter optimization is crucial to achieving high performance in deep learning. On top of the performance, other criteria such as inference time or memory requirement often need to be optimized due to some practical reasons. This motivates research on multi-objective optimization (MOO). However, Pareto fronts of MOO methods are often shown without considering the variability caused by random seeds and this makes the performance stability evaluation difficult. Although there is a concept named empirical attainment surface to enable the visualization with uncertainty over multiple runs, there is no major Python package for empirical attainment surface. We, therefore, develop a Python package for this purpose and describe the usage. The package is available at https://github.com/nabenabe0928/empirical-attainment-func.
Forward citations
Cited by 2 Pith papers
-
Channel Charting in Smart Radio Environments
Static electromagnetic skins, chosen from a small codebook, improve channel-charting localization in non-line-of-sight urban settings, cutting the 90th-percentile error from over 60 m to below 25 m in simulation.
-
Preference-Optimal Multi-Metric Weighting for Parallel Coordinate Plots
Given a user-selected point on an approximated Pareto front, the method computes linear metric weights from the front's gradient and colors parallel coordinates accordingly.
Discussion (0). Continue with ORCID to comment.