Pseudo-Refinement Loop (Iterative Question Decomposition)

Definition

A retrieval strategy that iteratively generates relevance-scored follow-up questions from initial answers, then explores the highest-scoring ones via further (local) searches, progressively widening and refining the data collected.

Cast within

No topic-region cast yet — this appears once Pseudo-Refinement Loop (Iterative Question Decomposition)'s compiled claims are aligned into a topic region's argument tree.

Claims mentioning Pseudo-Refinement Loop (Iterative Question Decomposition) (1)

Your notes

Loading notes...