Skip to content
aiqbench takeAI Research

aiqbench analysis

This research introduces SERM, a self-evolving relevance model that leverages multi-agent systems to overcome data sparsity and unreliable pseudo-labels in massive search query streams. By employing specialized modules for sample mining and two-level agreement annotation, the approach enables iterative improvement without relying on external human feedback or static datasets. The method demonstrates significant performance gains across multilingual evaluations and real-world industrial deployments serving billions of daily requests.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

SERM: Self-Evolving Relevance Model with Agent-Driven Learning from Massive Query Streams

arXiv2 min read

arXiv:2601.09515v3 Announce Type: replace Abstract: Due to the dynamically evolving nature of real-world query streams, relevance models struggle to generalize to practical search scenarios. A sophisticated solution is self-evolution techniques. However, in large-scale industrial settings with massive query streams, this technique faces two challenges: (1) informative samples are often sparse and difficult to identify, and (2) pseudo-labels generated by the current model could be unreliable. To address these challenges, in this work, we propose a Self-Evolving Relevance Model approach (SERM), which comprises two complementary multi-agent modules: a multi-agent sample miner, designed to detect distributional shifts and identify informative training samples, and a multi-agent relevance annotator, which provides reliable labels through a two-level agreement framework. We evaluate SERM in a large-scale industrial setting, which serves billions of user requests daily. Experimental results demonstrate that SERM can achieve significant performance gains through iterative self-evolution, as validated by extensive offline multilingual evaluations and online testing.

Abstract:Due to the dynamically evolving nature of real-world query streams, relevance models struggle to generalize to practical search scenarios. A sophisticated solution is self-evolution techniques. However, in large-scale industrial settings with massive query streams, this technique faces two challenges: (1) informative samples are often sparse and difficult to identify, and (2) pseudo-labels generated by the current model could be unreliable. To address these challenges, in this work, we propose a Self-Evolving Relevance Model approach (SERM), which comprises two complementary multi-agent modules: a multi-agent sample miner, designed to detect distributional shifts and identify informative training samples, and a multi-agent relevance annotator, which provides reliable labels through a two-level agreement framework. We evaluate SERM in a large-scale industrial setting, which serves billions of user requests daily. Experimental results demonstrate that SERM can achieve significant performance gains through iterative self-evolution, as validated by extensive offline multilingual evaluations and online testing.

Computation and Language (cs.CL)

arXiv:2601.09515 [cs.CL]

(or arXiv:2601.09515v3 [cs.CL] for this version)

Full text under the publisher's open licence · 159 words

Related coverage