Adaptive retrieval-augmented generation uses a signal from the reader, such as its confidence when answering without retrieval (closed-book), to decide whether and how much to retrieve. We compare such methods not with always retrieving many passages but with the best simple policy under the same cap on average passages per query: a fixed depth or a random mixture of fixed depths. Policies allocate zero, one or five passages and are scored on held-out questions. Seven settings of about 2,000 questions combine TriviaQA, Natural Questions and MS MARCO, Qwen3-8B and Qwen3-32B readers, and two retrieval sources: per-question passage pools and a 3.5-million-passage Wikipedia index. Allocation by confidence could gain in three ways. It rations a scarce budget: at a cap of half a passage per query it beats the best simple policy in all seven settings, by 0.010 to 0.075 in accuracy. It avoids harmful retrieval: at caps of one passage or more, substantial gains appear only on Wikipedia, where passages often overwrite known answers, most robustly for Qwen3-8B on TriviaQA (+0.051, also under exact match and F1). It barely helps to choose depth: closed-book confidence ranks which queries a first passage helps but ranks the choice between one and five passages little better than chance, and with passage pools a fixed depth of two or three passages is as good or better. Once the probe's latency is charged, gains remain only where the gate skips retrieval for most queries; for the larger reader they also depend on the answer metric.
Early exit lowers the cost of serving a reasoning model by stopping its reasoning once a provisional answer looks final. An operator must choose between a learned stopping rule and one static token budget, and savings against full reasoning do not settle the choice. We present a procedure that decides on calibration data from the workload. It certifies both families with Learn-then-Test to one bound on the fraction of all questions that full reasoning answers correctly but early exit does not, prices provisional answers as the serving stack does, and deploys the cheapest certified candidate. Across four models and five benchmarks neither family is better throughout. At a 5% risk target the learned rule saves 10.4-17.0 percentage points more tokens than the static budget on free-form mathematics with Qwen3, with accuracy 2.4-2.9 points below full reasoning, and less on MMLU-Pro on average. Which family costs less also changes with the risk target, in 8 of 15 settings, and with the price of a provisional answer. Across three prices, committing to one family in advance gives up as much as 27.4 points on some workload, whereas selecting on calibration data falls at most 11.6 points short of the better family, on a task with only 99 calibration questions. In a vLLM engine with Qwen3-8B, mean response time fell in proportion to generated tokens. Policies served on a task other than their calibration task exceeded the risk target in 18 of 44 task pairs; recalibration on the new task restored risk control.