Line of inquiry
Inquiring lines›How do training choices shape mode…›How can retrieval systems better h…›this line of inquiry
How can query decomposition improve multi-hop retrieval efficiency and coherence?
A broader line of inquiry — a family of 32 specific questions the research asks around this. Follow one into its inquiring-line page, or move sideways to a related line below.
Questions in this line of inquiry 32
Specific inquiring lines the field asks around this — ordered from the most general framing down to the most specific angle.
- How do hierarchical query planning architectures improve multi-hop retrieval?
- How should retrieval systems handle multi-hop reasoning and iterative information needs?
- How does query planning as a separate step improve multi-hop retrieval coherence?
- How do parallel and sequential retrieval strategies compare in compute efficiency?
- Does parallel retrieval outperform sequential search chains at test time?
- How does query decomposition reduce retrieval costs at inference?
- How do hierarchical research architectures handle multi-hop queries better?
- Can parallel retrieval chains avoid the context consumption problem?
- How does hierarchical query planning versus flat prompting affect multi-source retrieval?
- How should retrieval and verification tasks be separated architecturally?
- How does reflection-based query refinement differ from single-pass retrieval strategies?
- When does long-context LLM reasoning fail where structured retrieval succeeds?
- How do taxonomy-based retrieval scaffolds improve model performance at inference time?
- How do hierarchical research architectures improve multi-hop query accuracy?
- Does retrieval quality depend more on access structure or write gating?
- How do hierarchical architectures separate planning from retrieval differently than flat ones?
- What would instruction-following retrieval enable that query-only systems cannot?
- Can stateless multi-step retrieval capture evidence integration as well as dynamic memory?
- Why does single-round retrieval fail on multi-step tasks across different domains?
- What scaling behavior do partial systems show without iterative query refinement?
- How does time-partitioned routing compare to retrieval-augmented temporal grounding?
- Do expansion-reflection loops and chain-of-retrieval approaches solve the same problem?
- How do hierarchical architectures improve multi-hop query performance?
- Why do conversational systems struggle more than static retrieval with ambiguous queries?
- What makes legal and medical queries particularly vulnerable to structural near-misses?
- Why does long-form generation need different retrieval than factoid questions?
- How does temporal grounding in retrieval compare to architectural approaches?
- How should temporal metadata indexing differ from semantic indexing?
- Why do bi-encoder retrievers sacrifice effectiveness for latency in two-stage ranking?
- Can task-agnostic compression of documents remain broadly useful for later queries?
- What design tradeoffs exist between pure ID and pure text indexing?
- How do RAG and prompting techniques differ in supporting each granularity level?