Evaluating Agentic Learning Harness Capabilities Without Labels via the Scaling Hypothesis

작성자

카테고리:

← 피드로
arXiv cs.AI · Aryan Luthra, Kshitij Jain, Siddharth Arya, Bobby Filar, Anna Bertiger · 2026-08-17 AI

[Submitted on 11 Aug 2026]

View PDF HTML (experimental)

Abstract:Agentic “Continual Learning Harnesses”, systems that pair an LLM with retrieval or memory to improve from feedback without retraining, have shown growing value in cybersecurity. But their value is conventionally measured by gains against labeled benchmarks, an approach that often fails in operational security settings. Benchmark labels are scarce, stale, and unrepresentative, so a practitioner often cannot tell whether a given harness helps at all or which of two is better for their task. Traditional LLM-as-a-judge offers little signal because it is no stronger than the agent it evaluates, and distillation is unreliable on scarce, sporadic, and biased labels.
We propose a framework for evaluating learning harnesses end-to-end without a labeled benchmark, grounded in the scaling hypothesis. A stronger teacher model provides sparsely sampled corrections to a smaller student with a continual learning harness. We score a harness by how much its student converges toward the teacher over time. Across security tasks, model families, and harness designs, we show that improvement relative to the teacher correlates with improvement relative to a held-out gold standard, validating teacher-relative lift as a proxy for true harness uplift when labels are absent. We further show that LLM-as-a-judge between similarly powered models yields no usable signal. These results suggest that a teacher-sized model can be improved through the same harness when humans provide the same kind of sparse, high-precision corrections.

Submission history

From: Bobby Filar [view email]
[v1] Tue, 11 Aug 2026 15:51:37 UTC (1,394 KB)

원문에서 계속 ↗

추출 본문 · 출처: arxiv.org · https://arxiv.org/abs/2608.13608