raglab 0.2.7__tar.gz → 0.2.8__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {raglab-0.2.7 → raglab-0.2.8}/PKG-INFO +1 -1
- {raglab-0.2.7 → raglab-0.2.8}/pyproject.toml +1 -1
- {raglab-0.2.7 → raglab-0.2.8}/raglab/__init__.py +14 -0
- {raglab-0.2.7 → raglab-0.2.8}/raglab/agent.py +24 -1
- raglab-0.2.8/raglab/judging.py +325 -0
- raglab-0.2.8/tests/test_judging.py +220 -0
- {raglab-0.2.7 → raglab-0.2.8}/.claude/CLAUDE.md +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/.editorconfig +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/.gitattributes +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/.github/workflows/ci.yml +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/.gitignore +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/CHANGELOG.md +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/LICENSE +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/README.md +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/raglab/llm.py +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/tests/test_agent.py +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/tests/test_fanin.py +0 -0
- {raglab-0.2.7 → raglab-0.2.8}/tests/test_llm_roles.py +0 -0
|
@@ -30,6 +30,7 @@ from .agent import (
|
|
|
30
30
|
Citer,
|
|
31
31
|
Evaluator,
|
|
32
32
|
Formulator,
|
|
33
|
+
GradedLabel,
|
|
33
34
|
Judgement,
|
|
34
35
|
LowLevelQuery,
|
|
35
36
|
Planner,
|
|
@@ -53,12 +54,20 @@ from .agent import (
|
|
|
53
54
|
single_subtask_planner,
|
|
54
55
|
)
|
|
55
56
|
from .llm import EVALUATION_PROMPT, make_llm_evaluator, make_llm_formulator
|
|
57
|
+
from .judging import (
|
|
58
|
+
DEFAULT_LEVELS,
|
|
59
|
+
DEFAULT_TOPICAL_RUBRIC,
|
|
60
|
+
GRADING_PROMPT,
|
|
61
|
+
apply_gates,
|
|
62
|
+
make_graded_rubric_evaluator,
|
|
63
|
+
)
|
|
56
64
|
|
|
57
65
|
__all__ = [
|
|
58
66
|
"Query",
|
|
59
67
|
"SubTask",
|
|
60
68
|
"LowLevelQuery",
|
|
61
69
|
"Judgement",
|
|
70
|
+
"GradedLabel",
|
|
62
71
|
"Result",
|
|
63
72
|
"Retriever",
|
|
64
73
|
"Planner",
|
|
@@ -83,4 +92,9 @@ __all__ = [
|
|
|
83
92
|
"make_llm_formulator",
|
|
84
93
|
"make_llm_evaluator",
|
|
85
94
|
"EVALUATION_PROMPT",
|
|
95
|
+
"DEFAULT_LEVELS",
|
|
96
|
+
"DEFAULT_TOPICAL_RUBRIC",
|
|
97
|
+
"GRADING_PROMPT",
|
|
98
|
+
"apply_gates",
|
|
99
|
+
"make_graded_rubric_evaluator",
|
|
86
100
|
]
|
|
@@ -52,6 +52,7 @@ __all__ = [
|
|
|
52
52
|
"SubTask",
|
|
53
53
|
"LowLevelQuery",
|
|
54
54
|
"Judgement",
|
|
55
|
+
"GradedLabel",
|
|
55
56
|
"Result",
|
|
56
57
|
"Retriever",
|
|
57
58
|
"Planner",
|
|
@@ -111,6 +112,25 @@ class LowLevelQuery:
|
|
|
111
112
|
params: Mapping[str, Any] = field(default_factory=dict)
|
|
112
113
|
|
|
113
114
|
|
|
115
|
+
@dataclass(frozen=True)
|
|
116
|
+
class GradedLabel:
|
|
117
|
+
"""A graded verdict on one candidate (raglab#8): a level, three axes, the evidence.
|
|
118
|
+
|
|
119
|
+
``level`` is one of the evaluator's ordered levels (best first). The axes are
|
|
120
|
+
Self-RAG's: ``is_about`` (topical, ISREL), ``is_supported`` (the content
|
|
121
|
+
actually establishes it, not a lexical mention: ISSUP) and ``is_useful``
|
|
122
|
+
(ISUSE). ``evidence_quote`` is a verbatim span of the candidate's content
|
|
123
|
+
backing the level; ``facet`` names the sub-goal it was judged against.
|
|
124
|
+
"""
|
|
125
|
+
|
|
126
|
+
level: str
|
|
127
|
+
is_about: bool
|
|
128
|
+
is_supported: bool
|
|
129
|
+
is_useful: bool
|
|
130
|
+
evidence_quote: str = ""
|
|
131
|
+
facet: str | None = None
|
|
132
|
+
|
|
133
|
+
|
|
114
134
|
@dataclass(frozen=True)
|
|
115
135
|
class Judgement:
|
|
116
136
|
"""An evaluator's verdict over a round's results.
|
|
@@ -118,12 +138,15 @@ class Judgement:
|
|
|
118
138
|
``relevant`` is the kept subset; ``sufficient`` says whether to stop; a
|
|
119
139
|
non-``None`` ``refinement`` is the **back-edge** — the next sub-task to
|
|
120
140
|
re-query with. The pass-through default returns ``sufficient=True`` and no
|
|
121
|
-
refinement (no loop).
|
|
141
|
+
refinement (no loop). ``graded`` is optional and additive: a graded
|
|
142
|
+
evaluator maps each judged ``artifact_id`` to its :class:`GradedLabel`;
|
|
143
|
+
binary evaluators leave it empty.
|
|
122
144
|
"""
|
|
123
145
|
|
|
124
146
|
relevant: Sequence[Result]
|
|
125
147
|
sufficient: bool
|
|
126
148
|
refinement: SubTask | None = None
|
|
149
|
+
graded: Mapping[str, GradedLabel] = field(default_factory=dict)
|
|
127
150
|
|
|
128
151
|
|
|
129
152
|
# --------------------------------------------------------------------------- #
|
|
@@ -0,0 +1,325 @@
|
|
|
1
|
+
"""Graded rubric judging — every candidate gets a level, three axes and evidence (raglab#8).
|
|
2
|
+
|
|
3
|
+
A binary relevant/not cannot say "mentions the word but is not about it". The
|
|
4
|
+
evaluator built by :func:`make_graded_rubric_evaluator` asks an injected judge,
|
|
5
|
+
for **each** candidate in the round's pool, for the three Self-RAG axes
|
|
6
|
+
(``is_about``, ``is_supported``, ``is_useful``), a level on an ordered scale and
|
|
7
|
+
a verbatim ``evidence_quote`` from the candidate's disclosed content. The judge
|
|
8
|
+
proposes; deterministic gates here dispose:
|
|
9
|
+
|
|
10
|
+
- a level above ``unsupported_cap`` needs ``is_supported`` — topical vocabulary
|
|
11
|
+
without supporting content is capped (the direct fix for on-word distractors);
|
|
12
|
+
- with ``require_evidence_quote``, it also needs a quote found verbatim in the
|
|
13
|
+
content the judge was shown (whitespace-insensitive);
|
|
14
|
+
- ``calibration_offset`` (levels, learned from a gold slice) shifts every level
|
|
15
|
+
down (positive: the judge over-grades) or up;
|
|
16
|
+
- the level options are shown in a fresh random order on every call, against
|
|
17
|
+
position bias.
|
|
18
|
+
|
|
19
|
+
The result is a :class:`~raglab.agent.Judgement` whose additive ``graded`` map
|
|
20
|
+
carries every label, whose ``relevant`` keeps the candidates at or above
|
|
21
|
+
``relevant_level``, and whose back-edge comes from an injected ``refine`` policy
|
|
22
|
+
(none by default: the loop stops). As in :mod:`raglab.llm`, the default judge is
|
|
23
|
+
built lazily on :mod:`oa`, so ``import raglab`` stays offline, and a judge that
|
|
24
|
+
fails on a candidate leaves it ungraded rather than guessing.
|
|
25
|
+
"""
|
|
26
|
+
|
|
27
|
+
from __future__ import annotations
|
|
28
|
+
|
|
29
|
+
import json
|
|
30
|
+
import logging
|
|
31
|
+
import math
|
|
32
|
+
import random
|
|
33
|
+
import re
|
|
34
|
+
from collections.abc import Callable, Mapping, Sequence
|
|
35
|
+
from typing import Any
|
|
36
|
+
|
|
37
|
+
import ir
|
|
38
|
+
from ir.base import best_per_artifact
|
|
39
|
+
|
|
40
|
+
from .agent import Evaluator, GradedLabel, Judgement, Result, SubTask
|
|
41
|
+
|
|
42
|
+
__all__ = [
|
|
43
|
+
"DEFAULT_LEVELS",
|
|
44
|
+
"DEFAULT_TOPICAL_RUBRIC",
|
|
45
|
+
"GRADING_PROMPT",
|
|
46
|
+
"make_graded_rubric_evaluator",
|
|
47
|
+
"apply_gates",
|
|
48
|
+
]
|
|
49
|
+
|
|
50
|
+
#: Ordered levels, best first.
|
|
51
|
+
DEFAULT_LEVELS: tuple[str, ...] = ("core", "strong", "uses-tools", "tangential", "none")
|
|
52
|
+
|
|
53
|
+
#: What the default levels mean, for a "is this package about TOPIC" question.
|
|
54
|
+
DEFAULT_TOPICAL_RUBRIC = """\
|
|
55
|
+
- core: the candidate's main purpose IS the topic.
|
|
56
|
+
- strong: a substantial, central part of the candidate is about the topic.
|
|
57
|
+
- uses-tools: the candidate builds on tools or libraries of the topic (its dependencies or imports establish it) without being about it.
|
|
58
|
+
- tangential: the topic is mentioned, or its vocabulary appears, but the content does not establish it.
|
|
59
|
+
- none: unrelated.
|
|
60
|
+
"""
|
|
61
|
+
|
|
62
|
+
#: The judge's prompt; ``{levels}`` is shown in a fresh random order each call.
|
|
63
|
+
GRADING_PROMPT = """\
|
|
64
|
+
Goal: {goal}
|
|
65
|
+
|
|
66
|
+
Rubric (levels, in no particular order):
|
|
67
|
+
{levels}
|
|
68
|
+
|
|
69
|
+
Definitions:
|
|
70
|
+
{rubric}
|
|
71
|
+
|
|
72
|
+
Candidate {artifact_id}:
|
|
73
|
+
---
|
|
74
|
+
{content}
|
|
75
|
+
---
|
|
76
|
+
|
|
77
|
+
Answer with one JSON object and nothing else, with keys:
|
|
78
|
+
"is_about" (bool: is the candidate topically about the goal?),
|
|
79
|
+
"is_supported" (bool: does its content - code, dependencies, imports, full text - actually establish it, beyond a mention of the words?),
|
|
80
|
+
"is_useful" (bool: would it help someone pursuing the goal?),
|
|
81
|
+
"evidence_quote" (a short span copied VERBATIM from the candidate's content that supports your level),
|
|
82
|
+
"level" (one of the rubric's levels).
|
|
83
|
+
"""
|
|
84
|
+
|
|
85
|
+
#: A graded judge: keyword arguments ``goal, artifact_id, content, levels, rubric``
|
|
86
|
+
#: -> a mapping with the label's keys, or the raw JSON text of one.
|
|
87
|
+
GradedJudge = Callable[..., "Mapping[str, Any] | str"]
|
|
88
|
+
|
|
89
|
+
#: A refinement policy: ``(task, graded) -> the next SubTask, or None to stop``.
|
|
90
|
+
Refine = Callable[[SubTask, Mapping[str, GradedLabel]], "SubTask | None"]
|
|
91
|
+
|
|
92
|
+
#: Truncate each candidate's disclosed content to this many chars in the prompt.
|
|
93
|
+
DFLT_MAX_CONTENT_CHARS = 4000
|
|
94
|
+
|
|
95
|
+
#: A shorter evidence quote ("a", "the") would be found in almost any content.
|
|
96
|
+
DFLT_MIN_QUOTE_CHARS = 8
|
|
97
|
+
|
|
98
|
+
_log = logging.getLogger(__name__)
|
|
99
|
+
|
|
100
|
+
|
|
101
|
+
def _normalize_space(text: str) -> str:
|
|
102
|
+
return re.sub(r"\s+", " ", text).strip().casefold()
|
|
103
|
+
|
|
104
|
+
|
|
105
|
+
def apply_gates(
|
|
106
|
+
proposed: GradedLabel,
|
|
107
|
+
content: str,
|
|
108
|
+
*,
|
|
109
|
+
levels: Sequence[str] = DEFAULT_LEVELS,
|
|
110
|
+
unsupported_cap: str = "tangential",
|
|
111
|
+
require_evidence_quote: bool = True,
|
|
112
|
+
calibration_offset: float | None = None,
|
|
113
|
+
min_quote_chars: int = DFLT_MIN_QUOTE_CHARS,
|
|
114
|
+
) -> GradedLabel:
|
|
115
|
+
"""The level a judge's proposal is allowed, after calibration and the gates.
|
|
116
|
+
|
|
117
|
+
The quote must be at least ``min_quote_chars`` long and found in ``content``,
|
|
118
|
+
ignoring case and runs of whitespace (judges re-case and re-wrap what they
|
|
119
|
+
copy). ``calibration_offset`` is in levels, rounded half up, so a shift is
|
|
120
|
+
the same at every level.
|
|
121
|
+
|
|
122
|
+
>>> label = GradedLabel('core', True, False, True, 'a DAG of tasks')
|
|
123
|
+
>>> apply_gates(label, 'Runs a DAG of tasks asynchronously.').level
|
|
124
|
+
'tangential'
|
|
125
|
+
>>> ok = GradedLabel('core', True, True, True, 'graph library')
|
|
126
|
+
>>> apply_gates(ok, 'A graph library.').level, apply_gates(ok, 'Nothing here.').level
|
|
127
|
+
('core', 'tangential')
|
|
128
|
+
>>> apply_gates(ok, 'A graph library.', calibration_offset=1.4).level
|
|
129
|
+
'strong'
|
|
130
|
+
"""
|
|
131
|
+
cap = levels.index(unsupported_cap)
|
|
132
|
+
rank = levels.index(proposed.level)
|
|
133
|
+
if calibration_offset:
|
|
134
|
+
rank = min(max(math.floor(rank + calibration_offset + 0.5), 0), len(levels) - 1)
|
|
135
|
+
quote = _normalize_space(proposed.evidence_quote)
|
|
136
|
+
quoted = len(quote) >= min_quote_chars and quote in _normalize_space(content)
|
|
137
|
+
if rank < cap and (
|
|
138
|
+
not proposed.is_supported or (require_evidence_quote and not quoted)
|
|
139
|
+
):
|
|
140
|
+
rank = cap
|
|
141
|
+
return GradedLabel(
|
|
142
|
+
level=levels[rank],
|
|
143
|
+
is_about=proposed.is_about,
|
|
144
|
+
is_supported=proposed.is_supported,
|
|
145
|
+
is_useful=proposed.is_useful,
|
|
146
|
+
evidence_quote=proposed.evidence_quote if quoted else "",
|
|
147
|
+
facet=proposed.facet,
|
|
148
|
+
)
|
|
149
|
+
|
|
150
|
+
|
|
151
|
+
def _parse_label(out: Mapping[str, Any] | str, levels: Sequence[str]) -> GradedLabel:
|
|
152
|
+
"""A judge's reply as a :class:`GradedLabel`; raises ``ValueError`` when unusable."""
|
|
153
|
+
if isinstance(out, str):
|
|
154
|
+
match = re.search(r"\{.*\}", out, flags=re.DOTALL)
|
|
155
|
+
if not match:
|
|
156
|
+
raise ValueError(f"no JSON object in the judge's reply: {out[:200]!r}")
|
|
157
|
+
out = json.loads(match.group(0))
|
|
158
|
+
by_name = {lv.casefold(): lv for lv in levels}
|
|
159
|
+
level = by_name.get(str(out.get("level", "")).strip().casefold())
|
|
160
|
+
if level is None:
|
|
161
|
+
raise ValueError(f"level {out.get('level')!r} is not one of {list(levels)}")
|
|
162
|
+
|
|
163
|
+
def flag(key: str) -> bool:
|
|
164
|
+
value = out.get(key)
|
|
165
|
+
if isinstance(value, str):
|
|
166
|
+
return value.strip().lower() in ("true", "yes")
|
|
167
|
+
return bool(value)
|
|
168
|
+
|
|
169
|
+
return GradedLabel(
|
|
170
|
+
level=level,
|
|
171
|
+
is_about=flag("is_about"),
|
|
172
|
+
is_supported=flag("is_supported"),
|
|
173
|
+
is_useful=flag("is_useful"),
|
|
174
|
+
evidence_quote=str(out.get("evidence_quote") or ""),
|
|
175
|
+
)
|
|
176
|
+
|
|
177
|
+
|
|
178
|
+
def _contents(
|
|
179
|
+
hits: Sequence[Result], level: str, disclose_kwargs: Mapping[str, Any]
|
|
180
|
+
) -> list[str]:
|
|
181
|
+
"""Each hit's disclosed content at ``level``, its snippet when nothing loads."""
|
|
182
|
+
selection = ir.Selection(
|
|
183
|
+
selected=list(hits), candidates=list(hits), abstained=False, reason="graded"
|
|
184
|
+
)
|
|
185
|
+
disclosed = ir.disclose(selection, level=level, **dict(disclose_kwargs))
|
|
186
|
+
return [d.body or h.text for h, d in zip(hits, disclosed, strict=True)]
|
|
187
|
+
|
|
188
|
+
|
|
189
|
+
def make_graded_rubric_evaluator(
|
|
190
|
+
*,
|
|
191
|
+
levels: Sequence[str] = DEFAULT_LEVELS,
|
|
192
|
+
rubric: str = DEFAULT_TOPICAL_RUBRIC,
|
|
193
|
+
judge: GradedJudge | None = None,
|
|
194
|
+
disclose_level: str = "body",
|
|
195
|
+
disclose_kwargs: Mapping[str, Any] | None = None,
|
|
196
|
+
require_evidence_quote: bool = True,
|
|
197
|
+
unsupported_cap: str = "tangential",
|
|
198
|
+
calibration_offset: float | None = None,
|
|
199
|
+
min_quote_chars: int = DFLT_MIN_QUOTE_CHARS,
|
|
200
|
+
relevant_level: str = "uses-tools",
|
|
201
|
+
refine: Refine | None = None,
|
|
202
|
+
rng: random.Random | None = None,
|
|
203
|
+
prompt: str = GRADING_PROMPT,
|
|
204
|
+
max_content_chars: int = DFLT_MAX_CONTENT_CHARS,
|
|
205
|
+
**prompt_function_kwargs: Any,
|
|
206
|
+
) -> Evaluator:
|
|
207
|
+
"""An :class:`~raglab.agent.Evaluator` that grades every candidate on a rubric.
|
|
208
|
+
|
|
209
|
+
Args:
|
|
210
|
+
levels: the ordered levels, best first.
|
|
211
|
+
rubric: what each level means, shown to the judge.
|
|
212
|
+
judge: an injectable graded judge (a test double, or your own router);
|
|
213
|
+
built lazily on :mod:`oa` when omitted.
|
|
214
|
+
disclose_level, disclose_kwargs: what the judge reads — each candidate's
|
|
215
|
+
content through :func:`ir.disclose` at that level (``store=`` /
|
|
216
|
+
``loader=`` go in ``disclose_kwargs``); a candidate with nothing to
|
|
217
|
+
load is judged on its snippet.
|
|
218
|
+
require_evidence_quote, unsupported_cap, calibration_offset,
|
|
219
|
+
min_quote_chars: the gates, see :func:`apply_gates`.
|
|
220
|
+
relevant_level: the lowest level kept in ``Judgement.relevant``.
|
|
221
|
+
refine: the back-edge policy ``(task, graded) -> SubTask | None``; by
|
|
222
|
+
default none, so the loop stops after one round.
|
|
223
|
+
rng: the source of the per-call level order (seed it for reproducible
|
|
224
|
+
prompts).
|
|
225
|
+
|
|
226
|
+
Every candidate is judged once per goal: one judge call per (source,
|
|
227
|
+
artifact) the first time it appears in a pool for that goal, its label
|
|
228
|
+
remembered for later rounds, so a kept hit is not re-judged (nor lost to a
|
|
229
|
+
later failing call). ``Judgement.graded`` is keyed by ``artifact_id``; an id
|
|
230
|
+
found in several sources carries its best label. A reply that does not parse
|
|
231
|
+
leaves the candidate ungraded (logged); when every judge call of a round
|
|
232
|
+
raises, the first error is re-raised rather than returning an empty,
|
|
233
|
+
"sufficient" round. This evaluator is for labelling a pool, not for cheap
|
|
234
|
+
filtering.
|
|
235
|
+
"""
|
|
236
|
+
levels = tuple(levels)
|
|
237
|
+
for name, value in (
|
|
238
|
+
("unsupported_cap", unsupported_cap),
|
|
239
|
+
("relevant_level", relevant_level),
|
|
240
|
+
):
|
|
241
|
+
if value not in levels:
|
|
242
|
+
raise ValueError(f"{name}={value!r} is not one of {list(levels)}")
|
|
243
|
+
keep = levels.index(relevant_level)
|
|
244
|
+
rng = rng if rng is not None else random.Random()
|
|
245
|
+
disclose_kwargs = dict(disclose_kwargs or {})
|
|
246
|
+
state: dict[str, GradedJudge] = {}
|
|
247
|
+
memo: dict[tuple[str, str | None, str], GradedLabel] = {}
|
|
248
|
+
|
|
249
|
+
def ask(**kwargs: Any) -> Mapping[str, Any] | str:
|
|
250
|
+
if judge is not None:
|
|
251
|
+
return judge(**kwargs)
|
|
252
|
+
if "judge" not in state:
|
|
253
|
+
state["judge"] = _default_graded_judge(prompt, **prompt_function_kwargs)
|
|
254
|
+
return state["judge"](**kwargs)
|
|
255
|
+
|
|
256
|
+
def evaluator(task: SubTask, results: Sequence[Result]) -> Judgement:
|
|
257
|
+
hits = best_per_artifact(results)
|
|
258
|
+
todo = [h for h in hits if (task.goal, h.source, h.artifact_id) not in memo]
|
|
259
|
+
contents = _contents(todo, disclose_level, disclose_kwargs) if todo else []
|
|
260
|
+
errors: list[Exception] = []
|
|
261
|
+
for hit, content in zip(todo, contents, strict=True):
|
|
262
|
+
content = str(content)[:max_content_chars]
|
|
263
|
+
shown = list(levels)
|
|
264
|
+
rng.shuffle(shown)
|
|
265
|
+
try:
|
|
266
|
+
reply = ask(
|
|
267
|
+
goal=task.goal,
|
|
268
|
+
artifact_id=hit.artifact_id,
|
|
269
|
+
content=content,
|
|
270
|
+
levels="\n".join(f"- {lv}" for lv in shown),
|
|
271
|
+
rubric=rubric,
|
|
272
|
+
)
|
|
273
|
+
except Exception as error: # the judge itself failed: auth, network, limits
|
|
274
|
+
_log.warning("judge failed on %s: %r", hit.artifact_id, error)
|
|
275
|
+
errors.append(error)
|
|
276
|
+
continue
|
|
277
|
+
try:
|
|
278
|
+
proposed = _parse_label(reply, levels)
|
|
279
|
+
except (ValueError, TypeError, AttributeError) as error:
|
|
280
|
+
_log.warning("unusable judge reply on %s: %s", hit.artifact_id, error)
|
|
281
|
+
continue # left ungraded: never guess a level
|
|
282
|
+
memo[(task.goal, hit.source, hit.artifact_id)] = apply_gates(
|
|
283
|
+
proposed,
|
|
284
|
+
content,
|
|
285
|
+
levels=levels,
|
|
286
|
+
unsupported_cap=unsupported_cap,
|
|
287
|
+
require_evidence_quote=require_evidence_quote,
|
|
288
|
+
calibration_offset=calibration_offset,
|
|
289
|
+
min_quote_chars=min_quote_chars,
|
|
290
|
+
)
|
|
291
|
+
if todo and len(errors) == len(todo):
|
|
292
|
+
raise errors[0]
|
|
293
|
+
labels = {
|
|
294
|
+
(h.source, h.artifact_id): memo[key]
|
|
295
|
+
for h in hits
|
|
296
|
+
if (key := (task.goal, h.source, h.artifact_id)) in memo
|
|
297
|
+
}
|
|
298
|
+
graded: dict[str, GradedLabel] = {}
|
|
299
|
+
for (_, aid), label in labels.items():
|
|
300
|
+
if aid not in graded or levels.index(label.level) < levels.index(
|
|
301
|
+
graded[aid].level
|
|
302
|
+
):
|
|
303
|
+
graded[aid] = label
|
|
304
|
+
relevant = [
|
|
305
|
+
h
|
|
306
|
+
for h in hits
|
|
307
|
+
if (label := labels.get((h.source, h.artifact_id))) is not None
|
|
308
|
+
and levels.index(label.level) <= keep
|
|
309
|
+
]
|
|
310
|
+
refinement = refine(task, graded) if refine is not None else None
|
|
311
|
+
return Judgement(
|
|
312
|
+
relevant=relevant,
|
|
313
|
+
sufficient=refinement is None,
|
|
314
|
+
refinement=refinement,
|
|
315
|
+
graded=graded,
|
|
316
|
+
)
|
|
317
|
+
|
|
318
|
+
return evaluator
|
|
319
|
+
|
|
320
|
+
|
|
321
|
+
def _default_graded_judge(prompt: str, **prompt_function_kwargs: Any) -> GradedJudge:
|
|
322
|
+
"""Build the default graded judge on :mod:`oa` (lazy import)."""
|
|
323
|
+
import oa
|
|
324
|
+
|
|
325
|
+
return oa.prompt_function(prompt, name="grade_candidate", **prompt_function_kwargs)
|
|
@@ -0,0 +1,220 @@
|
|
|
1
|
+
"""Tests for the graded rubric evaluator (raglab#8).
|
|
2
|
+
|
|
3
|
+
Hermetic: the judge is a scripted test double keyed by artifact id; no model,
|
|
4
|
+
no network. Content comes from each hit's snippet (nothing to load from disk).
|
|
5
|
+
"""
|
|
6
|
+
|
|
7
|
+
import json
|
|
8
|
+
import random
|
|
9
|
+
|
|
10
|
+
from ir import SearchHit
|
|
11
|
+
|
|
12
|
+
from raglab import (
|
|
13
|
+
DEFAULT_LEVELS,
|
|
14
|
+
Budget,
|
|
15
|
+
GradedLabel,
|
|
16
|
+
Judgement,
|
|
17
|
+
SubTask,
|
|
18
|
+
make_graded_rubric_evaluator,
|
|
19
|
+
make_search_agent,
|
|
20
|
+
)
|
|
21
|
+
|
|
22
|
+
TASK = SubTask(goal="graph library", sources=("pkgs",))
|
|
23
|
+
|
|
24
|
+
|
|
25
|
+
def _hit(aid, text, score=1.0):
|
|
26
|
+
return SearchHit(aid, "k", score, text, {})
|
|
27
|
+
|
|
28
|
+
|
|
29
|
+
def _judge(replies):
|
|
30
|
+
"""A judge returning ``replies[artifact_id]`` and recording what it was shown."""
|
|
31
|
+
calls = []
|
|
32
|
+
|
|
33
|
+
def judge(**kw):
|
|
34
|
+
calls.append(kw)
|
|
35
|
+
reply = replies[kw["artifact_id"]]
|
|
36
|
+
if isinstance(reply, Exception):
|
|
37
|
+
raise reply
|
|
38
|
+
return reply
|
|
39
|
+
|
|
40
|
+
judge.calls = calls
|
|
41
|
+
return judge
|
|
42
|
+
|
|
43
|
+
|
|
44
|
+
def _reply(level, *, about=True, supported=True, useful=True, quote=""):
|
|
45
|
+
return {
|
|
46
|
+
"level": level,
|
|
47
|
+
"is_about": about,
|
|
48
|
+
"is_supported": supported,
|
|
49
|
+
"is_useful": useful,
|
|
50
|
+
"evidence_quote": quote,
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
|
|
54
|
+
POOL = [
|
|
55
|
+
_hit("graphy", "A graph library: nodes, edges, traversals."),
|
|
56
|
+
_hit("au", "An async task framework; jobs form a DAG."),
|
|
57
|
+
_hit("plotter", "Draws charts with networkx graph layouts."),
|
|
58
|
+
]
|
|
59
|
+
|
|
60
|
+
|
|
61
|
+
def test_every_candidate_is_graded_and_the_supported_gate_caps_on_word_distractors():
|
|
62
|
+
judge = _judge(
|
|
63
|
+
{
|
|
64
|
+
"graphy": _reply("core", quote="A graph library"),
|
|
65
|
+
# on-word but not supported: the judge over-grades, the gate caps it
|
|
66
|
+
"au": _reply("strong", supported=False, quote="jobs form a DAG"),
|
|
67
|
+
"plotter": _reply("uses-tools", quote="networkx graph layouts"),
|
|
68
|
+
}
|
|
69
|
+
)
|
|
70
|
+
judged = make_graded_rubric_evaluator(judge=judge)(TASK, POOL)
|
|
71
|
+
assert isinstance(judged, Judgement)
|
|
72
|
+
assert {aid: g.level for aid, g in judged.graded.items()} == {
|
|
73
|
+
"graphy": "core",
|
|
74
|
+
"au": "tangential",
|
|
75
|
+
"plotter": "uses-tools",
|
|
76
|
+
}
|
|
77
|
+
assert [h.artifact_id for h in judged.relevant] == ["graphy", "plotter"]
|
|
78
|
+
assert judged.sufficient and judged.refinement is None
|
|
79
|
+
assert len(judge.calls) == 3
|
|
80
|
+
|
|
81
|
+
|
|
82
|
+
def test_a_quote_not_found_verbatim_caps_the_level_unless_quotes_are_optional():
|
|
83
|
+
judge = _judge({"graphy": _reply("core", quote="the best graph toolkit")})
|
|
84
|
+
strict = make_graded_rubric_evaluator(judge=judge)(TASK, POOL[:1])
|
|
85
|
+
assert strict.graded["graphy"].level == "tangential"
|
|
86
|
+
assert strict.graded["graphy"].evidence_quote == ""
|
|
87
|
+
lax = make_graded_rubric_evaluator(judge=judge, require_evidence_quote=False)(
|
|
88
|
+
TASK, POOL[:1]
|
|
89
|
+
)
|
|
90
|
+
assert lax.graded["graphy"].level == "core"
|
|
91
|
+
|
|
92
|
+
|
|
93
|
+
def test_the_calibration_offset_demotes_an_over_grading_judge():
|
|
94
|
+
judge = _judge({"graphy": _reply("core", quote="graph library")})
|
|
95
|
+
ev = make_graded_rubric_evaluator(judge=judge, calibration_offset=1.0)
|
|
96
|
+
assert ev(TASK, POOL[:1]).graded["graphy"].level == "strong"
|
|
97
|
+
|
|
98
|
+
|
|
99
|
+
def test_a_failing_or_unparseable_judge_leaves_the_candidate_ungraded():
|
|
100
|
+
judge = _judge(
|
|
101
|
+
{
|
|
102
|
+
"graphy": json.dumps(_reply("core", quote="graph library")), # raw text ok
|
|
103
|
+
"au": RuntimeError("rate limited"),
|
|
104
|
+
"plotter": '{"level": "excellent"}', # not a level
|
|
105
|
+
}
|
|
106
|
+
)
|
|
107
|
+
judged = make_graded_rubric_evaluator(judge=judge)(TASK, POOL)
|
|
108
|
+
assert set(judged.graded) == {"graphy"}
|
|
109
|
+
assert [h.artifact_id for h in judged.relevant] == ["graphy"]
|
|
110
|
+
|
|
111
|
+
|
|
112
|
+
def test_level_options_are_shown_in_a_fresh_order_each_call():
|
|
113
|
+
judge = _judge({h.artifact_id: _reply("none") for h in POOL})
|
|
114
|
+
ev = make_graded_rubric_evaluator(judge=judge, rng=random.Random(0))
|
|
115
|
+
for _ in range(4):
|
|
116
|
+
ev(TASK, POOL)
|
|
117
|
+
orders = {c["levels"] for c in judge.calls}
|
|
118
|
+
assert len(orders) > 1
|
|
119
|
+
assert all(sorted(o.split("\n")) == sorted(f"- {lv}" for lv in DEFAULT_LEVELS) for o in orders)
|
|
120
|
+
|
|
121
|
+
|
|
122
|
+
def test_the_refine_policy_drives_the_back_edge_through_the_agent():
|
|
123
|
+
corpus = {
|
|
124
|
+
"graph library": [_hit("au", "An async task framework; jobs form a DAG.")],
|
|
125
|
+
"graph library nodes edges": [_hit("graphy", "A graph library: nodes, edges.")],
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
def retriever(query, **kw):
|
|
129
|
+
return list(corpus.get(query, []))
|
|
130
|
+
|
|
131
|
+
judge = _judge(
|
|
132
|
+
{
|
|
133
|
+
"au": _reply("core", supported=False, quote="jobs form a DAG"),
|
|
134
|
+
"graphy": _reply("core", quote="A graph library"),
|
|
135
|
+
}
|
|
136
|
+
)
|
|
137
|
+
|
|
138
|
+
def refine(task, graded):
|
|
139
|
+
if any(g.level in ("core", "strong") for g in graded.values()):
|
|
140
|
+
return None
|
|
141
|
+
return SubTask(goal=task.goal + " nodes edges", sources=task.sources)
|
|
142
|
+
|
|
143
|
+
agent = make_search_agent(
|
|
144
|
+
{"pkgs": retriever},
|
|
145
|
+
evaluator=make_graded_rubric_evaluator(judge=judge, refine=refine),
|
|
146
|
+
budget=Budget(max_rounds=3),
|
|
147
|
+
)
|
|
148
|
+
assert [h.artifact_id for h in agent("graph library")] == ["graphy"]
|
|
149
|
+
|
|
150
|
+
|
|
151
|
+
def test_binary_judgements_are_unchanged():
|
|
152
|
+
assert Judgement(relevant=[], sufficient=True).graded == {}
|
|
153
|
+
label = GradedLabel("core", True, True, True)
|
|
154
|
+
assert label.evidence_quote == "" and label.facet is None
|
|
155
|
+
|
|
156
|
+
|
|
157
|
+
def test_unknown_level_names_are_refused():
|
|
158
|
+
import pytest
|
|
159
|
+
|
|
160
|
+
with pytest.raises(ValueError, match="relevant_level"):
|
|
161
|
+
make_graded_rubric_evaluator(judge=_judge({}), relevant_level="great")
|
|
162
|
+
|
|
163
|
+
|
|
164
|
+
def test_the_same_id_in_two_sources_is_judged_per_source():
|
|
165
|
+
a = SearchHit("x", "k", 1.0, "A graph library for nodes.", {}, source="A")
|
|
166
|
+
b = SearchHit("x", "k", 1.0, "An audio decoder.", {}, source="B")
|
|
167
|
+
|
|
168
|
+
def judge(**kw):
|
|
169
|
+
if "graph" in kw["content"]:
|
|
170
|
+
return _reply("core", quote="A graph library")
|
|
171
|
+
return _reply("none")
|
|
172
|
+
|
|
173
|
+
judged = make_graded_rubric_evaluator(judge=judge)(TASK, [a, b])
|
|
174
|
+
assert [h.source for h in judged.relevant] == ["A"]
|
|
175
|
+
assert judged.graded["x"].level == "core" # the best label across sources
|
|
176
|
+
|
|
177
|
+
|
|
178
|
+
def test_custom_levels_match_whatever_their_case():
|
|
179
|
+
judge = _judge({"graphy": _reply("core", quote="A graph library")})
|
|
180
|
+
ev = make_graded_rubric_evaluator(
|
|
181
|
+
judge=judge, levels=("Core", "Tangential", "None"),
|
|
182
|
+
unsupported_cap="Tangential", relevant_level="Core",
|
|
183
|
+
)
|
|
184
|
+
assert ev(TASK, POOL[:1]).graded["graphy"].level == "Core"
|
|
185
|
+
|
|
186
|
+
|
|
187
|
+
def test_a_judge_that_fails_on_every_candidate_raises():
|
|
188
|
+
import pytest
|
|
189
|
+
|
|
190
|
+
judge = _judge({h.artifact_id: RuntimeError("no key") for h in POOL})
|
|
191
|
+
with pytest.raises(RuntimeError, match="no key"):
|
|
192
|
+
make_graded_rubric_evaluator(judge=judge)(TASK, POOL)
|
|
193
|
+
|
|
194
|
+
|
|
195
|
+
def test_a_candidate_is_judged_once_per_goal_and_its_label_kept():
|
|
196
|
+
judge = _judge({"graphy": _reply("core", quote="A graph library")})
|
|
197
|
+
ev = make_graded_rubric_evaluator(judge=judge)
|
|
198
|
+
ev(TASK, POOL[:1])
|
|
199
|
+
judge_down = ev(TASK, POOL[:1]) # no new call: the label is remembered
|
|
200
|
+
assert len(judge.calls) == 1
|
|
201
|
+
assert [h.artifact_id for h in judge_down.relevant] == ["graphy"]
|
|
202
|
+
|
|
203
|
+
|
|
204
|
+
def test_a_half_level_offset_shifts_every_level_alike():
|
|
205
|
+
from raglab import apply_gates
|
|
206
|
+
|
|
207
|
+
content = "A graph library."
|
|
208
|
+
shifted = [
|
|
209
|
+
apply_gates(GradedLabel(lv, True, True, True, "graph library"), content,
|
|
210
|
+
calibration_offset=0.5).level
|
|
211
|
+
for lv in DEFAULT_LEVELS[:-1]
|
|
212
|
+
]
|
|
213
|
+
assert shifted == list(DEFAULT_LEVELS[1:])
|
|
214
|
+
|
|
215
|
+
|
|
216
|
+
def test_a_one_word_quote_is_not_evidence():
|
|
217
|
+
from raglab import apply_gates
|
|
218
|
+
|
|
219
|
+
label = GradedLabel("core", True, True, True, "a")
|
|
220
|
+
assert apply_gates(label, "A graph library.").level == "tangential"
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|