VLDB 2026 Research / reviewers in the wild / expert
Yusuke Takebuchi
dblp:437/6956
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0006-8616-0348ORCID · 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 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › document retrieval › domain-specific retrieval
job search |
1.0 | 1 | 2026 | Policy-Grounded Dynamic Facet Suggestions for Job Search · SIGIR 2026 |
Information retrieval › query reformulation
query refinement |
1.0 | 1 | 2026 | Policy-Grounded Dynamic Facet Suggestions for Job Search · SIGIR 2026 |
Methods — techniques the papers use, named apart from their topics
small language model scoring · 1.0prefix caching · 1.0embedding-based retrieval · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Policy-Grounded Dynamic Facet Suggestions for Job SearchabstractJob seekers often initiate search with short, underspecified queries. At LinkedIn, over 80% of job-related queries contain three or fewer keywords, making accurate user intent inference and relevant job retrieval particularly challenging. We present dynamic facet suggestion (DFS), an interactive query-refinement mechanism that facilitates intent disambiguation by surfacing personalized semantic attributes conditioned on the joint user-query context in real time. We propose a policy-grounded, retrieval-augmented ranking framework for facet suggestion, comprising offline taxonomy curation, embedding-based retrieval of top-K candidates, and a distilled small language model (SLM) based candidate scoring. The system is optimized for real-time serving via point-wise single-token scoring and batching/prefix caching. Offline evaluation demonstrates high precision for generated suggestions, and online A/B tests show significant lifts in suggestion engagement and job search outcomes. Baofen Zheng, Qianqi Shen, Jianqiang Shen, Wenqiong Liu, Chunnan Yao, Ping Liu 0002, Rajat Arora 0002, Kevin Kao, Hsiang Lin, Wanjun Jiang, Yusuke Takebuchi, Jingwei Wu |
SIGIR | 12 |