Demo Data from SIGIR 2026 / reviewers in the wild / expert
Max Lepikhin
dblp:297/0356
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
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 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › ranking
learning to rank |
0.5 | 1 | 2021 | Fast Attention-based Learning-To-Rank Model for Structured Map Search · SIGIR 2021 |
Information retrieval › ranking › learning to rank
neural learning to rank |
0.5 | 1 | 2021 | Fast Attention-based Learning-To-Rank Model for Structured Map Search · SIGIR 2021 |
Information retrieval
retrieval models |
0.5 | 1 | 2021 | Fast Attention-based Learning-To-Rank Model for Structured Map Search · SIGIR 2021 |
Information retrieval › document retrieval
structured document retrieval |
0.5 | 1 | 2021 | Fast Attention-based Learning-To-Rank Model for Structured Map Search · SIGIR 2021 |
Information retrieval › web search
map search |
0.1 | 1 | 2021 | Fast Attention-based Learning-To-Rank Model for Structured Map Search · SIGIR 2021 |
Information retrieval
search engines |
0.1 | 1 | 2021 | Fast Attention-based Learning-To-Rank Model for Structured Map Search · SIGIR 2021 |
Methods — techniques the papers use, named apart from their topics
transformer · 0.5self-attention · 0.5gradient boosted decision trees · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Fast Attention-based Learning-To-Rank Model for Structured Map SearchabstractRecent works show that Transformer-based learning-to-rank (LTR) approaches can outperform previous well-established ranking methods, such as gradient-boosted decision trees (GBDT), on document and passage re-ranking problems. A common assumption in these works is that the query and the result documents are comprised of purely textual information without explicit structure. In map search, the relevance of results is determined based on rich heterogeneous features - textual features derived from the query and the results, geospatial features such as proximity of a result to the user, structured features reflecting the address format of the result, and the perceived structure of the query. In this work, we propose a novel deep neural network LTR architecture, capable of seamlessly handling heterogeneous inputs, similar to GBDT-based methods. At the same time, unlike GBDT, the architecture does not require human input via (numerous) carefully-crafted features. Instead, features are inferred through a self-attention mechanism. Our model implements two lightweight attention layers optimized for ranking: the first layer computes query-result similarities, the second implements listwise ranking inference. We perform evaluation on several single language and one multilingual dataset. Our model outperforms by a wide margin other Transformer-based ranking architectures and has equal or better performance than GBDT models. Equally important, runtime inference is orders of magnitude faster than other Transformer architectures, significantly reducing hardware serving costs. The model is a low-cost alternative suitable to power ranking in industrial map search engines across a variety of languages and markets. Chiqun Zhang, Michael R. Evans, Max Lepikhin, Dragomir Yankov |
SIGIR | 3 |