The reviewed record of science sign in
Pith

arxiv: 2010.00200 · v1 · pith:R5HC2G4G · submitted 2020-10-01 · cs.IR · cs.CL

RRF102: Meeting the TREC-COVID Challenge with a 100+ Runs Ensemble

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:R5HC2G4Grecord.jsonopen to challenge →

classification cs.IR cs.CL
keywords challengerunsensembletrec-covidsystemsablationachievedapproach
0
0 comments X
read the original abstract

In this paper, we report the results of our participation in the TREC-COVID challenge. To meet the challenge of building a search engine for rapidly evolving biomedical collection, we propose a simple yet effective weighted hierarchical rank fusion approach, that ensembles together 102 runs from (a) lexical and semantic retrieval systems, (b) pre-trained and fine-tuned BERT rankers, and (c) relevance feedback runs. Our ablation studies demonstrate the contributions of each of these systems to the overall ensemble. The submitted ensemble runs achieved state-of-the-art performance in rounds 4 and 5 of the TREC-COVID challenge.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Ultrametric Graphons and Hierarchical Community Networks: Spectral Theory and Applications

    math.SP 2026-05 unverdicted novelty 7.0

    Ultrametric graphons model hierarchical community networks and yield closed-form Laplacian spectra that approximate those of sampled random graphs with high probability as hierarchy depth grows.

  2. Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks

    cs.NE 2026-05 unverdicted novelty 7.0

    Multi-hop graph analysis of RNNs reveals temporal information routing and motivates resolvent regularization that outperforms L1 by enforcing pathway-level sparsity aligned with task structure.

  3. Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks

    cs.NE 2026-05 unverdicted novelty 7.0

    RNN computation is recovered from multi-hop graph pathways, and constraining these pathways via resolvent regularization yields improved temporal sparsity and task performance over standard L1.

  4. Evolutionary Optimization Reveals Structural Constraints on Reservoir Architecture for Spatiotemporal Chaos

    cs.NE 2026-06 unverdicted novelty 6.0

    Evolutionary selection on reservoir size, connectivity, spectral radius, input scaling, and regularization for Kuramoto-Sivashinsky forecasting reveals a conserved stochastic-block-model spectral envelope, locked inte...

  5. Agentic Hybrid RAG for Evidence-Grounded Muon Collider Analysis

    hep-ex 2026-06 unverdicted novelty 6.0

    Agentic hybrid RAG with a new muon collider benchmark outperforms baselines in retrieval effectiveness, answer quality, evidence coverage, and factual grounding.