Demo Data from VLDB 2026 / reviewers in the wild / expert
Mengxiang Chen
dblp:420/1118
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0007-7367-3408ORCID · 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 · 81% Query processing and optimization · 19% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
e-commerce search |
1.0 | 1 | 2026 | Probe-then-Plan: Environment-Aware Planning for Industrial E-commerce Search · SIGIR 2026 |
Query processing and optimization
query rewriting |
0.3 | 1 | 2026 | Probe-then-Plan: Environment-Aware Planning for Industrial E-commerce Search · SIGIR 2026 |
Information retrieval
web search |
0.3 | 1 | 2026 | Probe-then-Plan: Environment-Aware Planning for Industrial E-commerce Search · SIGIR 2026 |
Methods — techniques the papers use, named apart from their topics
supervised fine-tuning · 1.0retrieval probe · 1.0reinforcement learning · 1.0large language model · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Probe-then-Plan: Environment-Aware Planning for Industrial E-commerce SearchabstractModern e-commerce search is evolving from simple keyword matching to resolving complex user intents. While large language models (LLMs) offer powerful reasoning capabilities, existing LLM-based search paradigms suffer from a fundamental blindness-latency dilemma: query rewriting methods are agnostic to retrieval tool capabilities and real-time inventory states, resulting in invalid plans; conversely, deep search agent approaches initially plan without environment awareness, then rely on iterative tool calls and reflection to perceive and correct failures, leading to seconds of latency, incompatible with the sub-second budget for the planning module in industrial e-commerce search. To resolve this conflict, we propose Environment-Aware Search Planning (EASP), a novel paradigm that reformulates search planning as a dynamic reasoning process grounded in environmental reality. EASP introduces a Probe-then-Plan mechanism: a lightweight Retrieval Probe first exposes the retrieval snapshot, enabling the Planner to diagnose execution gaps and generate grounded search plans. Our methodology unfolds in three stages: (1) Offline Data Synthesis: The Teacher Agent synthesizes diverse, execution-validated plans by diagnosing the retrieval environment exposed by the Retrieval Probe. (2) Planner Training and Alignment: The Planner is initialized via supervised fine-tuning (SFT) on the offline dataset to internalize the Teacher's diagnostic capabilities, followed by alignment with business outcomes (conversion rate) through reinforcement learning. (3) Adaptive Online Serving: A complexity-aware routing mechanism selectively activates the planning pipeline only for complex queries, ensuring optimal resource allocation. Extensive offline evaluations and online A/B testing on JD.com demonstrate that EASP significantly improves relevant recall and achieves substantial lifts in UCVR and GMV. EASP has been successfully deployed in JD.com's AI-Search system. Mengxiang Chen, Zhouwei Zhai, Jin Li 0069 |
SIGIR | 1 |