AI Learns to Pick Better Evidence: New Method Rebuilds How Chatbots Find Answers

Retrieval-augmented question answering has become the invisible engine behind many of today’s AI assistants. When a large language model is asked a factual question, a retrieval system first fetches a handful of candidate passages from a document collection, and the model then reads that short stack of text to produce an answer. For years, the dominant assumption has been simple: rank the candidates by relevance, keep the top few, and hand them to the model. A new study published in Complex & Intelligent Systems argues that this assumption quietly wastes some of the most valuable evidence available, and it proposes a fundamentally different way to assemble the context that a question-answering model actually sees.

The research, led by Qilei Ye of Xidian University together with Yan Wang of the Wenzhou Municipal Data Bureau and Chi Chen of Wenzhou University of Technology, introduces a method called MORSE, short for Multi-Objective Retrieval Subset Evolution. Instead of treating evidence selection as a ranking problem, MORSE treats it as a subset optimization problem. The distinction matters more than it might first appear. A ranking tells you which individual passages are most similar to the question, but it says nothing about how those passages work together once they are placed side by side in a fixed context window. Two highly relevant passages may duplicate each other almost entirely, while a slightly lower-ranked passage may contain the single missing fact that completes an evidence chain.

MORSE operates after retrieval, meaning it does not replace the search infrastructure that finds candidate passages in the first place. It is also training-free, so it requires no fine-tuning of the underlying language model and no additional supervised data. Given a question and a pool of retrieved candidates, the method first constructs a question-adaptive search domain, dynamically deciding how wide a slice of the candidate list deserves active consideration. Within that domain, it organizes passages into functional groups: a core group containing the passages most directly responsive to the question, and a support group containing passages that complement the core by adding context, corroboration, or bridging facts.

The heart of the method is a three-objective evaluation of candidate evidence packages. The first objective measures core-evidence quality, asking whether the most important passages in a proposed subset are genuinely strong matches for the question. The second measures support complementarity, rewarding subsets whose supporting passages add distinct information rather than repeating one another. The third measures package efficiency, penalizing bundles that consume context budget without proportional informational payoff. Because these objectives can conflict, a subset that excels on one may lag on another, and there is rarely a single package that dominates all others on every criterion.

To navigate that trade-off space, the authors turn to NSGA-II, a well-established evolutionary algorithm designed for multi-objective optimization. Rather than collapsing the three objectives into a single weighted score, which would force arbitrary trade-off decisions in advance, NSGA-II searches for non-dominated evidence packages: subsets for which no alternative is better on all three objectives simultaneously. The algorithm evolves a population of candidate subsets, combining and mutating them across generations, and returns a front of solutions that represent different balanced compromises among quality, complementarity, and efficiency.

A crucial safety mechanism then decides whether any of these evolved packages should actually replace the straightforward top-ranked prefix. MORSE applies a conservative gate: the upstream ranking is only overridden when protected quantities, such as the strength of the core evidence, remain within predefined margins, and when at least one measurable improvement is obtained. If the evolutionary search produces packages that look better on some objectives but degrade the essentials, the system simply keeps the original ranking. This design acknowledges that post-retrieval reorganization is a refinement, not a replacement, and it protects against the risk of an optimizer trading away reliability for marginal gains elsewhere.

The evaluation spans three widely used question-answering benchmarks: SQuAD v1.1, HotpotQA, and TriviaQA. These datasets probe different skills, from extractive reading comprehension to multi-hop reasoning that requires chaining facts across documents. The authors compare MORSE against a direct Top-5 selection baseline, cross-encoder reranking, maximal marginal relevance, submodular selection, and determinantal point processes, all of which are established techniques for diversifying or refining retrieved context. Under both downstream QA models tested, MORSE yields higher mean F1 scores than Top-5 selection across all three datasets, suggesting that the benefit is not an artifact of one benchmark or one model family.

Some of the strongest numbers emerge from the candidate source analysis on SQuAD. The best overall configuration, combining hybrid retrieval, cross-encoder reranking, and MORSE, reaches 95.72 Recall and 88.54 MRR, with downstream F1 scores of 69.96 for Qwen2.5:7B and 77.40 for Llama3.1:8B. An ablation study under the hybrid Top-100 setting identifies the two components that matter most: the core-quality pathway, which anchors the optimization to genuinely relevant passages, and the conservative gate, which prevents harmful substitutions. Remove either, and the gains shrink considerably, indicating that the method’s success depends on disciplined optimization rather than sheer search power.

Perhaps most striking for practical deployment is the efficiency profile. Under the primary Top-100 setting, MORSE uses an average active search pool of just 40.33 candidates per question and requires only 120.76 milliseconds of processing time per question. That overhead is small enough to slot into production retrieval pipelines without noticeable latency, which distinguishes MORSE from heavier context-construction approaches that might require additional model calls or expensive scoring passes. The question-adaptive search domain is key here: by shrinking the space the evolutionary algorithm must explore, it keeps the multi-objective search tractable even when the initial retrieval returns a large candidate list.

The broader implication of the study is that the pipeline feeding a language model deserves the same optimization attention as the model itself. Upstream retrieval and reranking can be excellent at surfacing individually relevant passages while still leaving useful complementary evidence scattered beyond the leading prefix, where a simple truncation will never reach it. By reframing context construction as the assembly of a coherent evidence package under a fixed budget, and by solving that assembly with principled multi-objective search, MORSE demonstrates that measurable accuracy gains are available at a stage of the pipeline that has often been treated as settled. As retrieval-augmented generation continues to underpin search assistants, enterprise knowledge tools, and AI agents, techniques like this suggest that the next round of performance improvements may come not from bigger models, but from smarter decisions about exactly what those models get to read.

Subject of Research: Multi-objective subset optimization for evidence construction in retrieval-augmented question answering

Article Title: Multi-objective evidence construction in retrieval-enhanced question answering: from ranking to subset optimization

Article References: Multi-objective evidence construction in retrieval-enhanced question answering: from ranking to subset optimization. (n.d.). https://doi.org/10.1007/s40747-026-02520-z

Image Credits: AI Generated

DOI: 10.1007/s40747-026-02520-z

Keywords: retrieval-augmented generation, question answering, evidence package construction, multi-objective optimization, NSGA-II, subset selection, post-retrieval reranking, SQuAD, HotpotQA, TriviaQA, large language models, training-free method