Hacktoberfest 2026：维护者为十月标记出来的 issue，仍然开放、适合新手。 浏览 Hacktoberfest issue

[Lane 1 · numerics] Precision/Recall/F1 — averaging-mode and zero-division conventions

未关闭
  • 哪里不对？
#1,224 0 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看

维护者通常 1 天内回复

还没有人认领这个 Issue。

评估

难度
3/5
预计耗时
半天
新手友好度
68/100
Issue 类型
文档
描述清晰度
描述清楚
活跃度
冷清
技术栈
python, pytorch, scikit-learn
领域
ai, machine-learning

调研方向

This is research only: no Kotlin or SKaiNET code. Read sklearn.metrics.precision_recall_fscore_support (docs and source) and torchmetrics.classification Precision, Recall, and F1Score. Build the edge-case table (empty batch, unseen class, one-sided class, all wrong, argmax ties) for macro and micro, then write three short recommendations (zero-division, macro class set, binary/threshold). Confirm the given fixture with a real sklearn call and post table plus recommendations as a comment on issue #1222; done when a maintainer replies adopted or amended.

由索引模型根据 Issue 内容生成。

描述

good first issue research size:s skill:numerics sub-issue training

Sub-issue of #1222 (Precision, Recall and F1Score metrics).

Lane: 1 · Numerics / Research
Skill needed: comfortable reading scikit-learn / torchmetrics source and docs. No Kotlin required, no SKaiNET knowledge required.
Size: s (~2–4 h)
Blocked by: nothing — this is the first task in the feature and unblocks #1226.

What to do

  1. Read sklearn.metrics.precision_recall_fscore_support (docs + source) and
    torchmetrics.classification.{Precision, Recall, F1Score} (docs + source).
  2. Produce a short table — one row per edge case, one column per library — for:
    • empty batch (no samples at all);
    • a class that appears in neither predictions nor targets (TP+FP+FN = 0);
    • a class that appears only in targets (never predicted) and vice versa;
    • all predictions wrong;
    • ties in the argmax (two logits exactly equal).
      For each: what does the library return for precision / recall / F1 under macro and
      micro, and do the two libraries agree?
  3. Answer the three decisions the parent issue leaves open, each as a one-paragraph
    recommendation with a link a reviewer can click:
    • Zero-division: 0.0 (sklearn default) vs. NaN vs. a parameter. The parent
      recommends 0.0 to match Accuracy.compute() on an empty accumulator.
    • Class set for macro averaging: union of classes seen in targets ∪ predictions
      (sklearn) vs. the full class dimension predictions.shape[dim] (which counts
      never-seen classes as F1 = 0). These differ on small batches.
    • Binary mode: does binary mean "report the positive class (index 1) only", and
      should F1Score take a threshold: Float? like Accuracy does, or is binary purely
      averaging = BINARY?
  4. Post the table and the three recommendations as a comment on #1222 under
    its Research section. That comment is the deliverable — not code.

Acceptance

  • Edge-case table posted on #1222 with links to the exact sklearn / torchmetrics
    doc sections or source lines
  • Three explicit recommendations (zero-division, macro class set, binary/threshold)
  • A maintainer has replied "adopted" (or amended) so #1226 can start from a fixed contract

Notes

The hand-computed reference fixture the Kotlin sub-issues will test against is:
predicted classes [2, 0, 1, 2], targets [2, 1, 1, 0] (3 classes). Expected under
sklearn: per-class precision [0, 1, 0.5], recall [0, 0.5, 1], F1 [0, 0.667, 0.667];
macro P = R = 0.5, macro F1 = 0.444; micro P = R = F1 = 0.5 (= accuracy). Please confirm
those numbers by actually running precision_recall_fscore_support once and paste the
output — that turns a hand calculation into a citable reference.

主要语言
Kotlin
星标
52
派生
15
平均合并
1 天 4 小时
30 天内合并 PR
37

环境准备

  • 没有 Dockerfile 或 Docker Compose 文件
  • 没有 Pull Request 模板
  • 阅读贡献指南

从这里开始

  1. 先读完整个 Issue，再读项目的贡献指南。
  2. 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
  3. Fork 仓库，在一个分支上完成修改。
  4. 提交 Pull Request，并在描述里引用这个 Issue 编号。

SKaiNET-developers/SKaiNET 的其他 Issue

查看 SKaiNET-developers/SKaiNET 的全部 Issue

相似的 Issue

更多 Kotlin Issue

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。