Pith. sign in

REVIEW 3 cited by

Self-DC: When to Reason and When to Act? Self Divide-and-Conquer for Compositional Unknown Questions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.13514 v2 pith:IWPRF4W3 submitted 2024-02-21 cs.CL cs.AI

classification cs.CLcs.AI
keywords textbftextitexternalinternalknowledgequestionsbetterknown
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Previous research has typically concentrated on leveraging the internal knowledge of Large Language Models (LLMs) to answer known questions (i.e., \textit{internal reasoning such as generate-then-read}). In contrast, for questions that fall outside their known scope, these models rely on external knowledge retrieval to provide accurate responses (i.e., \textit{external acting such as retrieve-then-read}). However, few previous works consider the \textit{compositional questions}, which consist of several known and unknown sub-questions, necessitating the dynamic combination of previous two methods (i.e., \textit{internal reasoning and external acting}) to achieve a better trade-off between effectiveness and efficiency. To this end, we introduce a \textbf{Self} \textbf{D}ivide-and-\textbf{C}onquer (\textit{\texttt{Self-DC}}) framework, accompanying with the first \textbf{C}ompositional \textbf{u}nknown \textbf{Q}uestion-\textbf{A}nswering dataset (CuQA). This framework enables LLMs to adaptively choose between using internal knowledge and retrieving external knowledge as needed, resulting in a better trade-off between effectiveness and efficiency. Experimental results on two datasets demonstrate that \textit{\texttt{Self-DC}} can achieve comparable or even better performance with much fewer external calls compared with several strong baselines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. To Retrieve or Not to Retrieve? Uncertainty Detection for Dynamic Retrieval Augmented Generation

    cs.CL 2025-01 conditional novelty 5.0 of 10

    Uncertainty detection metrics like Eccentricity and Degree Matrix Jaccard can halve retrieval calls in dynamic RAG with modest F1 loss on 2WikiMultihopQA.

  2. Let your LLM generate a few tokens and you will reduce the need for retrieval

    cs.CL 2024-12 conditional novelty 5.0 of 10

    A judge-trained 'I Know' classifier, fed the first 32 tokens of a model's answer, can skip retrieval for over half of queries on several QA datasets without lowering judge-scored answer quality.

  3. Review-Then-Refine: A Dynamic Framework for Multi-Hop Question Answering with Temporal Adaptability

    cs.CL 2024-12 conditional novelty 4.0 of 10

    A two-phase RAG pipeline with dynamic temporal query rewriting and adaptive retrieval improves multi-hop QA accuracy over several tested baselines on four benchmarks.

Pith tools