detection_metric_protocol
Compute AUROC and AUPR detection metrics with paper-faithful score orientations for softmax confidence baselines.
- License 许可
- Apache-2.0
- 最近更新
- 2026-09-03
- Stars
- ★ 351
- Forks
- 27
01 前言 Front Matter
- name
- detection_metric_protocol
- description
- Compute AUROC and AUPR detection metrics with paper-faithful score orientations for softmax confidence baselines.
02 资源文件 2
- 脚本scripts/metrics.py1.8 KB
- 脚本tests/test_metrics.py590 B
03 SKILL.md 正文
Threshold-Independent Detection Metrics
Use this skill when evaluating maximum-softmax-probability detectors for misclassification or out-of-distribution examples. It implements the paper convention of reporting AUROC and AUPR rather than choosing a single threshold.
Inputs
- Binary labels where
1is the positive detector class. - Numeric scores where larger means more likely positive.
- Optional metadata naming the protocol, such as
success,error,in, orout.
Outputs
auroc,aupr,base_rate, counts, and sorted ranking diagnostics.
Workflow
- Choose score orientation before calling the metric: MSP for success/in-distribution positive, negative MSP for error/out-of-distribution positive.
- Compute AUROC as pairwise positive-vs-negative ranking probability with half credit for ties.
- Compute average precision by scanning descending scores and averaging precision at positive ranks.
- Report the positive base rate so AUPR can be compared to the random baseline.
Validation
Run python tests/test_metrics.py or validate the full skill tree with validate_skill_tree.py --run-tests.
Limitations
This skill does not infer labels or generate scores. It assumes the caller has already created paper-faithful positive labels and score orientation.
04 同仓库更多 Skills
passnet-triton-opt
Make a single PassNet Triton kernel fast AND numerically faithful: performance model (when a replacement can win at all), block/grid/warp tuning, autotune policy, launch overhead, and per-op numeric recipes to pass the dtype baseline tolerances. Use when a pass matches and is correct but speedup below expected, or when correctness fails by small numeric margins.
passnet-solve
END-TO-END playbook for solving one PassNet sample: analyze the computation graphs, decide the optimization strategy (what to fuse, what to replace, what to leave alone), drive the iteration loop, and maximize the sample score. This is the ENTRY skill — invoke it first for any PassNet optimization task; it tells you when to use passnet-pattern-fusion, passnet-triton-opt and passnet-feedback.
passnet-skill
PassNet GPU kernel optimization via compiler passes. Design and implement Triton-based optimization passes, create pass files under ./pass_dir/, self-evaluate with pass_evaluator, and iterate to maximize GPU speedup.
passnet-pattern-fusion
Author PassNet pass files: write patterns that actually MATCH the FX graph, pick fusion regions (which ops to absorb into one Triton kernel), and structure multi-pass submissions with the mandatory shared-dispatch architecture. Use when creating or fixing pattern()/replacement_args()/replacement_func() files, when a pass "failed to match", or when deciding how to fuse multiple kernels/ops.
passnet-orchestrate
Round/batch planning and decision support for PassNet graph optimization. Use for multi-sample triage, worker allocation, eval-budget policy, and post-eval keep/revert decisions. For solving one concrete sample end to end, use passnet-solve as the entry skill; consult this skill only when you need broader planning or a specific decision gate.
passnet-feedback
Fast, deterministic feedback for PassNet work: pre-flight pattern/match verification WITHOUT burning a GPU evaluation, per-node bottleneck analysis of a sample's graphs, and eval-log parsing into per-variant status + estimated score + failure classification. Use BEFORE every GPU evaluation (check_pattern), at the START of a sample (analyze_graph), and AFTER every evaluation (parse_eval_log).