MORES (Modularized Transformer-Based Ranking Framework)
Architectures AIMech:MORESModularizedTransformerBasedRankingFramework DRAFT
Aliases: MORES, MOdualarized REranking System, Modularized Transformer-Based Ranking Framework, EARL (Speedup Transformer-based Rankers with Pre-computed Representation)
A modularized Transformer-based document reranking architecture (Gao, Dai, & Callan, EMNLP 2020; initially introduced as EARL in arXiv:2004.13313v1) that decouples neural ranking into three separate Transformer modules—an offline Document Representation Module producing D in R^{d x n}, an online Query Representation Module producing Q in R^{q x n}, and an online Interaction Module composed of stacked Interaction Blocks (IB) that perform query-to-document cross-attention Q_x = LN(Attend(Q, D) + Q) followed by query self-attention Q_self = LN(Attend(Q_x, Q_x) + Q_x) while keeping document representations D unchanged—enabling up to 120x online ranking speedup via offline document representation reuse (Reuse-S1) and projected key-value document representation reuse (Reuse-S2).
Identity Notes & Concept Scope
Distinct from concatenated cross-encoder BERT rankers (which apply quadratic O((d+q)^2) full self-attention across query and document in every layer), from late-interaction ColBERT (AIMech:ColBERTContextualizedLateInteractionOverBERT, which computes MaxSim dot products without learned Transformer Interaction Blocks), and from DC-BERT (AIMech:DCBERTDecouplingQuestionAndDocumentForEfficientContextualEncoding, which feeds concatenated upper-layer query and document tokens into full (d+q)^2 self-attention layers). MORES restricts online interaction in each Interaction Block strictly to query-to-document cross-attention O(q*d) plus query self-attention O(q^2), leaving D fixed so that per-IB key/value projections D_proj = {D W_k, D W_v} can be pre-computed offline under Reuse-S2.
Claims & Grounded Evidence
4 Claims
Mechanism
#mores-interaction-block-cross-and-query-self-attention
Given independent document representations D = H_M^{doc} in R^{d x n} and query representations Q = H_N^{qry} in R^{q x n}, each MORES Interaction Block (IB) computes query-to-document cross-attention Q_x = LN(Attend(Q, D) + Q), query-only self-attention Q_self = LN(Attend(Q_x, Q_x) + Q_x), and feed-forward residual refinement IB(Q, D) = LN(FFN(Q_self) + Q_self) (Equations 5-9) while keeping D unchanged across all K Interaction Blocks before scoring via score(qry, doc) = w^T CLS(H_K^{IB}) (Equation 10).
Mechanism
#mores-reuse-s1-and-reuse-s2-offline-precomputation
MORES supports two mathematically equivalent offline pre-computation strategies: Document Representation Reuse (Reuse-S1), which stores D in R^{d x n} offline to eliminate the O(n d^2) document self-attention term at query time, and Projected Document Representation Reuse (Reuse-S2), which pre-computes and stores the key and value projections D_proj = {D W_k, D W_v} for each of the l Interaction Blocks (Equations 11-12) to further eliminate the O(n^2 d) online linear projection cost per candidate document (Table 1).
Application
#mores-ms-marco-noninferiority-and-120x-speedup
Initialized via BERT-weight-assisted layer splitting (where the first 12 - l BERT layers initialize the Query Representation Module and the remaining l layers initialize the Interaction Blocks with copied self-attention weights), MORES with 2x IB achieves statistical non-inferiority within a 2% margin to a full BERT ranker on MS MARCO Dev (0.3456 vs. 0.3527 MRR@10) and TREC 2019 DL (0.7026 vs. 0.7032 NDCG@10) while delivering 124x GPU and CPU speedup on 512-token documents under Reuse-S2 (Table 2 & Table 4).
Limitation
#mores-storage-footprint-and-deeper-ib-optimization-drop
Under Reuse-S2, storing 2*l projected document matrices D W_k and D W_v increases uncompressed storage to 12.0 MB per 512-token document for 2x IB (vs. 1.5 MB under Reuse-S1), and increasing the Interaction Module beyond 2 blocks (3x IB or 4x IB) degrades ranking accuracy (from 0.3456 to 0.3307 MRR@10) due to optimization difficulty of cross-attention layers lacking native cross-attentive pre-training.
⚠️ Curated Limitations & Negative Results
- Reuse-S2 requires storing 2*l projected document matrices per document (12 MB uncompressed per 512-token document for 2x IB), and stacking more than 2 Interaction Blocks degrades accuracy due to cross-attention optimization difficulty.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:ArtificialNeuralNetwork
Artificial Neural Network
|
broad_match | MORES is a modular three-Transformer neural network architecture for document reranking. |
Evidence Sources & Primary Literature
3 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
r794-primary-pdf
|
Luyu Gao, Zhuyun Dai, Jamie Callan
|
primary paper
full_text
|
ID: https://arxiv.org/bibtex/2004.13313
sha256:028be97f0b86…
|
r794-arxiv-abs
|
Luyu Gao, Zhuyun Dai, Jamie Callan
|
primary paper
abstract_only
|
ID: https://arxiv.org/abs/2004.13313
sha256:9e7c34f9410b…
|
r794-metadata-cr
|
Luyu Gao, Zhuyun Dai, Jamie Callan
|
primary paper
abstract_only
|
ID: https://arxiv.org/bibtex/2004.13313
sha256:55ebf7bff870…
|
Ontology & Grounding Topology
Open in interactive network graph →Curation Provenance
Curator: Antigravity
Method: ai_assisted
Model: Gemini
Created: 2026-10-19T14:37:00Z
Updated: 2026-10-19T14:37:00Z
Source File:
data/curated/MORESModularizedTransformerBasedRankingFramework.yaml
· Schema:
curated_concept.yaml
Explore across X-Mech
Related computational & biological Mechs:
Embedding Map
Network Graph
ProteinTraitsMech (ESM-2 pLM)
DUFMech (Domain pLM)
TraitMech
CultureMech
All 14 X-Mech Repositories