Run1 pareto frontier identification
Identifying the set of non-dominated solutions in a multi-objective optimization problem.From its SKILL.md
npx -y skills add cxcscmu/SkillLearnBench --skill run1_pareto-frontier-identificationAssembled from the repository path, not quoted from the project. Check it against their README if it does not work.
SKILL.md
0.8 KB, 183 tokens by cl100k_base, as published. Nobody here has run it
In multi-objective optimization (e.g., maximizing F1 while minimizing Delta), a solution is Pareto optimal if no other solution is better in both metrics.
Algorithm to find Pareto Frontier:
- Start with a list of candidate points (after filtering for
F1 > 0.5). - A point $A$ is "dominated" by point $B$ if:
- $F1_B \ge F1_A$ AND $Delta_B \le Delta_A$
- AND at least one inequality is strict.
- The Pareto frontier consists of all points that are not dominated by any other point in the set.
Implementation Tip: Sort the candidates by one objective (e.g., F1 descending) first. This simplifies the comparison logic as you iterate through the list to check for dominance.
What ships with it
Read from the repository
Just SKILL.md. No reference files, no scripts.