fix(lotto): 학습 게이트 정직화 (engine-best vs random-best 6trial·명시적 gated·정체성 일관)

Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
This commit is contained in:
2026-05-31 17:47:52 +09:00
parent 03056a4747
commit 4063f29cd3
4 changed files with 221 additions and 14 deletions

View File

@@ -182,6 +182,7 @@ def test_track_record_and_review_payload(monkeypatch):
tr = bt.track_record()
assert "random_null" in tr["by_strategy"]
# 이제 random_null은 N_NULL_TRIALS=6 행이므로 6*20=120장
assert tr["by_strategy"]["random_null"]["n_tickets"] >= 20
payload = bt.build_review_payload(40)
@@ -191,3 +192,129 @@ def test_track_record_and_review_payload(monkeypatch):
assert "calibration_trend" in payload
assert payload["winner_analysis"] is not None
assert "score_total" in payload["winner_analysis"]
def test_run_forward_purchase_random_null_count(monkeypatch):
"""run_forward_purchase는 random_null을 N_NULL_TRIALS=6개 저장해야 한다."""
db = _fresh_db(monkeypatch)
_seed_draws(db, 40)
from app import backtest as bt
res = bt.run_forward_purchase(draw_no=40, k=20, pool_n=500, sample_seed=7)
assert res["ok"] is True
rows = db.get_backtest_runs(draw_no=40)
null_rows = [r for r in rows if r["strategy"] == "random_null"]
assert len(null_rows) == bt.N_NULL_TRIALS # 6개
null_labels = {r["weight_label"] for r in null_rows}
assert null_labels == {f"r{i}" for i in range(bt.N_NULL_TRIALS)}
for r in null_rows:
assert r["n_tickets"] == 20
def test_evaluate_weekly_gated_keeps_base_unchanged(monkeypatch):
"""Fix 5 통합 테스트 (end-to-end gated path).
접근: DB에 draws, weight_trials, auto_picks, backtest_runs, base_history를 직접 심어
evaluate_weekly()의 gated 분기가 base를 바꾸지 않음을 검증한다.
gated 조건: engine_w 최고 prize_score random_best < LIFT_EPSILON(10.0).
engine_best=5, random_best=20 → lift=-15 → gated.
evaluate_weekly 내부 흐름:
- get_weekly_trials(week_start) : _today_kst() 기준 week_start 사용
- get_latest_draw() : draws 테이블에서 max(drw_no) 반환
두 참조가 같은 날짜 기준이어야 하므로 _today_kst를 monkeypatch로 고정하고
draws의 최신 회차 날짜(drw_date)를 해당 주의 날짜로 맞춘다.
"""
import json as _json
from datetime import date, timedelta, datetime as _dt, timezone as _tz, timedelta as _td
db = _fresh_db(monkeypatch)
# KST 오늘 날짜 — evaluate_weekly가 이 날짜를 기준으로 week_start 계산
KST = _tz(_td(hours=9))
today_kst = _dt.now(KST).date()
from app import weight_evolver as we
week_start = we.get_week_start(today_kst)
# 1) draws 심기 — 최신 회차의 drw_date를 week_start 주 안의 날짜로 맞춤
import random as _r; _r.seed(99)
rows = []
for i in range(1, 41):
s = sorted(_r.sample(range(1, 46), 6))
# 마지막 회차(40)는 오늘 날짜 사용 (week_start 주 내)
if i == 40:
drw_date = today_kst.isoformat()
else:
drw_date = f"2020-01-{(i % 28) + 1:02d}"
rows.append({
"drw_no": i, "drw_date": drw_date,
"n1": s[0], "n2": s[1], "n3": s[2],
"n4": s[3], "n5": s[4], "n6": s[5],
"bonus": (s[5] % 45) + 1,
})
db.upsert_many_draws(rows)
latest = db.get_latest_draw()
assert latest is not None
assert latest["drw_date"] == today_kst.isoformat()
# 2) weight trial 1개 심기 (day_of_week=0, week_start=오늘 주)
trial_w = [0.2, 0.2, 0.2, 0.2, 0.2]
db.save_weight_trial(week_start, 0, trial_w, "perturb")
trial_rows = db.get_weekly_trials(week_start)
assert len(trial_rows) == 1
trial_id = trial_rows[0]["id"]
# 3) auto_picks 1개 심기 (winning 번호와 2개 일치 → max_correct=2)
winning6 = [latest["n1"], latest["n2"], latest["n3"],
latest["n4"], latest["n5"], latest["n6"]]
pick = winning6[:2] + [40, 41, 42, 43]
db.save_auto_pick(trial_id, 1, pick, meta_score=0.5)
# 4) backtest_runs: engine_w prize_score=5, random_null 6개 prize_score=20 (gated 확실)
LOW_HIST = {"m3": 5, "m4": 0, "m5": 0, "m6": 0, "bonus_hits": 0} # prize=5
HIGH_HIST = {"m3": 20, "m4": 0, "m5": 0, "m6": 0, "bonus_hits": 0} # prize=20
draw_no = latest["drw_no"]
db.save_backtest_run(
draw_no=draw_no, strategy="engine_w", weight_label="w0",
weight_json=_json.dumps(trial_w), trial_id=trial_id, n_tickets=20,
hist=LOW_HIST, best_match=2, avg_meta_score=0.5,
)
from app import backtest as bt
for i in range(bt.N_NULL_TRIALS):
db.save_backtest_run(
draw_no=draw_no, strategy="random_null", weight_label=f"r{i}",
weight_json=None, trial_id=None, n_tickets=20,
hist=HIGH_HIST, best_match=3, avg_meta_score=0.5,
)
# 5) current base 저장 (이전 주 월요일 effective_from)
base_w = [0.2, 0.2, 0.2, 0.2, 0.2]
prev_monday = (today_kst - timedelta(weeks=1, days=today_kst.weekday())).isoformat()
db.save_base_history(
effective_from=prev_monday,
weight=base_w,
source_trial_id=None,
update_reason="cold_start",
winner_score=None,
winner_max_correct=None,
)
assert db.get_current_base() == base_w
# 6) evaluate_weekly 호출 — _today_kst()를 monkeypatch로 오늘 날짜 고정
monkeypatch.setattr(we, "_today_kst", lambda: today_kst)
result = we.evaluate_weekly()
assert result.get("ok") is True, f"evaluate_weekly 실패: {result}"
# gated path 검증
update_reason = result.get("update_reason", "")
assert update_reason in ("unchanged_gated", "idempotent_skip"), (
f"gated여야 하는데 reason='{update_reason}' — 게이팅 로직 깨짐"
)
# base가 바뀌지 않았는지 검증
new_base = result.get("new_base")
assert new_base == base_w, (
f"gated인데 base가 변경됨: {new_base} != {base_w}"
)

View File

@@ -129,7 +129,7 @@ def test_select_winner_by_lift_gating():
{"trial_id": 2, "day_of_week": 1, "weight": [0.3,0.2,0.2,0.2,0.1], "prize_score": 9.0},
{"trial_id": 3, "day_of_week": 2, "weight": [0.1,0.3,0.2,0.2,0.2], "prize_score": 4.0},
]
# random baseline이 8.0이면 lift는 +1, +1, -4 → 노이즈 ε=2 안에서 게이팅
# random baseline이 8.0이면 lift는 -3, +1, -4 → 최대 lift(+1) < ε(2) → 게이팅
winner = we.select_winner_by_lift(per_w, random_score=8.0, epsilon=2.0)
assert winner["gated"] is True # 최대 lift(+1) < ε(2) → 게이팅
winner2 = we.select_winner_by_lift(per_w, random_score=3.0, epsilon=2.0)
@@ -142,3 +142,57 @@ def test_prize_score_from_hist():
s = we.prize_score_from_hist({"m3": 10, "m4": 2, "m5": 0, "m6": 0, "bonus_hits": 0})
s_big = we.prize_score_from_hist({"m3": 0, "m4": 0, "m5": 0, "m6": 1, "bonus_hits": 0})
assert s_big > s # 1등 1장이 5등 다수보다 큼
def test_select_winner_by_lift_preserves_all_keys():
"""select_winner_by_lift는 per_w 항목의 모든 키를 보존해야 한다.
best_match, weight_label 등 identity 필드가 누락되면 evaluate_weekly가 깨진다."""
per_w = [
{
"trial_id": 10,
"weight_label": "w0",
"weight": [0.2] * 5,
"prize_score": 3.0,
"best_match": 3,
},
{
"trial_id": 11,
"weight_label": "w1",
"weight": [0.3, 0.2, 0.2, 0.2, 0.1],
"prize_score": 20.0,
"best_match": 4,
},
]
result = we.select_winner_by_lift(per_w, random_score=5.0, epsilon=2.0)
assert result["gated"] is False
assert result["trial_id"] == 11
assert result["weight_label"] == "w1" # identity 키 보존
assert result["best_match"] == 4 # best_match 키 보존
assert "lift" in result # lift 추가됨
assert result["lift"] == pytest.approx(15.0)
def test_gated_path_keeps_base_via_select_winner():
"""gated=True일 때 select_winner_by_lift의 반환값 검증.
evaluate_weekly 내의 gated 분기가 올바른 값에 의존함을 확인한다."""
per_w = [
{"trial_id": 1, "weight_label": "w0", "weight": [0.2]*5,
"prize_score": 5.0, "best_match": 2},
{"trial_id": 2, "weight_label": "w1", "weight": [0.3,0.2,0.2,0.2,0.1],
"prize_score": 7.0, "best_match": 3},
]
# random_best=8.0 → 최대 engine lift=7-8=-1 → gated
result = we.select_winner_by_lift(per_w, random_score=8.0, epsilon=we.LIFT_EPSILON)
assert result["gated"] is True
assert result["lift"] < 0
# decide_base_update를 통해 gated가 unchanged를 유도하는지 확인
# (gated override가 없더라도, 현재 LIFT_EPSILON=10.0 하에서 lift<0이면 항상 gated)
current = [0.2, 0.2, 0.2, 0.2, 0.2]
# gated이면 evaluate_weekly가 current_base를 그대로 유지해야 함
# 여기서는 override 로직을 직접 재현해 검증한다
gated = result["gated"]
new_base_override = list(current) if gated else None
reason_override = "unchanged_gated" if gated else "should_not_reach"
assert new_base_override == current
assert reason_override == "unchanged_gated"