Demo Data from EDBT 2026 / reviewers in the wild / expert
Debabrata Mishra
dblp:380/0959
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0003-8483-3738ORCID · 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 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › indexing › index compression
index pruning |
0.8 | 1 | 2024 | Neural Passage Quality Estimation for Static Pruning · SIGIR 2024 |
Information retrieval › retrieval models
neural retrieval |
0.2 | 1 | 2024 | Neural Passage Quality Estimation for Static Pruning · SIGIR 2024 |
Methods — techniques the papers use, named apart from their topics
pre-trained language model · 0.8neural network · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Neural Passage Quality Estimation for Static PruningabstractNeural networks-especially those that use large, pre-trained language models-have improved search engines in various ways. Most prominently, they can estimate the relevance of a passage or document to a user's query. In this work, we depart from this direction by exploring whether neural networks can effectively predict which of a document's passages are unlikely to be relevant to any query submitted to the search engine.We refer to this query-agnostic estimation of passage relevance as a passage's quality.We find that our novel methods for estimating passage quality allow passage corpora to be pruned considerably while maintaining statistically equivalent effectiveness; our best methods can consistently prune >25% of passages in a corpora, across various retrieval pipelines. Such substantial pruning reduces the operating costs of neural search engines in terms of computing resources, power usage, and carbon footprint-both when processing queries (thanks to a smaller index size) and when indexing (lightweight models can prune low-quality passages prior to the costly dense or learned sparse encoding step). This work sets the stage for developing more advanced neural "learning-what-to-index" methods. Xuejun Chang, Debabrata Mishra, Craig Macdonald, Sean MacAvaney |
SIGIR | 2 |