liveBook · Manning

Search space

As explained in Building LLM Applications with DSPy

The set of candidate solutions that can be searched when solving a problem.

A search space is the set of candidate solutions considered for a problem. For prompts, candidates can vary in persona, reasoning requests, examples, negative examples, or repeated requests that critique or combine responses. section 1.2.3

Prompting has a large search space, making manual exploration slow and prone to missing promising options. Small test sets and limited testing can also make a prompt seem better than it is. section 1.2.3

A broader AI lesson is to let systems use computation to search solution spaces and learn, rather than relying mainly on encoded human expertise. This approach has proved more effective in examples such as chess, Go, and speech recognition; it may also improve prompt development. section 1.2.4

How Building LLM Applications with DSPy covers it

How deep it goes
Explains why prompt search is difficult and argues for automation, but does not describe a search algorithm or implementation.
Examples
Uses personas, reasoning requests, examples, negative examples, prompt critique, and chess and Go systems.
What you can do after
Understand why automated search may outperform hand-coded expertise when exploring prompts and other AI solution spaces.
How it connects
Connects prompt engineering with automated search, machine learning, and computation-driven artificial intelligence.

Also explained in

Compare how 11 books explain search space →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Building LLM Applications with DSPy. The section links point to the parts of the book it draws on.