Expansion Function in Search Algorithms
The expansion operation within a search algorithm is formally expressed as the function . Generally, is the new set of states derived from the current set, , using an expansion rule, . In the context of prompt optimization, this formula is applied where is an existing set of prompts, is a model (typically a Large Language Model), and is the newly generated set of prompts. The expansion is performed by instructing the LLM to create new, relevant prompts based on the initial set.
0
1
Tags
Ch.3 Prompting - Foundations of Large Language Models
Foundations of Large Language Models
Foundations of Large Language Models Course
Computing Sciences
Related
Expansion Function in Search Algorithms
An algorithm is searching for a path from a starting point (Node A) to a goal (Node F) in a simple network. The network connections are: A-B, B-C, B-D, C-E, D-E, E-F. The algorithm is currently at Node B and needs to perform an expansion step to identify the next possible nodes to visit. Which statement best analyzes the fundamental trade-off inherent in how this expansion step is designed?
LLM Text Generation as a Search Problem
A search algorithm is designed to find a solution within a problem's state space. Arrange the following core operations of a single iteration of such an algorithm in the correct logical sequence, starting from the selection of a state to explore.
Node Expansion in Step-Level Search
Example of a Prompt for LLM-based Prompt Expansion
Iterative LLM-Based Prompt Search
A team is using an automated process to discover a high-performing prompt for a text summarization task. They begin with an initial set of prompts:
C = {'Summarize the following text for me.', 'Give me the main points of this article.'}. They then apply a single 'expansion' operation, which uses a large language model to generate a new set of candidate prompts based on the ones inC. Which of the following best represents a plausible output set from this single expansion operation?The Role of Expansion in Prompt Diversity
Expansion Function in Search Algorithms
Troubleshooting a Prompt Optimization Process
Prompt Expansion via Edit Operations
Prompt Expansion via Feedback
Prompt Paraphrasing
Learn After
A search algorithm is exploring a graph with the following direct connections: Node A is connected to Node B and Node C; Node B is connected to Node A and Node D; Node C is connected to Node A; Node D is connected to Node B. The algorithm's current set of states is
C = {Node A}. If the expansion function is defined asC' = Expand(C, f), where the rulefis 'identify all unique nodes that are directly connected to any node in the current setC', what is the resulting new set of statesC'?Deconstructing the Expansion Function
Applying the Expansion Function in Prompt Engineering