File size: 13,517 Bytes
071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 071ba6b fa599d5 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 | """Reward system unit tests — REW-06 + REW-08.
>= 33 tests total: 30 unit-test pairs + 3 @pytest.mark.reward_audit tests.
"""
from __future__ import annotations
import random
import pytest
from unittest.mock import MagicMock
from omegaconf import OmegaConf
from rewards.format_gate import format_gate
from rewards.correctness import correctness
from rewards.token_budget import token_budget
from rewards.recursion_efficiency import recursion_efficiency
from rewards.compose import compose_reward_single, compose_reward_fn, make_reward_fn
# ---------------------------------------------------------------------------
# Fixture: minimal cfg_reward matching configs/reward/v1.yaml
# ---------------------------------------------------------------------------
@pytest.fixture
def cfg_reward():
return OmegaConf.create({
"alpha": 0.2,
"weights": {"correctness": 0.75, "token_budget": 0.2, "recursion_efficiency": 0.05},
"token_budget_variant": "capped_linear",
"answer_regex": "<answer>(.*?)</answer>",
"max_calls": 2,
})
# ---------------------------------------------------------------------------
# TestFormatGate — 7 cases
# ---------------------------------------------------------------------------
class TestFormatGate:
def test_valid_tag(self):
assert format_gate("<answer>Rome</answer>") == 1.0
def test_no_tag(self):
assert format_gate("The answer is Rome.") == 0.0
def test_uppercase_tag(self):
assert format_gate("<ANSWER>Rome</ANSWER>") == 1.0
def test_empty_answer_tag(self):
assert format_gate("<answer></answer>") == 1.0
def test_multiline_tag(self):
assert format_gate("Some text\n<answer>\nRome\n</answer>") == 1.0
def test_no_closing_tag(self):
assert format_gate("<answer>Rome") == 0.0
def test_nested_content(self):
assert format_gate("<answer>The city of <b>Rome</b></answer>") == 1.0
# ---------------------------------------------------------------------------
# TestCorrectness — 8 cases (covers niah, extractive task types)
# ---------------------------------------------------------------------------
class TestCorrectness:
def test_exact_match(self):
assert correctness("<answer>Rome</answer>", "Rome") == 1.0
def test_case_insensitive(self):
assert correctness("<answer>rome</answer>", "Rome") == 1.0
def test_trailing_period(self):
assert correctness("<answer>Rome.</answer>", "Rome") == 1.0
def test_whitespace_padding(self):
assert correctness("<answer> Rome </answer>", "Rome") == 1.0
def test_no_tag_returns_zero(self):
assert correctness("The answer is Rome.", "Rome") == 0.0
def test_wrong_answer(self):
assert correctness("<answer>Paris</answer>", "Rome") == 0.0
def test_multiword_gold(self):
# niah task: "New York" vs "new york"
assert correctness("<answer>new york</answer>", "New York") == 1.0
def test_empty_extraction(self):
assert correctness("<answer></answer>", "Rome") == 0.0
# ---------------------------------------------------------------------------
# TestTokenBudget — 7 cases (covers REW-04 variants)
# ---------------------------------------------------------------------------
class TestTokenBudget:
def test_short_completion_near_one(self):
score = token_budget("hello world", 100, alpha=0.2)
assert score > 0.95
def test_long_completion_reduced(self):
long_text = " ".join(["word"] * 200)
score = token_budget(long_text, 100, alpha=0.2)
assert score < 0.8
def test_very_long_clamped_to_zero(self):
long_text = " ".join(["word"] * 10000)
score = token_budget(long_text, 100, alpha=0.2, variant="capped_linear")
assert score == 0.0
def test_capped_quadratic_in_range(self):
score = token_budget("short text here", 100, alpha=0.2, variant="capped_quadratic")
assert 0.0 <= score <= 1.0
def test_uncapped_can_be_negative(self):
long_text = " ".join(["word"] * 10000)
score = token_budget(long_text, 10, alpha=2.0, variant="uncapped")
assert score < 0.0
def test_unknown_variant_raises(self):
with pytest.raises(ValueError, match="REW-04"):
token_budget("text", 100, variant="unknown_variant")
def test_zero_prompt_tokens_no_crash(self):
score = token_budget("hello", 0)
assert 0.0 <= score <= 1.0
# ---------------------------------------------------------------------------
# TestRecursionEfficiency — 7 cases
# ---------------------------------------------------------------------------
class TestRecursionEfficiency:
def test_zero_calls(self):
assert recursion_efficiency(0) == 1.0
def test_one_call(self):
assert recursion_efficiency(1) == 0.75
def test_two_calls(self):
assert recursion_efficiency(2) == 0.50
def test_three_calls(self):
assert recursion_efficiency(3) == 0.25
def test_four_or_more_calls_zero(self):
assert recursion_efficiency(4) == 0.0
assert recursion_efficiency(10) == 0.0
def test_negative_treated_as_zero(self):
assert recursion_efficiency(-1) == 1.0
def test_max_calls_ignored_in_v2(self):
# max_calls kwarg is accepted via **_ but ignored by new linear decay
assert recursion_efficiency(2, max_calls=1) == 0.50
# ---------------------------------------------------------------------------
# TestCompose — 6 cases (covers counting + multi_needle task types implicitly)
# ---------------------------------------------------------------------------
class TestCompose:
def test_format_fail_short_circuits(self, cfg_reward):
score, _ = compose_reward_single("no tag here", "Rome", 100, cfg_reward, llm_call_count=0)
assert 0.0 <= score <= 0.25 # A-02 cap applies, but > 0 because of token budget
def test_perfect_score(self, cfg_reward):
# Short completion, 0 llm calls, correct answer
score, _ = compose_reward_single("<answer>Rome</answer>", "Rome", 1, cfg_reward, llm_call_count=0)
assert score == pytest.approx(0.75 * 1.0 + 0.2 * 1.0 + 0.05 * 1.0 + 0.10, abs=0.05)
def test_correctness_zero_capped_at_025(self, cfg_reward):
# format passes but wrong answer → capped at 0.25 (since format bonus + cap)
score, _ = compose_reward_single("<answer>Paris</answer>", "Rome", 100, cfg_reward, llm_call_count=0)
assert score <= 0.25
def test_partial_mix(self, cfg_reward):
# Correct answer but long completion (token_budget reduced)
long_text = " ".join(["filler"] * 500) + " <answer>42</answer>"
score, _ = compose_reward_single(long_text, "42", 10, cfg_reward, llm_call_count=0)
assert 0.5 < score <= 1.10 # correctness=1 dominates
def test_make_reward_fn_factory(self, cfg_reward):
bound_fn = make_reward_fn(cfg_reward)
result = bound_fn(
prompts=["q"],
completions=["<answer>Rome</answer>"],
gold_answer=["Rome"],
prompt_token_count=[1],
llm_call_count=[0],
)
assert isinstance(result, list) and len(result) == 1
assert result[0] > 0.5
def test_trl_contract_batched(self, cfg_reward):
results = compose_reward_fn(
prompts=["q1", "q2"],
completions=["<answer>42</answer>", "no answer here"],
gold_answer=["42", "100"],
prompt_token_count=[100, 100],
llm_call_count=[0, 0],
cfg_reward=cfg_reward,
)
assert len(results) == 2
assert results[0] > 0.0
assert results[1] <= 0.25
# ---------------------------------------------------------------------------
# REW-06: Automated anti-hacking audits (3 tests, @pytest.mark.reward_audit)
# ---------------------------------------------------------------------------
@pytest.mark.reward_audit
def test_masked_context_reward_is_baseline(cfg_reward):
"""REW-06: gibberish answer with format tag must score <= 0.25 (A-02 cap)."""
score, _ = compose_reward_single(
"<answer>lorem ipsum dolor sit amet</answer>",
"Rome",
100,
cfg_reward,
llm_call_count=0,
)
assert score <= 0.25, f"Masked-context score too high: {score}"
@pytest.mark.reward_audit
def test_format_only_composite_is_capped(cfg_reward):
"""REW-06: 20 format-only completions with mismatched gold must all score <= 0.25."""
words = ["banana", "kiwi", "mango", "peach", "grape", "lemon", "plum",
"cherry", "pear", "melon", "papaya", "guava", "fig", "date",
"lime", "apricot", "coconut", "blueberry", "raspberry", "strawberry"]
composites = [
compose_reward_single(f"<answer>{w}</answer>", "Rome", 100, cfg_reward, llm_call_count=0)[0]
for w in words
]
assert max(composites) <= 0.25, f"Format-only composites: {composites}"
@pytest.mark.reward_audit
def test_no_monotonic_length_exploit(cfg_reward):
"""REW-06: longer completions must NOT score higher (length-exploit guard)."""
lengths = [10, 50, 100, 500, 1000, 2000, 5000, 8000, 12000, 20000]
composites = []
for n in lengths:
completion = " ".join(["filler"] * n) + " <answer>rome</answer>"
score, _ = compose_reward_single(completion, "rome", 100, cfg_reward, llm_call_count=0)
composites.append(score)
# Longer completions must not score strictly higher
assert composites[-1] < composites[0], (
f"Length exploit: shortest={composites[0]:.3f}, longest={composites[-1]:.3f}"
)
# Sequence must be non-increasing (or flat)
assert all(a >= b for a, b in zip(composites, composites[1:])), (
f"Non-monotonic sequence: {[round(x, 3) for x in composites]}"
)
class TestComposeV3:
"""REW-02 v3: soft format + recursion-extraction + correctness-gated efficiency."""
@pytest.fixture
def cfg_v3(self):
return OmegaConf.create({
"alpha": 0.2,
"weights": {"correctness": 0.70, "token_budget": 0.15, "recursion_efficiency": 0.15},
"token_budget_variant": "capped_linear",
"answer_regex": "<answer>(.*?)</answer>",
"max_calls": 4,
})
def test_correct_no_recursion_scores_high(self, cfg_v3):
c = "```python\nimport re\nm=re.search('silver', ctx)\nprint(m.group())\n```\n<answer>silver</answer>"
score, metrics = compose_reward_single(c, "silver", 100, cfg_v3)
assert score >= 0.85, f"clean correct should score high, got {score}"
assert metrics["llm_call_count"] == 0
def test_zero_calls_beats_one_call_when_both_correct(self, cfg_v3):
c0 = "```python\nimport re\nm=re.search('silver', ctx)\nprint(m.group())\n```\n<answer>silver</answer>"
c1 = "```python\nans=llm('color', ctx[:5000])\nprint(ans)\n```\n<answer>silver</answer>"
s0, _ = compose_reward_single(c0, "silver", 100, cfg_v3)
s1, _ = compose_reward_single(c1, "silver", 100, cfg_v3)
assert s0 > s1, f"0-call ({s0:.3f}) should beat 1-call ({s1:.3f}) when both correct"
def test_efficiency_gated_on_correctness(self, cfg_v3):
# Wrong answer with 0 calls — must NOT earn efficiency bonus.
c = "```python\nprint('done')\n```\n<answer>gold</answer>"
score, metrics = compose_reward_single(c, "silver", 100, cfg_v3)
assert metrics["recursion_eff_contribution"] == 0.0
assert score <= 0.25, f"wrong answer must be capped, got {score}"
def test_recursion_spam_loses_to_minimal_recursion(self, cfg_v3):
c2 = "```python\na=llm('q1',ctx[:1000])\nb=llm('q2',ctx[1000:2000])\n```\n<answer>silver</answer>"
c5 = "```python\n" + "\n".join(f"x{i}=llm('q{i}',ctx)" for i in range(5)) + "\n```\n<answer>silver</answer>"
s2, _ = compose_reward_single(c2, "silver", 100, cfg_v3)
s5, _ = compose_reward_single(c5, "silver", 100, cfg_v3)
assert s2 > s5, f"2-call ({s2:.3f}) should beat 5-call spam ({s5:.3f})"
def test_format_only_capped(self, cfg_v3):
c = "<answer>wrong</answer>"
score, _ = compose_reward_single(c, "silver", 100, cfg_v3)
assert 0.05 <= score <= 0.25, f"format-only wrong should be in [0.05, 0.25], got {score}"
def test_no_format_gets_minimal_credit(self, cfg_v3):
c = "silver" # right text but no <answer> tag
score, _ = compose_reward_single(c, "silver", 100, cfg_v3)
assert score <= 0.20
def test_group_variance_nonzero(self, cfg_v3):
"""Smoke check: a synthetic GRPO group of 8 must produce non-zero std.
v1 had std=0.0 across all groups, which zeroed the GRPO advantage."""
gens = [
"```python\nimport re\nm=re.search('silver',ctx)\nprint(m.group())\n```\n<answer>silver</answer>",
"```python\nans=llm('color',ctx[:5000])\nprint(ans)\n```\n<answer>silver</answer>",
"<answer>silver</answer>",
"<answer>gold</answer>",
"the color is silver",
"<answer></answer>",
"```python\n" + "\n".join(f"x{i}=llm('q{i}',ctx)" for i in range(5)) + "\n```\n<answer>silver</answer>",
"silver.",
]
scores = [compose_reward_single(g, "silver", 200, cfg_v3)[0] for g in gens]
import statistics as _st
assert _st.stdev(scores) > 0.10, f"group std too low: {_st.stdev(scores)}"
|