Abstract:Modern e-commerce search is evolving to resolve complex user intents. While Large Language Models (LLMs) offer strong reasoning, existing LLM-based paradigms face a fundamental blindness-latency dilemma: query rewriting is agnostic to retrieval capabilities and real-time inventory, yielding invalid plans; conversely, deep search agents rely on iterative tool calls and reflection, incurring seconds of latency incompatible with industrial sub-second budgets. To resolve this conflict, we propose Environment-Aware Search Planning (EASP), reformulating search planning as a dynamic reasoning process grounded in environmental reality. EASP introduces a Probe-then-Plan mechanism: a lightweight Retrieval Probe exposes the retrieval snapshot, enabling the Planner to diagnose execution gaps and generate grounded search plans. The methodology comprises three stages: (1) Offline Data Synthesis: A Teacher Agent synthesizes diverse, execution-validated plans by diagnosing the probed environment. (2) Planner Training and Alignment: The Planner is initialized via Supervised Fine-Tuning (SFT) to internalize diagnostic capabilities, then aligned with business outcomes (conversion rate) via Reinforcement Learning (RL). (3) Adaptive Online Serving: A complexity-aware routing mechanism selectively activates planning for complex queries, ensuring optimal resource allocation. Extensive offline evaluations and online A/B testing on this http URL demonstrate that EASP significantly improves relevant recall and achieves substantial lifts in UCVR and GMV. EASP has been successfully deployed in this http URL's AI-Search system.
| Subjects: | Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2603.15262 [cs.AI] |
| (or arXiv:2603.15262v2 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2603.15262 arXiv-issued DOI via DataCite |
|
| Related DOI: | https://doi.org/10.1145/3805712.3808459
DOI(s) linking to related resources |
Submission history
From: Mengxiang Chen [view email]
[v1]
Mon, 16 Mar 2026 13:28:01 UTC (215 KB)
[v2]
Wed, 29 Apr 2026 03:03:55 UTC (215 KB)
