lotte_pooled_dev_search_neomme_260m_li

Multi-vector (late-interaction) embeddings of LoTTE pooled/dev/search (lotte/pooled/dev/search), encoded with Hcompany/NeoMME-260M-Retriever-ST-late at revision 023be2a8ab9d797f5aa76f5bf8b5dde78d819659.

Source data: ir_datasets lotte/pooled/dev/search (ir_datasets 0.6.3), which downloads lotte.tar.gz (md5 3b2e88b1d66933627462950b4c3f5d0f). The ColBERTv2 authors also publish LoTTE on the Hub as colbertv2/lotte, whose card gives this dataset's license; the data here was loaded through ir_datasets, not from that repo. Document, query and qrel ids are the source's own ids, unchanged.

Every document is one variable-length set of 128-d vectors; every query is one variable-length set of 128-d vectors. Documents and queries are stored at different precisions (fp16 and fp32 respectively), see Encoding.

Files

All positional indices (the gt_top*.tsv files, and the row order of every .npy file) refer to the order of doc_ids.npy and queries_ids.npy. Reordering either file invalidates the ground truth.

Statistics

Encoding

Ground truth: gt_top100.tsv

Exact brute-force MaxSim top-100 per query over the full corpus, from the vectors in this repo.

No header; tab-separated qidx docidx rank score:

• qidx: 0-based row into queries_ids.npy / queries.npy
• docidx: 0-based position into doc_ids.npy / doclens.npy
• rank: 1-based, descending score
• score: sum over the query's query_lens[qidx] vectors of max over the document's vectors of the dot product, computed in fp32 with the fp16 document vectors upcast to fp32. Expansion vectors are included in the sum. Printed to 6 decimals.

Retrieval quality

Sanity check of the vectors, not a leaderboard number: gt_top100.tsv (exact MaxSim over the full corpus) scored against qrels.test.tsv with ir_measures.

Loading

import numpy as np

documents = np.load("documents.npy", mmap_mode="r")      # [n_tokens, 128] float16
doclens = np.load("doclens.npy")                         # [n_docs] int32
offsets = np.concatenate([[0], np.cumsum(doclens)])
doc_ids = np.load("doc_ids.npy")                         # [n_docs] str

def document(i):
    return documents[offsets[i]:offsets[i + 1]]           # [doclens[i], 128]

queries = np.load("queries.npy")                         # [n_queries, 33, 128] float32
query_lens = np.load("query_lens.npy")                   # [n_queries] int32
query_ids = np.load("queries_ids.npy")                   # [n_queries] str

def query(j):
    return queries[j, :query_lens[j]]                     # [query_lens[j], 128]

def maxsim(q, d):
    return (q @ d.astype(np.float32).T).max(axis=1).sum()

Validation

Checks run by the exporter on the files exactly as written here:

• ✅ file set — missing=[] extra=[]
• ✅ documents.npy dtype/shape — <f2 (460307385, 128)
• ✅ doclens.npy dtype/shape — <i4 (2428854,)
• ✅ doc_ids.npy is a string array — <U7 (2428854,)
• ✅ queries.npy dtype/shape — <f4 (2931, 33, 128)
• ✅ query_lens.npy dtype/shape — <i4 (2931,)
• ✅ queries_ids.npy is a string array — <U4 (2931,)
• ✅ sum(doclens) == n_tokens — 460307385 vs 460307385
• ✅ no empty documents — min doclen 2
• ✅ len(doc_ids) == len(doclens) == corpus size — 2428854, 2428854, 2428854
• ✅ doc_ids unique
• ✅ query arrays aligned — 2931, 2931, 2931
• ✅ doc and query dim agree — 128 / 128
• ✅ token_ids.npy dtype/shape — <u4 (460307385,)
• ✅ document vectors unit-norm (100k sample) — norm range [0.9994, 1.0006]
• ✅ query vectors unit-norm — norm range [1.000000, 1.000000]
• ✅ all vectors finite
• ✅ gt_top100.tsv has k rows per query — 293100 rows, k=100
• ✅ gt rows grouped by qidx with ranks 1..k and descending scores
• ✅ gt indices in range

Provenance