Pith. sign in

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

arxiv 2305.08852 v1 pith:26B6NIPN submitted 2023-05-15 cs.AI cs.LG

classification cs.AIcs.LG
keywords packageperformancepythonattainmentempiricalfrontsmultipleoften
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Channel Charting in Smart Radio Environments

    eess.SP 2025-08 conditional novelty 6.0 of 10

    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.

  2. Preference-Optimal Multi-Metric Weighting for Parallel Coordinate Plots

    cs.HC 2025-06 conditional novelty 4.0 of 10

    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.

Pith tools