Repository navigation
First Claim Fit 71 EN
One fit completed, but the current model did not outperform existing controls. The target is a very small suggestion: “consider verifying this candidate first.” Preserve every candidate; a person or agent checks the actual evidence. Do not use this hint to authorize work or discard candidates.
On15 known validation requests, ordered lexical control required27 checks and the model31, a14.8% deterioration. Correct first candidates fell5→2 among10 answerable requests. Preserve the original5% improvement condition and the failure. Five unknown requests stay separate; five no-answer requests retain the cost of checking all candidates.
All76 development requests were assigned44train/20validation/12calibration by whole-source group. Prepared91/45 fit rows retain18/1 zero-weight rows. The model uses8192 FP32 coefficients in Go without a Laya encoder or GPU. Its32,792B file differs from26.98MiB whole-fit peak RSS. A0.805s single full-fit observation is not resident inference latency or Codex-token savings.
flowchart LR
A[72 public development requests] --> B[Combine4 finite new cases:76 total]
B --> C[Whole-source partition and Go arrays]
C --> D[First BCE model: utility failed]
C --> E[BCE plus same-request ranking: sibling preparation]
E --> F[Separate compression after utility evidence]
Average loss improved, while verification order worsened on three acquire/release/result-delivery requests. Do not attribute everything to the loss alone. One next experiment retains BCE and adds a relative-order term to raise acceptable candidates above negatives for the same request. Fix coefficient1, original seed/masks, validation-BCE epoch choice and utility gates in advance without searching. This is an objective sibling, not a compressed child.
The existing tool can run as a resident process now.
riido-shortclaim --stream --baseline lexical_ordered < requests.jsonlInput contains a short request and1..8 candidates, preserving512-byte/32-normalized-word limits. Output includes every candidate in verification order and unverified_heuristic status. JSONL supports repeated person/agent use. This command does not load the first fitted coefficients or alter default Codex settings.
The original72 preparation dataset is public at an exact HF commit;20 files were downloaded again and compared. It contains no fitted coefficients. Read full first-fit records, actual array preparation and CI/Wiki/HF verification as separate stages.
A follow-up chosen after seeing validation failure remains developmental even if it improves. These76 requests form19 related source groups and cannot replace the protected final target of at least2,400 distinct requests per domain. AI-assisted research cost and actual LLM savings remain unmeasured; source-diversity and production approval are false.
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