File size: 8,368 Bytes
5db721a
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
a46649b
5db721a
 
 
 
 
 
 
a46649b
 
 
 
 
 
 
 
 
 
 
 
 
5db721a
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
"""
Evaluate the NextTerm model on synthetic polynomial sequences (arithmetic through
quartic) with varying amounts of prior context.

For each prior term count (default: 2-25 for linear, 3-25 for quadratic,
4-25 for cubic, 5-25 for quartic), we sample sequences from
ax^4 + bx^3 + cx^2 + dx + e with coefficient ranges:
    e in [0, 99999]
    d in [0, 9999]
    c in [0, 999]
    b in [0, 99]
    a in [0, 9]

Higher-order coefficients are set to 0 for lower-degree tests (e.g., arithmetic
sequences only use d and e).
"""

import argparse
import csv
import random
from dataclasses import dataclass
from pathlib import Path
from typing import Dict, List, Tuple

from mlx_lm import load
from mlx_lm.generate import BatchGenerator
from mlx_lm.tuner.utils import print_trainable_parameters
from tqdm import tqdm

SCRIPT_DIR = Path(__file__).resolve().parent


def default_model_path() -> str:
    if (SCRIPT_DIR / "model.safetensors").exists():
        return str(SCRIPT_DIR)
    local_model = SCRIPT_DIR / "NextTerm-47M"
    if local_model.exists():
        return str(local_model)
    return "N8Programs/NextTerm-47M"


MODEL_NAME = default_model_path()
MAX_NEW_TOKENS = 20
DEFAULT_MAX_TERMS = 25
SAMPLES_PER_K = 200
RANDOM_SEED = 0

COEFF_MAX = {"a": 9, "b": 99, "c": 999, "d": 9999, "e": 99999}


@dataclass(frozen=True)
class PolynomialTask:
    name: str
    degree: int
    min_terms: int


TASKS = (
    PolynomialTask("arithmetic", 1, 2),
    PolynomialTask("quadratic", 2, 3),
    PolynomialTask("cubic", 3, 4),
    PolynomialTask("quartic", 4, 5),
)


def parse_generated(text: str):
    if "," in text:
        text = text.split(",")[0]
    try:
        return int(text)
    except ValueError:
        print(f"Could not parse generated text: {text!r}")
        return None


def polynomial_value(coeffs: Tuple[int, int, int, int, int], x: int) -> int:
    a, b, c, d, e = coeffs
    return (
        a * (x**4)
        + b * (x**3)
        + c * (x**2)
        + d * x
        + e
    )


def sample_coefficients(
    degree: int, rng: random.Random
) -> Tuple[int, int, int, int, int]:
    a = rng.randint(0, COEFF_MAX["a"]) if degree >= 4 else 0
    b = rng.randint(0, COEFF_MAX["b"]) if degree >= 3 else 0
    c = rng.randint(0, COEFF_MAX["c"]) if degree >= 2 else 0
    d = rng.randint(0, COEFF_MAX["d"]) if degree >= 1 else 0
    e = rng.randint(0, COEFF_MAX["e"])
    return a, b, c, d, e


def generate_polynomial_sequences(
    task: PolynomialTask, max_terms: int, samples_per_k: int, rng: random.Random
) -> List[Dict[str, int | List[int] | str]]:
    sequences = []
    for k in range(task.min_terms, max_terms + 1):
        for _ in range(samples_per_k):
            coeffs = sample_coefficients(task.degree, rng)
            seq = [polynomial_value(coeffs, i) for i in range(k + 1)]
            sequences.append(
                {"k": k, "prompt": seq[:-1], "answer": seq[-1], "task": task.name}
            )
    return sequences


def build_prompts(
    sequences: List[Dict[str, int | List[int] | str]], tokenizer
) -> Tuple[List[List[int]], List[Dict[str, int | List[int] | str]]]:
    prompts = []
    metadata = []
    for record in sequences:
        prompt_text = ",".join(str(x) for x in record["prompt"]) + ","
        prompts.append(tokenizer.encode(prompt_text))
        metadata.append(record)
    return prompts, metadata


def evaluate_task(
    task: PolynomialTask,
    args,
    model,
    tokenizer,
    sep_token: int,
) -> Tuple[Dict[int, Dict[str, int]], List[Dict[str, object]]]:
    rng = random.Random(args.seed + task.degree)
    sequences = generate_polynomial_sequences(
        task, args.max_terms, args.samples_per_k, rng
    )
    if not sequences:
        print(
            f"Skipping {task.name}: min_terms {task.min_terms} exceeds max_terms "
            f"{args.max_terms}"
        )
        return {}, []

    print(
        f"\nEvaluating {task.name} sequences (degree {task.degree}) with "
        f"{len(sequences)} samples ({args.samples_per_k} per prior-term count)"
    )

    prompts, metadata = build_prompts(sequences, tokenizer)

    gen = BatchGenerator(model, stop_tokens=[[sep_token], [tokenizer.eos_token_id]])
    uids = gen.insert(prompts, [args.max_new_tokens] * len(prompts))

    meta_by_uid = dict(zip(uids, metadata))
    results = {uid: [] for uid in uids}
    finished = set()
    with tqdm(total=len(uids), desc=f"{task.name.title()}") as pbar:
        while True:
            responses = gen.next()
            if not isinstance(responses, tuple) or len(responses) != 2:
                raise RuntimeError(
                    "Unexpected mlx_lm BatchGenerator.next() API. "
                    "Update your mlx_lm version"
                )
            prompt_responses, generation_responses = responses
            if not prompt_responses and not generation_responses:
                break
            if not generation_responses:
                continue
            for r in generation_responses:
                results[r.uid].append(r.token)
                if r.finish_reason == "stop" and r.uid not in finished:
                    finished.add(r.uid)
                    pbar.update(1)
    gen.close()

    stats = {
        k: {"correct": 0, "parsed": 0, "total": 0}
        for k in range(task.min_terms, args.max_terms + 1)
    }

    for uid in uids:
        tokens = results[uid]
        text = tokenizer.decode(tokens[:-1]) if tokens else ""
        prediction = parse_generated(text)

        meta = meta_by_uid[uid]
        k = meta["k"]
        answer = meta["answer"]

        stats[k]["total"] += 1
        if prediction is not None:
            stats[k]["parsed"] += 1
            if prediction == answer:
                stats[k]["correct"] += 1

    print("Accuracy by prior term count:")
    csv_rows: List[Dict[str, object]] = []
    for k in range(task.min_terms, args.max_terms + 1):
        s = stats[k]
        accuracy = s["correct"] / s["total"] if s["total"] else 0.0
        print(
            f"{k} terms: parsed {s['parsed']}/{s['total']} "
            f"accuracy {s['correct']}/{s['total']} = {accuracy:.4f}"
        )
        csv_rows.append(
            {
                "task": task.name,
                "degree": task.degree,
                "k": k,
                "parsed": s["parsed"],
                "total": s["total"],
                "correct": s["correct"],
                "accuracy": accuracy,
            }
        )

    overall_total = sum(s["total"] for s in stats.values())
    overall_parsed = sum(s["parsed"] for s in stats.values())
    overall_correct = sum(s["correct"] for s in stats.values())
    overall_accuracy = overall_correct / overall_total if overall_total else 0.0
    print(
        f"Overall {task.name}: parsed {overall_parsed}/{overall_total} "
        f"accuracy {overall_correct}/{overall_total} = {overall_accuracy:.4f}"
    )

    return stats, csv_rows


def write_csv(rows: List[Dict[str, object]], path: str) -> None:
    if not rows:
        print("No results to write to CSV.")
        return

    fieldnames = ["task", "degree", "k", "parsed", "total", "correct", "accuracy"]
    with open(path, "w", newline="") as f:
        writer = csv.DictWriter(f, fieldnames=fieldnames)
        writer.writeheader()
        writer.writerows(rows)
    print(f"Wrote results to {path}")


def evaluate(args):
    random.seed(args.seed)

    model, tokenizer = load(args.model_name)

    print_trainable_parameters(model)

    sep_token = tokenizer.encode("1,")[-1]
    all_rows: List[Dict[str, object]] = []
    for task in TASKS:
        _, rows = evaluate_task(task, args, model, tokenizer, sep_token)
        all_rows.extend(rows)

    if args.csv_path:
        write_csv(all_rows, args.csv_path)


def parse_args():
    parser = argparse.ArgumentParser()
    parser.add_argument("--model_name", default=MODEL_NAME)
    parser.add_argument("--max_new_tokens", type=int, default=MAX_NEW_TOKENS)
    parser.add_argument("--max_terms", type=int, default=DEFAULT_MAX_TERMS)
    parser.add_argument("--samples_per_k", type=int, default=SAMPLES_PER_K)
    parser.add_argument("--seed", type=int, default=RANDOM_SEED)
    parser.add_argument("--csv_path", type=str, default=None)
    return parser.parse_args()


def main():
    args = parse_args()
    evaluate(args)


if __name__ == "__main__":
    main()