REVIEW 6 major objections 6 minor 46 references
Single LLM, Multiple Roles: A Unified Retrieval-Augmented Generation Framework Using Role-Specific Token Optimization
T0 review · 6 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read RoleRAG claims a single frozen LLM, given only a few trainable role-token embeddings, can perform every sub-task of retrieval-augmented generation and beat dedicated RAG pipelines on five open-domain QA datasets.
desk verdict Plausible modular RAG framework with a useful dataset, but the headline performance claims don't survive contact with Table 2 and the tuning-on-test-set protocol. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the role token: new special tokens appended to the input, whose embeddings are the only trainable parameters while the backbone LLM weights stay frozen. Each module has its own role token, and at inference the token acts as a soft prompt that activates a given capability in the same model instance. The other central piece is the query graph, a directed acyclic graph of sub-queries with placeholders for parent answers; the graph is built first, then resolved node by node, with the retrieval judge deciding whether each node needs external knowledge and the new-query generator adding nodes when the collected answers are insufficient.
What would settle it
A trace-level study would settle it: take a few hundred queries where RoleRAG's final answer is correct and ask annotators to label whether the intermediate query graph, retrieval decisions, and summaries are also correct. If correct final answers frequently ride on wrong intermediate steps, the filtering rule fails; a second check would train the same modules on traces with human-verified intermediate steps and compare final-answer accuracy.
Extended reading notes
Core claim
RoleRAG's central claim is that role-specific token optimization is enough to specialize a single frozen LLM for six RAG sub-tasks—query graph builder, retrieval judge, sub-answer generator, summarizer, new query generator, and answer reasoner—and that this outperforms both sequential and iterative RAG pipelines. All training data for these modules is generated by a stronger expert LLM, Llama-3.1-70B-Instruct, and filtered by whether the final answer matches the golden answer; only the embeddings of per-task role tokens are updated. On HotpotQA, MuSiQue, 2WikimultihopQA, Bamboogle, and PopQA, the method reports the best exact-match and F1 scores among all compared methods, including out-of-domain generalization to datasets never seen in training.
Load-bearing premise
The entire training signal is synthetic: traces generated by Llama-3.1-70B-Instruct are kept only when the final answer matches the dataset's golden answer, which assumes that a correct final answer guarantees the intermediate query decompositions, retrieval judgments, and summaries are also correct enough to learn from.
Editorial extensions
If this is right
- Deploying a RAG system requires only one frozen LLM plus a small set of token embeddings, since role tokens activate different modules without retraining the backbone.
- New RAG sub-tasks can be appended by adding another role token and collecting task-specific data, without disturbing the already-trained modules.
- Complex multi-hop questions benefit from a dynamic query graph: the retrieval judge prunes nodes that need no retrieval and the new-query generator adds missing nodes, so retrieval cost drops while accuracy rises.
- Because the training signal is generated automatically from an expert LLM, the framework can be scaled to additional datasets without human annotation of intermediate steps.
- Out-of-domain results on Bamboogle and PopQA suggest that the learned role tokens transfer to QA datasets not used in training.
Reading between the lines
- Beyond the paper's scope: role-token tuning could extend to other multi-stage LLM workflows, such as agent loops, tool use, or multi-step coding, where a frozen model switches skills by token alone; the paper does not test this.
- The fixed six-step workflow may be brittle for tasks that require different module orders or repeated back-and-forth between retrieval and reasoning; the paper's own limitations section notes that the sequence is predefined.
- A direct comparison against parameter-efficient alternatives such as LoRA or standard soft-prompt tuning would clarify whether the gains come specifically from role tokens or from any task-specific tuning; the paper does not include such an ablation.
- The synthetic-data filtering scheme implies a cheap way to bootstrap domain-specific RAG pipelines from a stronger teacher model, but it also predicts that as teacher quality drops, RoleRAG's advantage should shrink; this could be tested by ablating with weaker teacher models.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes RoleRAG, a unified retrieval-augmented generation framework in which six modules (query graph builder, retrieval judge, sub-answer generator, summarizer, new query generator, answer reasoner) share a single frozen backbone LLM and are specialized by training only newly added role-token embeddings. Training data for all modules is generated by Llama-3.1-70B-Instruct, filtered by a threshold on final-answer quality against the dataset golden answers. The method also introduces a dynamic query graph for query decomposition. Experiments on HotpotQA, MuSiQue, 2WikiMultihopQA, Bamboogle, and PopQA are reported, and the abstract claims 16%–64% exact-match improvements over state-of-the-art RAG baselines. The paper additionally releases a dataset for training RAG modules.
Significance. If the empirical claims were supported, the paper would make a useful contribution: role-specific token optimization is parameter-efficient (about 0.1M trainable parameters for 30 role tokens), preserves the backbone LLM's general abilities, and offers a modular yet deployment-friendly way to improve RAG. The dynamic query graph is a sensible design for multi-hop questions, and the released dataset could be a resource for the community. However, the central evidence as presented is not sufficient: the headline improvement range does not match the reported tables, there is no statistical validation, and key hyperparameters appear to be selected on evaluation sets. The idea is promising, but the manuscript in its current form does not establish the stated superiority over existing methods.
major comments (6)
- [Abstract, §1, Table 2] The claimed 16%–64% EM improvement over state-of-the-art RAG methods is not supported by Table 2. Computing relative EM gains over the best baseline per dataset gives roughly 7% on HotpotQA (37.40 vs. 34.90), 50% on MuSiQue (18.20 vs. 12.10), 46% on 2WikiMultihopQA (47.00 vs. 32.20), 34% on Bamboogle (44.00 vs. 32.80), and only 2.7% on PopQA (33.70 vs. 32.80). The lower bound of the claimed range is thus off by roughly a factor of six, and PopQA, a key generalization dataset, shows a 0.9-point EM margin. The abstract and introduction need to be corrected to report the actual observed margins, or the claim must be re-derived with a clearly defined baseline set.
- [§4.3, Table 2] All results appear to be single runs with no error bars, confidence intervals, or significance tests. The statement that RoleRAG 'significantly outperforms' all baselines is therefore not justified by the data. This is especially problematic for PopQA, where the EM margin over RetRobust is 0.9 points. The authors should report at least three independent runs with variance, or use a paired bootstrap or per-question significance test, to support the comparative claims.
- [§4.4, Figure 4, Table 5] Key hyperparameters appear to be selected on the evaluation sets. Figure 4 sweeps the number of role tokens and reports that 'optimal results occurring when 30-40 tokens are used', varying per dataset. Table 5 sweeps the number of retrieved passages per sub-query, and the main Table 2 results seem to use the deepest setting (RoleRAG-5, 11.35 passages per query on HotpotQA, compared with 7.35 for RQ-RAG). Selecting hyperparameters that maximize test-set performance inflates the reported gains. Please specify a held-out validation split, report the chosen hyperparameters before evaluation, and describe the selection procedure.
- [Table 2 vs. Table 5] There is an internal inconsistency in the reported results. Table 2 gives RoleRAG an F1 of 49.17 on HotpotQA, whereas Table 5 gives RoleRAG-5, which appears to be the same configuration, an F1 of 51.03 on HotpotQA. If Table 5 uses a different retriever, different passage set, or different number of retrieved passages than Table 2, that must be stated explicitly; otherwise the main results are not reproducible.
- [§3.2, Data Collection] The training-data filtering threshold α is never reported, and the supervision for all intermediate modules comes from a single expert LLM (Llama-3.1-70B-Instruct) filtered only by final-answer score. The paper assumes that a correct final answer is a valid proxy for the correctness of every intermediate step, but if the expert reaches the correct answer through an incorrect path, the distilled modules will learn flawed behavior. Please report α and its sensitivity, and provide at least a sample-based human or rule-based verification of the intermediate outputs.
- [Table 3, Ablation Study] The ablation results do not support the claim that all modules positively contribute. Removing the retrieval judge improves both EM and F1 on HotpotQA (38.40/50.31 vs. 37.40/49.17) and on MuSiQue (18.50/27.58 vs. 18.20/27.30). The text acknowledges a retrieval-cost trade-off, but the table shows the full model is not the best configuration on the reported quality metrics. This needs a clear explanation, including whether the retrieval-judge removal variant uses the same number of retrieved passages and whether the cost savings justify the reported quality differences.
minor comments (6)
- [§3.1, Table 1] The module is called 'Answer Generator' in the text of Section 3.1 but 'Sub-answer Generator' in Table 1 and Figure 2; please use a consistent name throughout.
- [Appendix G] The query-rewrite analysis reports mixed results and the module is excluded from the final framework. It would be clearer to state this design decision in the main text, since readers may otherwise wonder why query rewriting, a common RAG component, is absent.
- [Appendix F, Case Study] In the first case study, the summary for Q1 states 'Scott Robertson is an American concept artist' even though the sub-question asks about Scott Derrickson. This appears to be an erroneous summary, which contradicts the example's presentation as a successful execution and should be corrected or discussed.
- [§4.2, Table 2] The baseline name is spelled 'BlenderFilter' in Section 4.2 but 'BlendFilter' in Table 2; please ensure all baseline names match the cited publications.
- [Table 4] The statement that Llama-70B is applied with few-shot examples while the other backbones are fine-tuned needs clarification. As written, the model-size comparison confounds model size with training protocol.
- [§2, Contributions] The claim that the released dataset is 'the first dataset covering the entire pipeline of a RAG system' should be supported by comparisons with existing RAG training resources or softened, since several prior works provide multi-stage RAG supervision.
Circularity Check
No significant circularity: the empirical pipeline is trained and evaluated on external benchmarks; the self-citations are not load-bearing and no claimed result reduces to its own inputs by construction.
full rationale
RoleRAG is an empirical systems paper and does not present a formal derivation from first principles, so the circularity burden is low. The core method trains only newly added role-token embeddings with a standard next-token prediction objective while keeping the backbone frozen, and the resulting modules are evaluated on held-out test or development splits of five public QA benchmarks against eleven external baselines. No equation in the paper defines a predicted quantity in terms of the fitted parameters by construction, and no uniqueness theorem or prior result by the same authors is invoked to force the framework's design. The self-citations present (FlashRAG, BIDER, and Tan et al. on retrieval necessity) are used as tooling and related-work context, not as load-bearing evidence for the central effectiveness claim; the retrieval-necessity design is also supported by the external citation to Yoran et al. The expert-LLM data-generation procedure, which filters training samples by final-answer exact-match or F1 score, is a training-data quality heuristic rather than a self-definitional prediction; the unreported threshold alpha is a reporting weakness but not circularity. The Limitations section openly acknowledges the fixed workflow and efficiency overhead, and Appendix G reports an honest negative result for query rewriting. Concerns about missing error bars, single runs, and hyperparameters apparently selected on evaluation sets are statistical validity and reproducibility issues, which fall under correctness risk rather than circularity under the stated rules. Because no specific reduction of a claimed result to its own inputs can be exhibited, the appropriate circularity score is 0.
Assumptions & free parameters
free parameters (3)
- Data filtering threshold alpha =
Not reported
- Number of role tokens per task =
30 (best); 50 causes overfitting
- Number of retrieved passages per sub-query =
Unclear for main results
assumptions (5)
- ad hoc to paper The six module decomposition (query graph builder, retrieval judge, sub-answer generator, summarizer, new query generator, answer reasoner) is an appropriate and sufficient decomposition of the RAG process.
- domain assumption Llama-3.1-70B-Instruct can generate high-quality intermediate annotations with the provided prompts, and filtering by final answer quality is a valid proxy for intermediate annotation quality.
- domain assumption The query DAG follows a Markov assumption: each sub-query's resolution depends only on parent node answers, allowing the final node to be resolved after all preceding nodes.
- domain assumption The retriever (E5-base-v2) over the Wikipedia corpus provides sufficient evidence for all sub-queries.
- domain assumption Standard next-token prediction objective with frozen backbone and tuned role-token embeddings is sufficient to make each module specialize without interfering.
Cite this review
Pith. "Pith review of Single LLM, Multiple Roles: A Unified Retrieval-Augmented Generation Framework Using Role-Specific Token Optimization." pith.science (2026). https://pith.science/paper/L3BTO6SW
@misc{pith2026250515444,
author = {Pith},
title = {Pith review of: Single LLM, Multiple Roles: A Unified Retrieval-Augmented Generation Framework Using Role-Specific Token Optimization},
year = {2026},
howpublished = {\url{https://pith.science/paper/L3BTO6SW}},
note = {Machine review of arXiv:2505.15444}
}
read the original abstract
Existing studies have optimized retrieval-augmented generation (RAG) across various sub-tasks, such as query understanding and retrieval refinement, but integrating these optimizations into a unified framework remains challenging. To tackle this problem, this work proposes RoleRAG, a unified RAG framework that achieves efficient multi-task processing through role-specific token optimization. RoleRAG comprises six modules, each handling a specific sub-task within the RAG process. Additionally, we introduce a query graph to represent the decomposition of the query, which can be dynamically resolved according to the decomposing state. All modules are driven by the same underlying LLM, distinguished by task-specific role tokens that are individually optimized. This design allows RoleRAG to dynamically activate different modules within a single LLM instance, thereby streamlining deployment and reducing resource consumption. Experimental results on five open-domain question-answering datasets demonstrate the effectiveness, generalizability, and flexibility of our framework.
Figures
Figures from the paper (10 more)
Reference graph
Works this paper leans on
-
[1]
Yigal Arens, Craig A. Knoblock, and Wei - Min Shen. 1996. https://doi.org/10.1007/BF00122124 Query reformulation for dynamic information integration . J. Intell. Inf. Syst., 6(2/3):99--130
-
[2]
Akari Asai, Zeqiu Wu, Yizhong Wang, Avirup Sil, and Hannaneh Hajishirzi. 2024. https://openreview.net/forum?id=hSyW5go0v8 Self-rag: Learning to retrieve, generate, and critique through self-reflection . In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria, May 7-11, 2024 . OpenReview.net
2024
-
[3]
Hiteshwar Kumar Azad and Akshay Deepak. 2019. https://doi.org/10.1016/J.IPM.2019.05.009 Query expansion techniques for information retrieval: A survey . Inf. Process. Manag., 56(5):1698--1735
-
[4]
Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert - Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel M. Ziegler, Jeffrey Wu, Clemens Winter, Christopher Hesse, Mark Chen, Eric Sigler, Mateusz Litw...
2020
-
[5]
Claudio Carpineto and Giovanni Romano. 2012. https://doi.org/10.1145/2071389.2071390 A survey of automatic query expansion in information retrieval . ACM Comput. Surv. , 44(1):1:1--1:50
arXiv 2012
-
[6]
Chi - Min Chan, Chunpu Xu, Ruibin Yuan, Hongyin Luo, Wei Xue, Yike Guo, and Jie Fu. 2024. https://doi.org/10.48550/ARXIV.2404.00610 RQ-RAG: learning to refine queries for retrieval augmented generation . CoRR, abs/2404.00610
-
[7]
Zehui Chen, Kuikun Liu, Qiuchen Wang, Jiangning Liu, Wenwei Zhang, Kai Chen, and Feng Zhao. 2024. https://doi.org/10.48550/ARXIV.2407.20183 Mindsearch: Mimicking human minds elicits deep AI searcher . CoRR, abs/2407.20183
-
[8]
DeepSeek - AI, Aixin Liu, Bei Feng, Bing Xue, Bingxuan Wang, Bochao Wu, Chengda Lu, Chenggang Zhao, Chengqi Deng, Chenyu Zhang, Chong Ruan, Damai Dai, Daya Guo, Dejian Yang, Deli Chen, Dongjie Ji, Erhang Li, Fangyun Lin, Fucong Dai, Fuli Luo, Guangbo Hao, Guanting Chen, Guowei Li, H. Zhang, Han Bao, Hanwei Xu, Haocheng Wang, Haowei Zhang, Honghui Ding, Hu...
Show all 46 references
- [9]
- [10]
-
[11]
Xanh Ho, Anh - Khoa Duong Nguyen, Saku Sugawara, and Akiko Aizawa. 2020. https://doi.org/10.18653/V1/2020.COLING-MAIN.580 Constructing A multi-hop QA dataset for comprehensive evaluation of reasoning steps . In Proceedings of the 28th International Conference on Computational ...
2020 doi
-
[12]
Soyeong Jeong, Jinheon Baek, Sukmin Cho, Sung Ju Hwang, and Jong Park. 2024. https://doi.org/10.18653/V1/2024.NAACL-LONG.389 Adaptive-rag: Learning to adapt retrieval-augmented large language models through question complexity . In Proceedings of the 2024 Conference of the Nor...
2024 doi
-
[13]
Huiqiang Jiang, Qianhui Wu, Chin - Yew Lin, Yuqing Yang, and Lili Qiu. 2023 a . https://doi.org/10.18653/V1/2023.EMNLP-MAIN.825 Llmlingua: Compressing prompts for accelerated inference of large language models . In Proceedings of the 2023 Conference on Empirical Methods in Nat...
2023 doi
-
[14]
Xu, Luyu Gao, Zhiqing Sun, Qian Liu, Jane Dwivedi - Yu, Yiming Yang, Jamie Callan, and Graham Neubig
Zhengbao Jiang, Frank F. Xu, Luyu Gao, Zhiqing Sun, Qian Liu, Jane Dwivedi - Yu, Yiming Yang, Jamie Callan, and Graham Neubig. 2023 b . https://doi.org/10.18653/V1/2023.EMNLP-MAIN.495 Active retrieval augmented generation . In Proceedings of the 2023 Conference on Empirical Me...
2023 doi
-
[15]
Jiajie Jin, Yutao Zhu, Xinyu Yang, Chenghao Zhang, and Zhicheng Dou. 2024 a . https://arxiv.org/abs/2405.13576 Flashrag: A modular toolkit for efficient retrieval-augmented generation research . CoRR, abs/2405.13576
2024 arXiv
- [16]
- [17]
-
[18]
Jaehyung Kim, Jaehyun Nam, Sangwoo Mo, Jongjin Park, Sang - Woo Lee, Minjoon Seo, Jung - Woo Ha, and Jinwoo Shin. 2024 b . https://openreview.net/forum?id=w4DW6qkRmt Sure: Summarizing retrievals using answer candidates for open-domain QA of llms . In The Twelfth International ...
2024
-
[19]
u ttler, Mike Lewis, Wen - tau Yih, Tim Rockt \
Patrick S. H. Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich K \" u ttler, Mike Lewis, Wen - tau Yih, Tim Rockt \" a schel, Sebastian Riedel, and Douwe Kiela. 2020. https://proceedings.neurips.cc/paper/2020/hash/6b493230205f780e...
2020
-
[20]
Xinbei Ma, Yeyun Gong, Pengcheng He, Hai Zhao, and Nan Duan. 2023. https://doi.org/10.18653/v1/2023.emnlp-main.322 Query rewriting in retrieval-augmented large language models . In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, pages 53...
2023 doi
-
[21]
Alex Mallen, Akari Asai, Victor Zhong, Rajarshi Das, Daniel Khashabi, and Hannaneh Hajishirzi. 2023. https://doi.org/10.18653/V1/2023.ACL-LONG.546 When not to trust language models: Investigating effectiveness of parametric and non-parametric memories . In Proceedings of the 6...
2023 doi
-
[22]
Shengyu Mao, Yong Jiang, Boli Chen, Xiao Li, Peng Wang, Xinyu Wang, Pengjun Xie, Fei Huang, Huajun Chen, and Ningyu Zhang. 2024. https://aclanthology.org/2024.findings-emnlp.49 Rafe: Ranking feedback improves query rewriting for RAG . In Findings of the Association for Computa...
2024
- [23]
-
[24]
Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas K \" o pf, Edward Z. Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Stei...
2019
-
[25]
Fabio Petroni, Aleksandra Piktus, Angela Fan, Patrick S. H. Lewis, Majid Yazdani, Nicola De Cao, James Thorne, Yacine Jernite, Vladimir Karpukhin, Jean Maillard, Vassilis Plachouras, Tim Rockt \" a schel, and Sebastian Riedel. 2021. https://doi.org/10.18653/V1/2021.NAACL-MAIN....
2021 doi
-
[26]
Smith, and Mike Lewis
Ofir Press, Muru Zhang, Sewon Min, Ludwig Schmidt, Noah A. Smith, and Mike Lewis. 2023. https://doi.org/10.18653/V1/2023.FINDINGS-EMNLP.378 Measuring and narrowing the compositionality gap in language models . In Findings of the Association for Computational Linguistics: EMNLP...
2023 doi
-
[27]
Zhihong Shao, Yeyun Gong, Yelong Shen, Minlie Huang, Nan Duan, and Weizhu Chen. 2023. https://doi.org/10.18653/V1/2023.FINDINGS-EMNLP.620 Enhancing retrieval-augmented large language models with iterative retrieval-generation synergy . In Findings of the Association for Comput...
2023 doi
-
[28]
Weijia Shi, Sewon Min, Michihiro Yasunaga, Minjoon Seo, Richard James, Mike Lewis, Luke Zettlemoyer, and Wen - tau Yih. 2024. https://doi.org/10.18653/V1/2024.NAACL-LONG.463 REPLUG: retrieval-augmented black-box language models . In Proceedings of the 2024 Conference of the No...
2024 doi
-
[29]
Jiejun Tan, Zhicheng Dou, Yutao Zhu, Peidong Guo, Kun Fang, and Ji - Rong Wen. 2024. https://doi.org/10.18653/V1/2024.ACL-LONG.242 Small models, big insights: Leveraging slim proxy models to decide when and what to retrieve for llms . In Proceedings of the 62nd Annual Meeting ...
2024 doi
-
[30]
Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, and Ashish Sabharwal. 2022. https://doi.org/10.1162/TACL\_A\_00475 Musique: Multihop questions via single-hop question composition . Trans. Assoc. Comput. Linguistics, 10:539--554
2022 doi
-
[31]
Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, and Ashish Sabharwal. 2023. https://doi.org/10.18653/V1/2023.ACL-LONG.557 Interleaving retrieval with chain-of-thought reasoning for knowledge-intensive multi-step questions . In Proceedings of the 61st Annual Meeting of th...
2023 doi
-
[32]
Francis Song, Noah Y
Jonathan Uesato, Nate Kushman, Ramana Kumar, H. Francis Song, Noah Y. Siegel, Lisa Wang, Antonia Creswell, Geoffrey Irving, and Irina Higgins. 2022. https://doi.org/10.48550/ARXIV.2211.14275 Solving math word problems with process- and outcome-based feedback . CoRR, abs/2211.14275
- [33]
-
[34]
Haoyu Wang, Ruirui Li, Haoming Jiang, Jinjin Tian, Zhengyang Wang, Chen Luo, Xianfeng Tang, Monica Xiao Cheng, Tuo Zhao, and Jing Gao. 2024. https://aclanthology.org/2024.emnlp-main.58 Blendfilter: Advancing retrieval-augmented large language models via query generation blendi...
2024
- [35]
-
[36]
Yile Wang, Peng Li, Maosong Sun, and Yang Liu. 2023. https://doi.org/10.18653/V1/2023.FINDINGS-EMNLP.691 Self-knowledge guided retrieval augmentation for large language models . In Findings of the Association for Computational Linguistics: EMNLP 2023, Singapore, December 6-10,...
2023 doi
-
[37]
Fangyuan Xu, Weijia Shi, and Eunsol Choi. 2024. https://openreview.net/forum?id=mlJLVigNHp RECOMP: improving retrieval-augmented lms with context compression and selective augmentation . In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Au...
2024
-
[38]
Bruce Croft
Jinxi Xu and W. Bruce Croft. 1996. https://doi.org/10.1145/243199.243202 Query expansion using local and global document analysis . In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'96, August 18-22...
1996
-
[39]
Cohen, Ruslan Salakhutdinov, and Christopher D
Zhilin Yang, Peng Qi, Saizheng Zhang, Yoshua Bengio, William W. Cohen, Ruslan Salakhutdinov, and Christopher D. Manning. 2018. https://doi.org/10.18653/V1/D18-1259 Hotpotqa: A dataset for diverse, explainable multi-hop question answering . In Proceedings of the 2018 Conference...
2018 doi
-
[40]
Ori Yoran, Tomer Wolfson, Ori Ram, and Jonathan Berant. 2024 a . https://openreview.net/forum?id=ZS4m74kZpH Making retrieval-augmented language models robust to irrelevant context . In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria...
2024
-
[41]
Ori Yoran, Tomer Wolfson, Ori Ram, and Jonathan Berant. 2024 b . https://openreview.net/forum?id=ZS4m74kZpH Making retrieval-augmented language models robust to irrelevant context . In The Twelfth International Conference on Learning Representations, ICLR 2024, Vienna, Austria...
2024
-
[42]
Fei Yu, Anningzhe Gao, and Benyou Wang. 2024. https://doi.org/10.18653/V1/2024.FINDINGS-NAACL.55 Ovm, outcome-supervised value models for planning in mathematical reasoning . In Findings of the Association for Computational Linguistics: NAACL 2024, Mexico City, Mexico, June 16...
2024 doi
- [43]
-
[44]
Zhen Zhang, Xinyu Wang, Yong Jiang, Zhuo Chen, Feiteng Mu, Mengting Hu, Pengjun Xie, and Fei Huang. 2024 b . https://doi.org/10.48550/ARXIV.2411.06207 Exploring knowledge boundaries in large language models for retrieval judgment . CoRR, abs/2411.06207
2024 doi
-
[45]
online" 'onlinestring :=
ENTRY address archivePrefix author booktitle chapter edition editor eid eprint eprinttype howpublished institution journal key month note number organization pages publisher school series title type volume year doi pubmed url lastchecked label extra.label sort.label short.list...
-
[46]
write newline
" write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.