Repository navigation
Evaluation 2400 EN
The user requires at least 2,400 final evaluation requests before judging usefulness. The previous 24-case synthetic evaluation is a learning smoke test, not evidence for a production recommendation. Local execution and artifact size were measured; practical usefulness remains unverified.
Count distinct requests, not candidates, pairwise comparisons or seed repetitions. Group paraphrases and shared code/repository/template cases across splits. Report unique source/code/group counts alongside requests; correlated cases are not independent samples. Prefer group-bootstrap confidence intervals. Once final data informs changes it becomes development data; two seeds do not double the sample size.
CoSQA authors provide human-annotated natural-language query/Python-code pairs. Their paper describes at least three annotators per pair. Raw content remains local.
- Revision
14ebcacf9e9bc3e7109102632bc63047876f27d2,data/qa/cosqa-all.json, 13,998,805 bytes. - SHA256
4d1a227fe3652992d1e98f43fa9dc1b8f54a6c27a1a24b9d182bdfb8cbc3274c. - 20,604 pairs: 10,020 positive /10,584 negative.
- 20,604 unique lowercased/whitespace-normalized queries; 6,267 unique outer-whitespace-trimmed code snippets.
- 6,267 connected groups sharing query or code; largest group20 pairs.
- Zero exact duplicate query/code pairs or conflicting labels among such duplicates.
- 19,054 pairs fit the current scorer's input limits. Do not silently discard the remainder; report out-of-scope/fallback rates.
This exact-duplicate audit does not establish semantic deduplication, clone detection or label correctness. Repository metadata is absent, so repository-level separation cannot yet be verified. Connected code/query groups are the minimum splitting unit to avoid seeing the same code in training and final.
CoSQA labels one query/code pair's relevance. Passing 2,400 pair evaluations does not establish 64/256/1024-candidate retrieval or repository selection. Use it for relevance discrimination and scope handling; evaluate candidate retrieval separately with relevance judgments. Custom holdouts must not be presented as official benchmark scores.
CodeSearchNet offers larger code/documentation pairs, but documentation-as-query proxy labels differ from human relevance judgments. Its official README assigns licenses per source repository. The official S3 Go archive returned403 during this audit; no unverified mirror was substituted.
CoSQA's authors distinguish MIT code from C-UDA data. The C-UDA text distinguishes computational use/results from source-data redistribution and does not warrant upstream rights. Publish only aggregate audit results for now. Do not relabel this data as project Apache-2.0 or copy raw content to HF. Model publication requires separate provenance/terms/source-content checks; a root MIT LICENSE does not license every dataset as MIT.
- Extend exact/near-duplicate and connected-group auditing.
- Freeze ≥2,400 final requests and separate validation/calibration/training groups without selecting easy or short examples based on performance.
- Freeze hashes, metrics and missing/out-of-scope treatment before fitting. The old smoke-test gates are not new deployment gates.
- Compare BM25/nonlearned/FP32/INT8/ternary controls on identical samples. Separate classification from retrieval; report worst costs, fallback and length/language breakdowns.
- Establish actual candidate-search quality and repeated-use costs before recommending deployment. Sample count alone does not qualify a model.
Completed: source audit of20,604 pairs. Pending: sealing and evaluating the≥2,400 final set. Research artifact publication and production recommendation are distinct; current models are not recommended for production.
Reproduce after downloading the pinned source into local cache:
go run ./cmd/riido-corpusaudit \
--input .cache/semantic-scale/cosqa-all.json \
--sha256 4d1a227fe3652992d1e98f43fa9dc1b8f54a6c27a1a24b9d182bdfb8cbc3274cThe Go auditor prints no query/code text and checks file bounds/hash, connected leakage groups and conflicting duplicates.
riidolaya is experimental. No demonstrated Codex cost savings; repository selection is preview-only.
riidolaya는 실험 단계입니다. Codex 절감은 미입증이며 저장소 선택은 preview입니다.
English README · 한국어 README · Versioned Wiki sources / Wiki 원본
이전 연구 안내 펼치기 / Earlier research
- 실제 이어 학습 V3 · 한국어 · Actual V3 training · English
- 진행·완료 보고·질문100건 결과 KO · 100-case results EN
- 라벨·이모지·상태 힌트 KO · Content/state hints EN
- 개발 진행·완료 보고·질문 pilot KO · Development pilot EN
- 작은 검증 기록 KO · Compact evidence EN
- 현재 개발 자료 35개·다음 학습 조건 · 35-row data and next training gates
- 개발용 학습 자료 2개 · Two qualified training requests
- 첫 두 과제 실제 관측 · First two actual observations
- 전체 사용법 KO · Full usage EN
- 작은 동작 힌트 KO · Small hints EN
- 설명 보강 비교76 · Caption diagnostic76
- Go 압축 가중치78 · Packed Go weights78
- 공개 함수 동작 검증 · Public function verification
- 다음 학습 자료 준비 · Training data preparation
- 동작에서 학습 정답·실제 학습79 · Grounded labels and actual fit79
- 소스 동작 관찰 · Source observations
- 저장 크기와 RAM · Storage and RAM
- 라이선스 · Licensing
- 시점별 기록 원문 / Chronological history
- 전체 연구 링크 / Full research index
- 문서 목록 / Documentation