Demo Data from VLDB 2026 / reviewers in the wild / expert
Raghav Vasudeva
dblp:440/7387
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0003-3868-9886ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › retrieval models › probabilistic retrieval model
BM25 |
1.0 | 1 | 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM · SIGIR 2026 |
Information retrieval
evaluation |
1.0 | 1 | 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM · SIGIR 2026 |
Information retrieval › retrieval models
lexical retrieval |
1.0 | 1 | 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM · SIGIR 2026 |
Information retrieval › reranking
LLM-based reranking |
1.0 | 1 | 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM · SIGIR 2026 |
Information retrieval › evaluation › evaluation methodology
reproducibility |
1.0 | 1 | 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM · SIGIR 2026 |
Information retrieval
reranking |
1.0 | 1 | 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM · SIGIR 2026 |
Information retrieval › evaluation › test collection
retrieval benchmark |
1.0 | 1 | 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM · SIGIR 2026 |
Information retrieval
retrieval models |
1.0 | 1 | 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLM · SIGIR 2026 |
Methods — techniques the papers use, named apart from their topics
sparse retrieval · 1.0fusion-based retrieval · 1.0dense retrieval · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Lighting the Way for BRIGHT: Reproducible Baselines with Anserini, Pyserini, and RankLLMabstractRetrieval benchmarks for large language models (LLMs) should reflect the long, reasoning-intensive queries typical of retrieval-augmented generation (RAG). We present a systematic study of BRIGHT, a reasoning-focused retrieval benchmark, along with strong, reproducible reference methods integrated into Anserini, Pyserini, and RankLLM. We evaluate lexical, sparse, dense, and fusion-based retrievers, as well as LLM rerankers, under long-query settings. In reproducing BRIGHT's lexical baseline, we identify a key under-documented detail: query-side BM25 (BM25Q), which applies BM25 weighting to the query itself. On long, multi-sentence queries, BM25Q consistently outperforms standard BM25, making it the strongest lexical baseline for reasoning-oriented retrieval. We further audit the BRIGHT corpus, uncovering data quality issues that impact evaluation, and offer mitigation. Finally, we study the generalizability of BM25Q across five additional benchmarks, finding its gains largely specific to BRIGHT, while fusion with standard BM25 provides the most consistent improvements across datasets. Sahel Sharifymoghaddam, Yijun Ge, Raghav Vasudeva, Jimmy Lin |
SIGIR | 3 |