Meta-search improves the search procedure rather than directly improving the artifact. An agent can keep an editable meta-procedure and rewrite how it searches; HyperAgents is a canonical example. section 1.4.2
Figure 1.11 The search family arranged by cost against improvement reach. Hill-climbing is the cheapest and most limited, pairwise and population methods cost more and reach further, reinforcement-learning searches fit policy-shaped artifacts, and evolutionary archive search is the most expensive and reaches the furthest. Meta-search sits apart, since it changes the search itself rather than spending more effort on the same curve.

Shows meta-search apart from methods that spend more effort along the same cost-versus-improvement-reach curve. section 1.4.2
