REVIEW 6 cited by
DAT: Dynamic Alpha Tuning for Hybrid Retrieval in 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
DAT: Dynamic Alpha Tuning for Hybrid Retrieval in Retrieval-Augmented Generation
read the original abstract
Hybrid retrieval techniques in Retrieval-Augmented Generation (RAG) systems enhance information retrieval by combining dense and sparse (e.g., BM25-based) retrieval methods. However, existing approaches struggle with adaptability, as fixed weighting schemes fail to adjust to different queries. To address this, we propose DAT (Dynamic Alpha Tuning), a novel hybrid retrieval framework that dynamically balances dense retrieval and BM25 for each query. DAT leverages a large language model (LLM) to evaluate the effectiveness of the top-1 results from both retrieval methods, assigning an effectiveness score to each. It then calibrates the optimal weighting factor through effectiveness score normalization, ensuring a more adaptive and query-aware weighting between the two approaches. Empirical results show that DAT consistently significantly outperforms fixed-weighting hybrid retrieval methods across various evaluation metrics. Even on smaller models, DAT delivers strong performance, highlighting its efficiency and adaptability.
Forward citations
Cited by 6 Pith papers
-
Rethinking RAG in Long Videos: What to Retrieve and How to Use It?
Introduces V-RAGBench benchmark and CARVE method that selects per-chunk retrieval configurations via parallel retrievers and adaptive reranking, outperforming eight VideoRAG baselines.
-
SAGE: A Novelty Gate for Efficient Memory Evolution in Agentic LLMs
SAGE applies a von Mises-Fisher density estimator with an adaptive threshold to route memory updates, achieving best-in-class token-F1 on LoCoMo while reducing API cost 3.4x and latency 2.5x on GPT-4o-mini.
-
Are LLM-Based Retrievers Worth Their Cost? An Empirical Study of Efficiency, Robustness, and Reasoning Overhead
Empirical comparison across 14 retrievers on the BRIGHT benchmark shows reasoning-specialized models can match strong accuracy with competitive speed while many large LLM bi-encoders add latency for small gains and co...
-
From Intent to Execution: Composing Agentic Workflows with Agent Recommendation
A framework automates multi-agent system creation via LLM planning and two-stage agent recommendation, claiming higher recall than prior methods.
-
Efficient RAG with Intent-Aware Retrieval and Semantics-Preserving Chunking
InSemRAG combines dynamic intent-aware hybrid retrieval and semantics-preserving chunk repair in an iterative loop, yielding 2.65 F1 gain on HotPotQA and 1.5 accuracy gain on FEVER with 4.32x lower latency than Multi-...
-
H-RAG at SemEval-2026 Task 8: Hierarchical Parent-Child Retrieval for Multi-Turn RAG Conversations
H-RAG uses hierarchical parent-child document segmentation with hybrid retrieval and parent-level aggregation to achieve 0.4271 nDCG@5 on retrieval and 0.3241 harmonic mean on generation in a multi-turn RAG shared task.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.