Organizations: Northeastern University Boston, USA, 02115 · Independent Researcher Milpitas, USA, 95035 · Independent Researcher Austin, USA, 78613 · Washington University in St. Louis St. Louis, USA, 63130 · New York University New York, USA, 10012
Retrieval-Augmented Generation (RAG) grounds Large Language Models (LLMs) to mitigate factual hallucinations. Recent paradigms shift from static pipelines to Modular and Agentic RAG frameworks, granting models autonomy for multi-hop reasoning or self-correction. However, current reflective RAG heavily relies on massive LLMs as universal evaluators. In high-throughput systems, executing complete forward passes for billion-parameter models merely for binary routing introduces severe computational redundancy. Furthermore, in autonomous agent scenarios, inaccurate retrieval causes models to expend excessive tokens on spurious reasoning and redundant tool calls, inflating Time-to-First-Token (TTFT) and costs. We propose Tiny-Critic RAG, decoupling evaluation by deploying a parameter-efficient Small Language Model (SLM) via Low-Rank Adaptation (LoRA). Acting as a deterministic gatekeeper, Tiny-Critic employs constrained decoding and non-thinking inference modes for ultra-low latency binary routing. Evaluations on noise-injected datasets demonstrate Tiny-Critic RAG achieves routing accuracy comparable to GPT-4o-mini while reducing latency by an order of magnitude, establishing a highly cost-effective paradigm for agent deployment.
Figures & tables
Figure 1: Architectural comparison highlighting the implicit cost of noise. Left: In an unprotected Agentic RAG (e.g., ReAct), adversarial noise triggers spurious multi-hop reasoning spirals, causing catastrophic token waste and high TTFT. Right: Our Tiny-Critic Agentic RAG preemptively intercepts noise ( a=0 ), routing the query to a fallback tool to retrieve clean evidence ( D′ ), effectively isolating the generator from hallucinations.
Model
R-F1
Faithful.
TTFT (ms)
CPQ ($)
Naive RAG
N/A
0.44
450
0.00
Heavy-CRAG
0.934
0.88
1235
3.00
Tiny-Critic (Ours)
0.912
0.86
492
0.06
a R-F1: Routing F1; Faithful.: RAGAS Faithfulness.
b CPQ: Explicit routing Cost Per 10k Queries in USD.
c CPQ estimations assume an average context of 2K tokens