INQUIRING LINE

Why does prompt optimization alone fail to inject genuinely new knowledge?

This explores why crafting better prompts can reorganize what a model already knows but can't add facts or skills it never learned in training.


This explores why crafting better prompts can reorganize what a model already knows but can't add facts or skills it never learned in training. The corpus is blunt on the core point: prompting operates entirely inside a model's pre-existing training distribution, so it retrieves and recombines existing knowledge but cannot supply anything genuinely absent from the training data Can prompt optimization teach models knowledge they lack?. That creates a hard ceiling — no clever phrasing compensates for a foundational gap; it can only activate what's already latent.

The deeper 'why' shows up when you look at what prompts actually do mechanically. A single transformer is, in principle, Turing-complete — the right prompt can steer it to compute almost any function Can a single transformer become universally programmable through prompts?. But that same result quietly reveals the limit: prompting is *programming over fixed weights*, not *teaching*. You're rerouting computation through capabilities the weights already encode, not installing new ones. When the underlying procedure genuinely isn't there, prompting collapses into pattern-matching: models asked to run iterative numerical methods recognize a problem as template-similar and emit plausible-but-wrong values rather than executing the actual steps Do large language models actually perform iterative optimization?, and extended chain-of-thought produces more text, not more computation Do reasoning models actually beat standard models on optimization?.

What's striking is that even heavier interventions hit a related wall. RL fine-tuning — which does touch the weights — often just sharpens memorization rather than installing reasoning procedures: GRPO-trained models still crater on out-of-distribution variants, suggesting the optimization tightened template-matching instead of teaching genuine problem-solving Do fine-tuned language models actually learn optimization procedures?. So 'activate vs. inject' isn't a quirk of prompting alone — it's a recurring failure mode across the whole spectrum of post-training tweaks, which makes prompting's ceiling feel less like a bug and more like a property of working within a frozen knowledge base.

Here's the turn the corpus offers a curious reader: if you can't inject knowledge, the leverage moves to *how you deploy what's there*. Prompts optimized in isolation systematically underperform; jointly optimizing the prompt with the inference strategy (best-of-N, majority voting) yields up to 50% gains Does prompt optimization without inference strategy fail?, and reallocating inference compute adaptively by prompt difficulty beats bigger models under fixed budgets Can we allocate inference compute based on prompt difficulty?. The right prompt also turns out to be question-dependent rather than universal — step-by-step reasoning even *hurts* on simple questions and on high-tier models Why do some questions perform better without step-by-step reasoning? Do prompt techniques work the same across all LLM tiers?.

The one genuine workaround in the corpus is to stop treating context as a prompt and start treating it as external memory you write to: frameworks that maintain contexts as evolving playbooks, updated incrementally rather than rewritten, can accumulate domain knowledge across iterations without retraining Can context playbooks prevent knowledge loss during iteration?. That's the unexpected lesson — the fix for prompting's knowledge ceiling isn't a better prompt at all, but giving the model a place to *store* knowledge it never had.


Sources 10 notes

Can prompt optimization teach models knowledge they lack?

Prompting works entirely within a model's pre-existing training distribution and cannot supply domain knowledge absent from training data. This creates a hard ceiling: no prompt strategy can compensate for missing foundational knowledge, only reorganize what already exists.

Can a single transformer become universally programmable through prompts?

Research proves a single finite-size transformer exists that can compute any computable function given the right prompt, achieving complexity bounds nearly matching unbounded models. However, standard training rarely produces models that learn to implement arbitrary programs this way.

Do large language models actually perform iterative optimization?

Research shows LLMs cannot perform iterative procedures in latent space. They recognize optimization problems as template-similar and emit plausible-looking but incorrect values, a failure mode that persists across model scale and training approaches.

Do reasoning models actually beat standard models on optimization?

Reasoning variants with extended CoT show no consistent advantage over standard models on constraint-bound numerical tasks like optimal power flow. Extended thinking produces more text, not more iterative computation, suggesting the bottleneck is numeric procedure rather than reasoning steps.

Do fine-tuned language models actually learn optimization procedures?

Even GRPO-trained models show sharp performance drops on out-of-distribution variants (N-1 test sets) compared to in-distribution problems, indicating RL optimizes template-matching rather than genuine problem-solving procedures.

Does prompt optimization without inference strategy fail?

Prompts optimized without knowledge of the inference strategy (best-of-N, majority voting) systematically underperform. Joint optimization of both prompt and inference strategy yields up to 50% improvement across reasoning and generation tasks.

Can we allocate inference compute based on prompt difficulty?

Research shows inference effectiveness varies dramatically by prompt difficulty. Reallocating the same total compute adaptively—giving easy prompts less and hard ones more—substantially outperforms larger models under uniform budgets.

Why do some questions perform better without step-by-step reasoning?

Saliency analysis reveals that CoT prompting fails when question information doesn't aggregate into the prompt structure before reasoning begins. For simple questions, direct question-to-answer flow outperforms step-by-step reasoning, showing the optimal prompt depends on question type, not just task category.

Do prompt techniques work the same across all LLM tiers?

A 23-prompt benchmark across 12 LLMs shows rephrasing and background-knowledge prompts boost cheap models, while step-by-step reasoning reduces accuracy in high-performance models. Task structure, not generic best practices, determines which prompts help.

Can context playbooks prevent knowledge loss during iteration?

The ACE framework treats contexts as evolving playbooks using generation-reflection-curation loops rather than full rewrites. This prevents knowledge loss from compression and detail erosion, achieving +10.6% on agentic tasks and +8.6% on finance without labeled supervision.

Next inquiring lines