C. Bayan Bruss
Author directory2026
EnsemW2S: Enhancing Weak-to-Strong Generalization with Large Language Model Ensembles
Aakriti Agrawal | Mucong Ding | Chenghao Deng | Zora Che | Arjun Rajaram | Anirudh Satheesh | Bang An | C. Bayan Bruss | John Langford | Furong Huang
Findings of the Association for Computational Linguistics: ACL 2026
Aakriti Agrawal | Mucong Ding | Chenghao Deng | Zora Che | Arjun Rajaram | Anirudh Satheesh | Bang An | C. Bayan Bruss | John Langford | Furong Huang
Findings of the Association for Computational Linguistics: ACL 2026
With Large Language Models (LLMs) rapidly approaching and potentially surpassing human-level performance, it has become imperative to develop approaches capable of effectively supervising and enhancing these powerful models using smaller, human-level models exposed to only human-level data. We address this critical weak-to-strong (W2S) generalization challenge by proposing a novel method aimed at improving weak experts, by training on the same limited human-level data, enabling them to generalize to complex, super-human-level tasks. Our approach, called EnsemW2S, employs a token-level ensemble strategy that iteratively combines multiple weak experts, systematically addressing the shortcomings identified in preceding iterations. By continuously refining these weak models, we significantly enhance their collective ability to supervise stronger student models. We extensively evaluate the generalization performance of both the ensemble of weak experts and the subsequent strong student model across in-distribution (ID) and out-of-distribution (OOD) datasets. For OOD, we specifically introduce question difficulty as an additional dimension for defining distributional shifts. Our empirical results demonstrate notable improvements, achieving 4%, and 3.2% improvements on ID datasets and, upto 6% and 2.28% on OOD datasets for experts and student models respectively, underscoring the effectiveness of our proposed method in advancing W2S generalization.
Revisiting RAG Retrievers: An Information Theoretic Benchmark
Wenqing Zheng | Dmitri Kalaev | Noah Fatsi | Daniel Barcklow | Owen Reinert | Igor Melnyk | Senthil Kumar | C. Bayan Bruss
Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)
Wenqing Zheng | Dmitri Kalaev | Noah Fatsi | Daniel Barcklow | Owen Reinert | Igor Melnyk | Senthil Kumar | C. Bayan Bruss
Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)
Retrieval-Augmented Generation (RAG) systems rely critically on the retriever module to surface relevant context for large language models. Although numerous retrievers have recently been proposed, each built on different ranking principles such as lexical matching, dense embeddings, or graph citations, there remains a lack of systematic understanding of how these mechanisms differ and overlap. Existing benchmarks primarily compare entire RAG pipelines or rely on aggregate ranking metrics (Recall, MRR, nDCG) that assume item-level independence, providing little guidance on redundancy or complementarity between retrievers. This work presents MIGRASCOPE, a Mutual Information based RAG Retriever Analysis Scope. We introduce principled metrics grounded in information theory to quantify retrieval quality, redundancy/synergy, and marginal contribution. Although the framework is designed to be applicable to any setting where a ground-truth answer can construct a pseudo chunk distribution, the present empirical study focuses on multi-hop question answering - a demanding setting where retriever complementarity is especially pronounced. On four corpora and thirteen SOTA retrievers spanning lexical, dense, and graph-based families, we show that (i) the MI-based divergence metric captures retriever quality dimensions not reflected by Recall or MRR, (ii) graph-based retrievers are redundant with each other while BM25 remains informationally complementary, and (iii) in the multi-hop QA setting, a carefully chosen ensemble guided by MI-based attribution can outperform any single retriever. We position these findings as task-specific insights and provide a reusable framework for retriever analysis that practitioners can re-estimate on their own target domains.