Pith. sign in

REVIEW 7 cited by

SeaKR: Self-aware Knowledge Retrieval for Adaptive Retrieval Augmented Generation

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 2406.19215 v1 pith:5EB2NKTF submitted 2024-06-27 cs.CL

SeaKR: Self-aware Knowledge Retrieval for Adaptive Retrieval Augmented Generation

classification cs.CL
keywords seakrself-awareuncertaintyretrievaladaptiveknowledgecomplexgeneration
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper introduces Self-aware Knowledge Retrieval (SeaKR), a novel adaptive RAG model that extracts self-aware uncertainty of LLMs from their internal states. SeaKR activates retrieval when the LLMs present high self-aware uncertainty for generation. To effectively integrate retrieved knowledge snippets, SeaKR re-ranks them based on LLM's self-aware uncertainty to preserve the snippet that reduces their uncertainty to the utmost. To facilitate solving complex tasks that require multiple retrievals, SeaKR utilizes their self-aware uncertainty to choose among different reasoning strategies. Our experiments on both complex and simple Question Answering datasets show that SeaKR outperforms existing adaptive RAG methods. We release our code at https://github.com/THU-KEG/SeaKR.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

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

  1. Adaptive Stopping for Multi-Turn LLM Reasoning

    cs.CL 2026-04 unverdicted novelty 8.0

    MiCP is the first conformal prediction method for multi-turn LLM pipelines that allocates per-turn error budgets to enable adaptive stopping with an overall coverage guarantee, shown to reduce turns and cost on RAG an...

  2. Retrieval as a Decision: Training-Free Adaptive Gating for Efficient RAG

    cs.CL 2025-11 conditional novelty 7.0

    TARG uses uncertainty scores from a short no-context draft to gate retrieval in RAG, matching Always-RAG accuracy while cutting retrievals by 70-90% on QA benchmarks.

  3. Boosting Self-Consistency with Ranking

    cs.CL 2026-06 unverdicted novelty 6.0

    RISC reformulates self-consistency answer selection as a ranking task solved by a lightweight LambdaRank model with five hand-designed features, yielding better accuracy-efficiency trade-offs than majority voting on Q...

  4. Trust or Abstain? A Self-Aware RAG Approach

    cs.IR 2026-05 unverdicted novelty 6.0

    SABER combines self-prior with multi-trace PK and CK reasoning representations to estimate reliability beliefs and drive trust-or-abstain decisions in knowledge-conflict RAG, improving accuracy over baselines.

  5. DualView: Adaptive Local-Global Fusion for Multi-Hop Document Reranking

    cs.IR 2026-04 unverdicted novelty 6.0

    DualView fuses local cross-attention and global context aggregation via adaptive gating to rerank fixed candidate sets for multi-hop QA, reporting 99.4% Top-4 Recall on MuSiQue at 4 ms latency while beating larger cro...

  6. Rethinking LLM Parametric Knowledge as Post-retrieval Confidence for Dynamic Retrieval and Reranking

    cs.IR 2025-09 conditional novelty 6.0

    Shifts in an LLM's hidden-state confidence, before and after a retrieved context, are used as a preference signal to fine-tune a reranker and to trigger retrieval only when initial confidence is low.

  7. DuMate-DeepResearch: An Auditable Multi-Agent System with Recursive Search and Rubric-Grounded Reasoning

    cs.AI 2026-06 unverdicted novelty 5.0

    DuMate-DeepResearch introduces a multi-agent deep research system with graph-based planning, recursive execution, and rubric optimization that reports new state-of-the-art scores of 58.03% and 61.95% on two benchmarks.