Demo Data from EDBT 2026 / reviewers in the wild / expert
Nischal Subedi
dblp:420/2958
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0004-6017-7358ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 first-author · 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › query reformulation
query expansion |
1.0 | 1 | 2026 | Consensus-Anchored Expansion for Noise-Resilient Re-ranking · SIGIR 2026 |
Information retrieval
ranking |
1.0 | 1 | 2026 | Consensus-Anchored Expansion for Noise-Resilient Re-ranking · SIGIR 2026 |
Information retrieval
reranking |
1.0 | 1 | 2026 | Consensus-Anchored Expansion for Noise-Resilient Re-ranking · SIGIR 2026 |
Information retrieval › retrieval models › neural retrieval
dense retrieval |
0.3 | 1 | 2026 | Consensus-Anchored Expansion for Noise-Resilient Re-ranking · SIGIR 2026 |
Methods — techniques the papers use, named apart from their topics
sparse-dense consensus · 1.0geometric gating · 1.0cross-encoder · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Consensus-Anchored Expansion for Noise-Resilient Re-rankingabstractDense retrievers bridge vocabulary gaps but suffer from semantic drift, ranking topically similar passages that are not actually relevant to the query. Sparse retrievers like BM25 are generally less prone to such false positives but miss paraphrases. We observe that these failure modes are complementary, with relevant passages concentrated in regions where both retrievers score highly, while single-retriever confidence proves unreliable. Building on this insight, we propose AgreRank, a re-ranking method that leverages sparse-dense consensus for query expansion. AgreRank identifies anchor documents where both retrievers agree, expands the query through these verified anchors, and applies geometric gating to suppress drift from the original intent. On TREC Deep Learning 2021 and 2022, AgreRank improves over Dense+CE by 3.4--5.7% and over RRF+CE by 3.7--5.6% under identical retrieval and reranking components, achieving nDCG@10 of 0.706 and 0.627 with a lightweight 33M-parameter cross-encoder. These gains require no additional parameters or training, demonstrating that more effective use of retrieval signals offers a practical alternative to model scaling. Nischal Subedi, Cencheng Shen |
SIGIR | 1 |