Repository navigation
Path Claim Results 46 EN
The initial 24 tasks were a pilot for checking behavior. This experiment used 4,456 training and 2,599 validation examples, meeting the fixed minimum of 2,400 in each role. All ten models—five helper-cost penalties × two seeds—were fitted. Repeating a task does not add a new example.
The model aims to hint that “auxiliary search may help here.” It neither generates sentences nor replaces the user's decision. Inputs are 16 generic numbers from baseline search. Raw text, paths, task IDs and repository names do not enter coefficient inputs.
The current family failed its usefulness gates.
| Validation: 2,599 tasks | Baseline | Learned selection 1729 | Learned selection 2718 |
|---|---|---|---|
| Total pages to first target | 18,023 | 18,010 | 17,978 |
| Helper selections | 0 | 55 | 1,248 |
| Tasks with a target in top 10 | 1,014 | 1,013 | 1,007 |
Page reductions of about 0.07–0.25% missed the required 5%, and early target retrieval declined slightly. Repository harm and seed instability also appeared. Even an oracle knowing every beneficial case could save at most 3.11% with this helper. Neither the gate nor the winner-selection procedure was changed afterward.
Validation counts are Lightning 287, Google Cloud Python 672, NumPy 679, pandas 634 and cryptography 327. The 2,402 protected final tasks remain unscored. Validation selects candidates and is development evidence, not final performance.
One isolated warm execution of input verification, all ten fits, policy comparisons and artifact writing took 1.45 seconds with about 108.6MiB peak RSS, without a GPU. Coefficient payloads are 64 bytes, but the catalogs, caches and search system are not. This duration is not single-inference latency.
Pages and selections replay stored search outcomes. Actually skipped helper work, LLM tokens, Codex usage and task completion savings are unproven. Failed models were neither registered for production nor released as new weights. A separate experiment should first examine helper headroom and features that distinguish benefit from harm. Ternary comparisons remain conditional on a useful FP32 signal.
Detailed results, every candidate, provenance and memory · Preregistered plan · Input seal · 한국어
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