-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathbenchmark_harness.py
More file actions
1485 lines (1312 loc) · 58.7 KB
/
Copy pathbenchmark_harness.py
File metadata and controls
1485 lines (1312 loc) · 58.7 KB
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
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
"""
Benchmark Harness + Budget-Aware Profile Selector
Usage
-----
# Run from CLI:
python benchmark_harness.py --profile tiny_cpu --output bench.json
# Programmatic:
from benchmark_harness import BenchmarkHarness, BudgetProfileSelector, RegressionGate
harness = BenchmarkHarness()
results = harness.run_merge_benchmark(base, ft_models, strategies=["ties","dare"], eval_fn=eval_fn)
ranked = harness.rank_strategies(results)
selector = BudgetProfileSelector()
merge_cfg, bon_cfg, mcts_cfg, spec_cfg = selector.select(
{"max_ram_gb": 8, "has_gpu": False, "latency_budget_ms": 500, "quality_priority": True}
)
"""
from __future__ import annotations
import json
import logging
import os
import sys
import time
import tracemalloc
from pathlib import Path
from typing import Any, Callable, Dict, List, Optional, Tuple
import torch
import torch.nn as nn
from model_merging import MergeConfig, ModelMerger
from inference_optimizations import (
BestOfNConfig,
BestOfNSampler,
MCTSConfig,
SpeculativeDecoderConfig,
)
from telemetry import TelemetryRecorder
try:
import resource
except Exception:
resource = None
logger = logging.getLogger("BenchmarkHarness")
# =============================================================================
# RESULT SCHEMA VERSION
# =============================================================================
SCHEMA_VERSION = "1.0"
DEFAULT_BASE_MODEL = os.getenv("RLHF_BASE_MODEL", "Qwen/Qwen3-1.7B")
DEFAULT_ADAPTER_PATH = os.getenv(
"RLHF_SFT_ADAPTER",
str(Path(__file__).resolve().parent / "checkpoints" / "checkpoints" / "full_pipeline" / "sft"),
)
DEFAULT_PROMPTS: List[str] = [
"Explain what reinforcement learning is in simple terms.",
"Write a Python function that computes Fibonacci numbers iteratively.",
"What are the practical differences between DPO and PPO for alignment?",
"Solve: If 3x + 7 = 22, what is x?",
"Summarize why LoRA is useful for low-memory fine-tuning.",
]
def _get_process_peak_rss_mb() -> float:
"""
Return process peak RSS in MB when available, otherwise NaN.
Linux reports ru_maxrss in KiB, macOS reports bytes.
"""
if resource is None:
return float("nan")
usage = float(resource.getrusage(resource.RUSAGE_SELF).ru_maxrss)
if usage <= 0:
return float("nan")
if sys.platform == "darwin":
return usage / (1024.0 * 1024.0)
return usage / 1024.0
def _resolve_path_or_id(value: Optional[str]) -> Optional[str]:
"""Resolve local paths to absolute strings while preserving hub IDs."""
if not value:
return None
candidate = Path(value).expanduser()
if candidate.exists():
return str(candidate.resolve())
return value
def _parse_dtype(dtype_name: str) -> Optional[torch.dtype]:
"""Map CLI dtype string to torch dtype."""
mapping = {
"auto": None,
"float32": torch.float32,
"float16": torch.float16,
"bfloat16": torch.bfloat16,
}
if dtype_name not in mapping:
raise ValueError(f"Unsupported dtype '{dtype_name}'. Use one of: {', '.join(mapping.keys())}")
return mapping[dtype_name]
def _profile_default_bon_strategies(profile_name: str) -> List[str]:
"""Select default Best-of-N strategy set for each budget profile."""
if profile_name == "tiny_cpu":
return ["bon_n2", "bon_n4"]
if profile_name == "balanced_cpu":
return ["bon_n4", "bon_n8"]
if profile_name == "gpu_lowlatency":
return ["bon_n8", "bon_n12", "bon_n16"]
if profile_name == "gpu_maxquality":
return ["bon_n8", "bon_n16", "bon_n24"]
return ["bon_n4", "bon_n8", "bon_n16"]
def _load_prompts(prompts_file: Optional[str], max_prompts: int = 8) -> List[str]:
"""
Load prompts from txt/json/jsonl file, or return built-in defaults.
JSON can be:
- list[str]
- list[{"prompt": "..."}]
- {"prompts": [...]}
"""
prompts: List[str] = []
if prompts_file:
path = Path(prompts_file).expanduser().resolve()
if not path.exists():
raise FileNotFoundError(f"Prompts file not found: {path}")
suffix = path.suffix.lower()
if suffix == ".txt":
prompts = [line.strip() for line in path.read_text(encoding="utf-8").splitlines() if line.strip()]
elif suffix == ".jsonl":
for line in path.read_text(encoding="utf-8").splitlines():
if not line.strip():
continue
item = json.loads(line)
if isinstance(item, str):
prompts.append(item)
elif isinstance(item, dict):
val = item.get("prompt") or item.get("text")
if isinstance(val, str) and val.strip():
prompts.append(val.strip())
elif suffix == ".json":
payload = json.loads(path.read_text(encoding="utf-8"))
if isinstance(payload, dict):
payload = payload.get("prompts", [])
if isinstance(payload, list):
for item in payload:
if isinstance(item, str) and item.strip():
prompts.append(item.strip())
elif isinstance(item, dict):
val = item.get("prompt") or item.get("text")
if isinstance(val, str) and val.strip():
prompts.append(val.strip())
else:
raise ValueError(
f"Unsupported prompts file extension '{suffix}'. Use .txt, .json, or .jsonl"
)
else:
prompts = list(DEFAULT_PROMPTS)
prompts = prompts[:max(1, max_prompts)]
if not prompts:
raise ValueError("No prompts loaded. Provide a non-empty prompts file or omit --prompts-file.")
return prompts
class HeuristicRewardScorer:
"""
Lightweight fallback reward scorer for benchmarking when no reward model is provided.
Emphasizes coherent, non-repetitive completions with moderate length.
"""
@staticmethod
def _repeat_ratio(text: str) -> float:
tokens = text.split()
if len(tokens) < 3:
return 0.0
trigrams = [tuple(tokens[i:i + 3]) for i in range(len(tokens) - 2)]
unique = len(set(trigrams))
return 1.0 - (unique / max(1, len(trigrams)))
def score(self, prompt: str, completion: str = "") -> float:
text = completion.strip() if completion else prompt.strip()
if not text:
return 0.0
n_tokens = len(text.split())
length_term = min(n_tokens / 96.0, 1.0)
repeat_penalty = self._repeat_ratio(text)
punctuation_bonus = 0.05 if text.endswith((".", "!", "?")) else 0.0
return float(length_term - 0.5 * repeat_penalty + punctuation_bonus)
def score_batch(self, texts: List[str]) -> List[float]:
return [self.score(t) for t in texts]
def load_policy_with_optional_adapter(
base_model: str,
adapter_path: Optional[str] = None,
merged_model_path: Optional[str] = None,
merge_lora: bool = False,
device: str = "cpu",
dtype: str = "float32",
trust_remote_code: bool = True,
) -> Tuple[nn.Module, Any]:
"""
Load a policy model + tokenizer from:
1) merged model path, OR
2) base model + optional LoRA adapter path.
"""
from transformers import AutoModelForCausalLM, AutoTokenizer
resolved_merged = _resolve_path_or_id(merged_model_path)
resolved_adapter = _resolve_path_or_id(adapter_path)
resolved_base = _resolve_path_or_id(base_model) or base_model
torch_dtype = _parse_dtype(dtype)
load_kwargs = {
"low_cpu_mem_usage": True,
"trust_remote_code": trust_remote_code,
}
if torch_dtype is not None:
load_kwargs["dtype"] = torch_dtype
# Prefer tokenizer colocated with adapter/merged artifact if present
tokenizer_source = resolved_merged or resolved_adapter or resolved_base
tokenizer = AutoTokenizer.from_pretrained(tokenizer_source, trust_remote_code=trust_remote_code)
if resolved_merged:
logger.info(f"Loading merged policy model from: {resolved_merged}")
try:
model = AutoModelForCausalLM.from_pretrained(resolved_merged, **load_kwargs)
except TypeError:
# Backward compatibility with older transformers versions
legacy_kwargs = dict(load_kwargs)
legacy_kwargs.pop("dtype", None)
if torch_dtype is not None:
legacy_kwargs["torch_dtype"] = torch_dtype
model = AutoModelForCausalLM.from_pretrained(resolved_merged, **legacy_kwargs)
else:
logger.info(f"Loading base policy model: {resolved_base}")
try:
model = AutoModelForCausalLM.from_pretrained(resolved_base, **load_kwargs)
except TypeError:
legacy_kwargs = dict(load_kwargs)
legacy_kwargs.pop("dtype", None)
if torch_dtype is not None:
legacy_kwargs["torch_dtype"] = torch_dtype
model = AutoModelForCausalLM.from_pretrained(resolved_base, **legacy_kwargs)
if resolved_adapter:
try:
from peft import PeftModel
except Exception as exc:
raise RuntimeError(
"Adapter path provided but peft is not installed. "
"Install `peft` or provide --merged-model-path."
) from exc
logger.info(f"Applying adapter from: {resolved_adapter}")
model = PeftModel.from_pretrained(model, resolved_adapter)
if merge_lora:
logger.info("Merging adapter into base weights (merge_and_unload).")
model = model.merge_and_unload()
else:
logger.info("Keeping adapter as PEFT wrapper (no merge_and_unload).")
model = model.to(device)
model.eval()
return model, tokenizer
# =============================================================================
# BENCHMARK HARNESS
# =============================================================================
class BenchmarkHarness:
"""
Standardized eval matrix for merge strategies and inference presets.
All results are dicts keyed by strategy name, containing:
- wall_time_s — elapsed wall clock time
- peak_rss_mb — peak resident set size (MB)
- eval_score — quality proxy (from eval_fn, if provided)
- conflict_summary — from conflict_report (merge runs only)
- latency_p50_s — p50 latency (inference runs only)
- latency_p95_s — p95 latency (inference runs only)
- tokens_per_sec — throughput (inference runs only)
- reward_score — mean reward across prompts (inference runs only)
"""
def __init__(self, telemetry: Optional[TelemetryRecorder] = None):
self.telemetry = telemetry or TelemetryRecorder()
# ------------------------------------------------------------------
# Merge benchmark
# ------------------------------------------------------------------
def run_merge_benchmark(
self,
base_model: nn.Module,
ft_models: List[nn.Module],
strategies: List[str],
eval_fn: Optional[Callable[[nn.Module], float]] = None,
config_overrides: Optional[Dict[str, Dict]] = None,
) -> Dict[str, Dict]:
"""
Run each merge strategy and record timing, memory, eval score, conflict report.
Args:
base_model: Pre-trained base model
ft_models: List of fine-tuned models
strategies: e.g. ["task_arithmetic", "ties", "dare", "slerp"]
eval_fn: Optional quality proxy; receives merged model
config_overrides: Per-strategy MergeConfig kwargs override dict
Returns:
Dict[strategy_name -> result_dict]
"""
results = {}
config_overrides = config_overrides or {}
for strategy in strategies:
logger.info(f"[merge_benchmark] Running strategy: {strategy}")
try:
cfg_kwargs = {"method": strategy, **config_overrides.get(strategy, {})}
# SLERP requires exactly 2 models
effective_ft = ft_models[:2] if strategy == "slerp" else ft_models
merge_cfg = MergeConfig(**cfg_kwargs)
merger = ModelMerger(merge_cfg)
# Measure time + memory
tracemalloc.start()
t0 = time.perf_counter()
merged = merger.merge(base_model, effective_ft, merge_cfg)
wall_time = time.perf_counter() - t0
_, peak_mem = tracemalloc.get_traced_memory()
tracemalloc.stop()
peak_python_alloc_mb = peak_mem / 1024 / 1024
peak_rss_mb = _get_process_peak_rss_mb()
if peak_rss_mb != peak_rss_mb: # NaN fallback
peak_rss_mb = peak_python_alloc_mb
# Conflict report
base_state = base_model.state_dict()
ft_states = [m.state_dict() for m in effective_ft]
aligned = merger._align_keys(base_state, ft_states)
conflict = merger.compute_conflict_report(base_state, ft_states, aligned)
# Conflict summary scalars
if conflict:
mean_cosine = sum(v["cosine_conflict"] for v in conflict.values()) / len(conflict)
mean_sign_dis = sum(v["sign_disagreement_ratio"] for v in conflict.values()) / len(conflict)
else:
mean_cosine = mean_sign_dis = float("nan")
# Quality proxy
eval_score = eval_fn(merged) if eval_fn is not None else float("nan")
results[strategy] = {
"strategy": strategy,
"wall_time_s": wall_time,
"peak_rss_mb": peak_rss_mb,
"peak_python_alloc_mb": peak_python_alloc_mb,
"eval_score": eval_score,
"conflict_summary": {
"mean_cosine_conflict": mean_cosine,
"mean_sign_disagreement_ratio": mean_sign_dis,
"num_layers_analyzed": len(conflict),
},
}
self.telemetry.record_latency(f"merge_{strategy}", wall_time)
except Exception as exc:
logger.error(f"Strategy '{strategy}' failed: {exc}")
results[strategy] = {"strategy": strategy, "error": str(exc)}
return results
# ------------------------------------------------------------------
# Inference benchmark
# ------------------------------------------------------------------
def run_inference_benchmark(
self,
policy: Any,
reward: Any,
prompts: List[str],
tokenizer: Any,
strategies: Optional[List[str]] = None,
bon_config: Optional[BestOfNConfig] = None,
mcts_config: Optional[MCTSConfig] = None,
max_new_tokens: int = 128,
) -> Dict[str, Dict]:
"""
Benchmark Best-of-N sampling across different n_samples settings.
Args:
policy: Policy model (PolicyLike)
reward: Reward model (RewardScorerLike)
prompts: List of input prompts
tokenizer: Tokenizer
strategies: e.g. ["bon_n4", "bon_n8", "bon_n16"]
bon_config: Base BestOfNConfig (n_samples overridden per strategy)
Returns:
Dict[strategy_name -> result_dict]
"""
if strategies is None:
strategies = ["bon_n4", "bon_n8", "bon_n16"]
results = {}
base_cfg = bon_config or BestOfNConfig()
for strategy in strategies:
rec = TelemetryRecorder()
# Parse n_samples from strategy name if it matches bon_nN pattern
n_samples = base_cfg.n_samples
if strategy.startswith("bon_n"):
try:
n_samples = int(strategy[5:])
except ValueError:
pass
cfg_dict = vars(base_cfg).copy()
cfg_dict["n_samples"] = n_samples
cfg = BestOfNConfig(**cfg_dict)
sampler = BestOfNSampler(policy, reward, config=cfg, tokenizer=tokenizer)
logger.info(
f"[inference_benchmark] strategy={strategy} n_samples={n_samples} prompts={len(prompts)}"
)
latencies = []
reward_scores = []
total_tokens = 0
for idx, prompt in enumerate(prompts, start=1):
logger.info(
f"[inference_benchmark] strategy={strategy} prompt={idx}/{len(prompts)}"
)
t0 = time.perf_counter()
try:
result = sampler.generate(prompt, tokenizer, max_new_tokens=max_new_tokens)
lat = time.perf_counter() - t0
latencies.append(lat)
rec.record_latency(strategy, lat)
score = result.get("best_score", float("nan"))
reward_scores.append(score)
tokens = len(result.get("best", "").split())
total_tokens += tokens
rec.record_tokens(tokens)
except Exception as exc:
logger.warning(f"[{strategy}] prompt failed: {exc}")
snap = rec.snapshot()
lat_stats = snap["latency"].get(strategy, {})
total_latency_s = sum(latencies)
tokens_per_sec = (
total_tokens / total_latency_s
if total_latency_s > 0
else float("nan")
)
results[strategy] = {
"strategy": strategy,
"n_samples": n_samples,
"n_prompts": len(prompts),
"n_success": len(latencies),
"latency_p50_s": lat_stats.get("p50_s", float("nan")),
"latency_p95_s": lat_stats.get("p95_s", float("nan")),
"mean_latency_s": lat_stats.get("mean_s", float("nan")),
"total_tokens": total_tokens,
"tokens_per_sec": tokens_per_sec,
"reward_score_mean": (
sum(reward_scores) / len(reward_scores) if reward_scores else float("nan")
),
}
return results
def run_checkpoint_inference_benchmark(
self,
base_model: str = DEFAULT_BASE_MODEL,
adapter_path: Optional[str] = DEFAULT_ADAPTER_PATH,
merged_model_path: Optional[str] = None,
prompts: Optional[List[str]] = None,
profile_name: Optional[str] = None,
bon_config: Optional[BestOfNConfig] = None,
strategies: Optional[List[str]] = None,
max_new_tokens: int = 128,
merge_lora: bool = False,
device: str = "cpu",
dtype: str = "float32",
) -> Dict[str, Any]:
"""
End-to-end checkpoint benchmark:
load model/tokenizer -> run Best-of-N strategy sweep -> rank + summarize.
"""
policy, tokenizer = load_policy_with_optional_adapter(
base_model=base_model,
adapter_path=adapter_path,
merged_model_path=merged_model_path,
merge_lora=merge_lora,
device=device,
dtype=dtype,
)
reward = HeuristicRewardScorer()
active_profile = profile_name or "custom"
active_strategies = strategies or _profile_default_bon_strategies(active_profile)
active_prompts = prompts or list(DEFAULT_PROMPTS)
active_bon = bon_config or BestOfNConfig()
bench_results = self.run_inference_benchmark(
policy=policy,
reward=reward,
prompts=active_prompts,
tokenizer=tokenizer,
strategies=active_strategies,
bon_config=active_bon,
max_new_tokens=max_new_tokens,
)
quality_rank = self.rank_strategies(
bench_results, objective="reward_score_mean", higher_is_better=True
)
latency_rank = self.rank_strategies(
bench_results, objective="latency_p95_s", higher_is_better=False
)
recommended = quality_rank[0] if quality_rank else None
return {
"profile": active_profile,
"strategies": active_strategies,
"prompts_evaluated": len(active_prompts),
"max_new_tokens": max_new_tokens,
"recommendation": {
"best_quality": recommended,
"quality_ranking": quality_rank,
"latency_ranking": latency_rank,
},
"results": bench_results,
}
# ------------------------------------------------------------------
# PRM benchmark lane
# ------------------------------------------------------------------
@staticmethod
def load_prm_adapter(
prm_path: str,
tokenizer: Any,
device: str = "cpu",
process_weight: float = 0.0,
) -> Optional[Any]:
"""
Load ProcessRewardModel from prm_path and return a ProcessRewardModelAdapter.
Returns None gracefully when rlhf unavailable or weights missing.
prm_path must be a directory with model.pt + process_reward_model_meta.json.
Args:
prm_path: Path to saved ProcessRewardModel checkpoint directory.
tokenizer: HuggingFace-compatible tokenizer for the adapter.
device: Target device string (e.g. 'cpu', 'cuda').
process_weight: Blend weight for process rewards vs outcome reward.
Returns:
ProcessRewardModelAdapter on success, None on any failure.
"""
try:
from rlhf import ProcessRewardModel
from inference_protocols import ProcessRewardModelAdapter
except Exception as exc:
logger.warning(f"load_prm_adapter: import failed ({exc}); PRM unavailable.")
return None
try:
prm = ProcessRewardModel.from_pretrained(prm_path)
d = torch.device(device)
prm = prm.to(d).eval()
adapter = ProcessRewardModelAdapter.from_rlhf_model(
prm, tokenizer, device=d, process_weight=process_weight
)
logger.info(f"PRM adapter loaded from: {prm_path}")
return adapter
except Exception as exc:
logger.warning(f"load_prm_adapter: failed to load '{prm_path}': {exc}")
return None
def run_prm_inference_benchmark(
self,
policy: Any,
tokenizer: Any,
prompts: List[str],
prm_adapter: Optional[Any] = None,
bon_config: Optional[BestOfNConfig] = None,
max_new_tokens: int = 128,
) -> Dict[str, Any]:
"""
Two-lane benchmark: rm_only (HeuristicRewardScorer) vs prm_rerank.
Each lane delegates to run_inference_benchmark() for consistent
latency/token tracking. scoring_mode label is injected into each
result dict.
Args:
policy: Policy model for generation.
tokenizer: HuggingFace-compatible tokenizer.
prompts: List of prompt strings to evaluate.
prm_adapter: Optional ProcessRewardModelAdapter for the PRM lane.
bon_config: Base BestOfNConfig; overridden per lane.
max_new_tokens: Generation length cap.
Returns:
Dict with keys 'rm_only', 'prm_rerank' (if available), and 'summary'.
"""
base_cfg = bon_config or BestOfNConfig()
# Derive strategy label from n_samples so run_inference_benchmark()
# does not silently override the caller's n_samples when parsing the
# strategy name (e.g. "bon_n4" would override n_samples=8).
strategy_label = f"bon_n{base_cfg.n_samples}"
results: Dict[str, Any] = {}
# Lane 1: heuristic RM, no step reranking
rm_cfg_dict = vars(base_cfg).copy()
rm_cfg_dict.update({"step_rerank": False, "step_prm": None})
rm_results = self.run_inference_benchmark(
policy=policy,
reward=HeuristicRewardScorer(),
prompts=prompts,
tokenizer=tokenizer,
strategies=[strategy_label],
bon_config=BestOfNConfig(**rm_cfg_dict),
max_new_tokens=max_new_tokens,
)
rm_result = rm_results.get(strategy_label, {})
rm_result["scoring_mode"] = "rm_only"
results["rm_only"] = rm_result
# Lane 2: PRM reranking
if prm_adapter is not None:
prm_cfg_dict = vars(base_cfg).copy()
prm_cfg_dict.update({"step_rerank": True, "step_prm": prm_adapter})
prm_results = self.run_inference_benchmark(
policy=policy,
reward=prm_adapter,
prompts=prompts,
tokenizer=tokenizer,
strategies=[strategy_label],
bon_config=BestOfNConfig(**prm_cfg_dict),
max_new_tokens=max_new_tokens,
)
prm_result = prm_results.get(strategy_label, {})
prm_result["scoring_mode"] = "prm_rerank"
results["prm_rerank"] = prm_result
# Telemetry
n_success = int(prm_result.get("n_success", 0))
for _ in range(n_success):
self.telemetry.record_prm_event(
mode="rerank",
outcome_score=float(prm_result.get("reward_score_mean", float("nan"))),
)
rm_mean = float(rm_result.get("reward_score_mean", float("nan")))
prm_mean = float(results.get("prm_rerank", {}).get("reward_score_mean", float("nan")))
results["summary"] = {
"rm_only_reward_mean": rm_mean,
"prm_rerank_reward_mean": prm_mean,
"prm_available": prm_adapter is not None,
"lanes_run": [k for k in results if k != "summary"],
}
return results
# ------------------------------------------------------------------
# Ranking
# ------------------------------------------------------------------
def rank_strategies(
self,
results: Dict[str, Dict],
objective: str = "eval_score",
higher_is_better: bool = True,
) -> List[str]:
"""
Sort strategies by a scalar objective.
Args:
results: Output of run_merge_benchmark or run_inference_benchmark
objective: Key to sort by (e.g. "eval_score", "latency_p50_s")
higher_is_better: True for quality metrics, False for latency/RAM
Returns:
Sorted list of strategy names (best first)
"""
def get_score(name: str) -> float:
val = results[name].get(objective, float("nan"))
if val != val: # nan check
return float("-inf") if higher_is_better else float("inf")
return float(val)
names = [n for n in results if "error" not in results[n]]
return sorted(names, key=get_score, reverse=higher_is_better)
# ------------------------------------------------------------------
# Report emit
# ------------------------------------------------------------------
def emit_report(self, results: Dict[str, Dict], path: str) -> None:
"""Write benchmark report JSON with schema version."""
report = {
"schema_version": SCHEMA_VERSION,
"emitted_at_unix": time.time(),
"results": results,
}
out = Path(path)
out.parent.mkdir(parents=True, exist_ok=True)
with out.open("w", encoding="utf-8") as fh:
json.dump(report, fh, indent=2, default=str)
logger.info(f"Benchmark report written to {out}")
def run_tree_grpo_benchmark(
self,
policy: Any,
reference_model: Any,
tokenizer: Any,
mcts_generator: Any,
reward_fn: Callable,
prompts: List[str],
tree_grpo_config: Optional[Any] = None,
n_steps: int = 5,
) -> Dict[str, Any]:
"""Benchmark Tree-GRPO training quality end-to-end.
Collects grouped MCTS rollouts for ``prompts``, runs ``n_steps`` of
Tree-GRPO training, and reports:
- ``n_groups_collected``: sibling groups produced by the search.
- ``mean_reward``: mean reward across all rollout samples.
- ``mean_advantage_std``: mean within-group advantage standard deviation.
- ``loss_trajectory``: loss value at each of the ``n_steps`` steps.
- ``reward_improvement``: delta between pre- and post-training reward on
a held-out generation from the policy.
**Rollout source**: this benchmark always uses MCTS collection
(``TreeRolloutCollector``) regardless of ``tree_grpo_config.rollout_source``.
To benchmark A* or mixed-source collection, call ``_run_tree_grpo()``
directly via ``RLHFOrchestrator.run_policy_optimization()``.
Returns a result dict compatible with ``rank_strategies()`` and
``emit_report()``.
"""
import time
result: Dict[str, Any] = {
"benchmark": "tree_grpo",
"n_prompts": len(prompts),
"n_steps": n_steps,
}
try:
from inference_optimizations import TreeRolloutCollector # type: ignore
from rlhf import TreeGRPOConfig, TreeGRPOTrainer # type: ignore
collector = TreeRolloutCollector(
mcts_generator=mcts_generator,
reward_fn=reward_fn,
)
t0 = time.perf_counter()
grouped = collector.collect_grouped(prompts, n_samples_per_prompt=4)
collect_elapsed = time.perf_counter() - t0
all_samples = [s for samps in grouped.values() for s in samps]
n_groups = len(grouped)
mean_reward = (
sum(s.reward for s in all_samples) / len(all_samples)
if all_samples else float("nan")
)
# Per-group advantage std (intra-tree spread).
group_stds = []
for samps in grouped.values():
if len(samps) >= 2:
rewards = [s.reward for s in samps]
mu = sum(rewards) / len(rewards)
std = (sum((r - mu) ** 2 for r in rewards) / len(rewards)) ** 0.5
group_stds.append(std)
mean_adv_std = sum(group_stds) / len(group_stds) if group_stds else float("nan")
if all_samples:
self.telemetry.record_tree_rollout(
n_prompts=len({s.prompt for s in all_samples}),
n_samples=len(all_samples),
n_groups=n_groups,
mean_reward=mean_reward,
mean_depth=sum(s.depth for s in all_samples) / len(all_samples),
source="mcts",
)
if tree_grpo_config is None:
tree_grpo_config = TreeGRPOConfig(
output_dir="/tmp/tree_grpo_bench",
min_group_size=2,
)
rollout_source = getattr(tree_grpo_config, "rollout_source", "mcts")
if rollout_source != "mcts":
logger.warning(
"run_tree_grpo_benchmark: tree_grpo_config.rollout_source=%r but this "
"benchmark always uses MCTS collection. A* and mixed sources are only "
"available via RLHFOrchestrator.run_policy_optimization('tree_grpo', ...).",
rollout_source,
)
trainer = TreeGRPOTrainer(
policy_model=policy,
reference_model=reference_model,
tokenizer=tokenizer,
config=tree_grpo_config,
reward_fn=reward_fn,
telemetry=self.telemetry,
)
t1 = time.perf_counter()
metrics = trainer.train(grouped, num_steps=n_steps)
train_elapsed = time.perf_counter() - t1
loss_traj = [m["loss"] for m in metrics.get("metrics", [])]
result.update({
"n_groups_collected": n_groups,
"n_samples_collected": len(all_samples),
"mean_reward": mean_reward,
"mean_advantage_std": mean_adv_std,
"loss_trajectory": loss_traj,
"collect_elapsed_s": collect_elapsed,
"train_elapsed_s": train_elapsed,
"status": "ok",
})
except Exception as exc:
result["status"] = "error"
result["error"] = str(exc)
logger.warning("run_tree_grpo_benchmark failed: %s", exc)
return result
def run_search_quality_benchmark(
self,
policy: Any,
reward_fn: Callable,
tokenizer: Any,
prompts: List[str],
mcts_config: Optional[Any] = None,
astar_config: Optional[Any] = None,
bon_config: Optional[Any] = None,
mcts_generator: Optional[Any] = None,
astar_generator: Optional[Any] = None,
max_new_tokens: int = 128,
) -> Dict[str, Dict[str, Any]]:
"""Compare MCTS vs A* vs BestOfN vs greedy across prompts.
Each strategy is run over the same ``prompts`` list. Reports
per-strategy: ``mean_reward``, ``latency_p50_s``, ``nodes_expanded``,
``tokens_per_sec``.
Uses ``run_inference_benchmark()`` internally for the BestOfN lane and
adds MCTS/A* lanes on top. When active runtime generators are supplied,
the benchmark reuses them so radix caching, speculative rollouts, and
explicit pruning are measured instead of silently constructing a flat
replacement generator with default wiring.
"""
import time
results: Dict[str, Dict[str, Any]] = {}
def _completion(prompt: str, state: str) -> str:
return state[len(prompt):] if state.startswith(prompt) else state
def _score(prompt: str, state: str) -> float:
return float(reward_fn(prompt, _completion(prompt, state)))
# --- Greedy baseline ---
try:
from inference_optimizations import MCTSConfig, MCTSGenerator # type: ignore
greedy_rewards: List[float] = []
greedy_latencies: List[float] = []
for prompt in prompts:
t0 = time.perf_counter()
enc = tokenizer(prompt, return_tensors="pt")
with torch.no_grad():
out = policy.generate(
input_ids=enc["input_ids"],
max_new_tokens=max_new_tokens,
do_sample=False,
)
text = tokenizer.decode(out[0], skip_special_tokens=True)
greedy_latencies.append(time.perf_counter() - t0)
greedy_rewards.append(_score(prompt, text))
results["greedy"] = {
"mean_reward": sum(greedy_rewards) / len(greedy_rewards),
"latency_p50_s": sorted(greedy_latencies)[len(greedy_latencies) // 2],
"nodes_expanded": 1,
}
except Exception as exc:
results["greedy"] = {"status": "error", "error": str(exc)}
# --- MCTS ---
try:
from inference_optimizations import MCTSConfig, MCTSGenerator # type: ignore
cfg = (
getattr(mcts_generator, "config", None)
or mcts_config
or MCTSConfig(n_simulations=20)
)
mcts_gen = mcts_generator or MCTSGenerator(
policy,
None,
tokenizer,
config=cfg,
)
mcts_rewards: List[float] = []
mcts_latencies: List[float] = []
mcts_expansions: List[int] = []
last_mcts_telemetry: Dict[str, Any] = {}
for prompt in prompts:
t0 = time.perf_counter()
bound_reward = lambda state, active_prompt=prompt: _score(active_prompt, state)
result = mcts_gen.generate(prompt, max_new_tokens, bound_reward)
mcts_latencies.append(time.perf_counter() - t0)
mcts_rewards.append(_score(prompt, result.get("text", "")))
tree_stats = result.get("tree_stats", {})
expansions = int(tree_stats.get("simulations", cfg.n_simulations))
mcts_expansions.append(expansions)
self.telemetry.record_search_budget(
generator_type="mcts",
n_expansions=expansions,
budget_total=cfg.n_simulations,
mean_depth=float(
tree_stats.get("max_observed_depth", float("nan"))
),
)
last_mcts_telemetry = {
"tree_stats": tree_stats,
"process_pruning_stats": result.get("process_pruning_stats", {}),
"rollout_stats": result.get("rollout_stats", {}),
"cache_stats": result.get("cache_stats", {}),
"speculative_stats": result.get("speculative_stats", {}),
}
results["mcts"] = {
"mean_reward": sum(mcts_rewards) / len(mcts_rewards),
"latency_p50_s": sorted(mcts_latencies)[len(mcts_latencies) // 2],
"nodes_expanded": sum(mcts_expansions) / len(mcts_expansions),
"runtime_generator_reused": mcts_generator is not None,
**last_mcts_telemetry,
}
except Exception as exc:
results["mcts"] = {"status": "error", "error": str(exc)}
# --- A* ---
try:
from inference_optimizations import AStarConfig, AStarGenerator # type: ignore
cfg = (
getattr(astar_generator, "config", None)
or astar_config
or AStarConfig(max_nodes=50)
)
astar_gen = astar_generator or AStarGenerator(
policy,
tokenizer,
config=cfg,
)
astar_rewards: List[float] = []
astar_latencies: List[float] = []
astar_expanded: List[int] = []
last_astar_cache_stats: Dict[str, Any] = {}
for prompt in prompts:
t0 = time.perf_counter()
bound_reward = lambda state, active_prompt=prompt: _score(active_prompt, state)
result = astar_gen.generate(prompt, reward_fn=bound_reward)
astar_latencies.append(time.perf_counter() - t0)
astar_rewards.append(_score(prompt, result.get("text", "")))
expansions = int(result.get("nodes_expanded", cfg.max_nodes))
astar_expanded.append(expansions)
self.telemetry.record_search_budget(
generator_type="astar",
n_expansions=expansions,
budget_total=cfg.max_nodes,
mean_depth=float(result.get("depth", float("nan"))),
)
last_astar_cache_stats = result.get("cache_stats", {})
results["astar"] = {
"mean_reward": sum(astar_rewards) / len(astar_rewards),
"latency_p50_s": sorted(astar_latencies)[len(astar_latencies) // 2],
"nodes_expanded": sum(astar_expanded) / len(astar_expanded),
"runtime_generator_reused": astar_generator is not None,
"cache_stats": last_astar_cache_stats,
}