VLDB 2026 Research / reviewers in the wild / expert
Puji Wang
dblp:412/8719
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0001-3723-1473ORCID · 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 |
Recommender systems · 50% Knowledge graphs · 50% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge graphs
constrained decoding |
1.0 | 1 | 2026 | One-Pass Decoding for Generative Recommendation with WFST-Constrained A* Search · SIGIR 2026 |
Recommender systems
generative recommendation |
1.0 | 1 | 2026 | One-Pass Decoding for Generative Recommendation with WFST-Constrained A* Search · SIGIR 2026 |
Algorithms and data structures › search algorithms › heuristic search
a* search |
0.3 | 1 | 2026 | One-Pass Decoding for Generative Recommendation with WFST-Constrained A* Search · SIGIR 2026 |
Methods — techniques the papers use, named apart from their topics
weighted finite-state transducer · 2.0neural decoding · 2.0a* search · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | One-Pass Decoding for Generative Recommendation with WFST-Constrained A* SearchabstractGenerative recommendation (GR) represents items as discrete semantic identifiers (SIDs) and performs next-item prediction via identifier sequence generation. Most existing methods perform prefix-constrained decoding over a trie, where hard structural constraints lead to locally greedy decisions. An early suboptimal prefix irrevocably restricts subsequent decoding, causing error propagation and suboptimal retrieval. In this work, we propose OneGR, a novel generative recommendation framework that formulates SID prediction as a one-pass, structure-constrained decoding problem. OneGR computes globally consistent, position-wise SID scores in a single neural forward pass, eliminating iterative hypothesis expansion and repeated inference. To address the extreme sparsity of valid SIDs, we encode the space of valid SIDs as a deterministic weighted finite-state transducer and perform A* search with the one-pass scores as additive path costs. This structured decoding strategy explores only reachable valid prefixes while guaranteeing the optimal SID prediction. Experiments on multiple benchmarks show that OneGR consistently outperforms strong baselines. Puji Wang, Yingchen Zhang, Ruqing Zhang 0001, Jiafeng Guo, Xueqi Cheng 0001 |
SIGIR | 1 |