Skip to content

Author

Changsung Kang

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#natural language process... Preprint Sep 2026

It Takes Two to Match: Co-Evolving Generative Retriever with Reinforcement Learning

Retrieval is the first stage of modern search and advertising systems, selecting a candidate set from a large item universe for downstream ranking and auction. Recent work increasingly leverages LLMs to improve retrieval through query expansion, data synthesis, and retrieval-feedback training. However, the generative component is typically used for query-side augmentation, while final matching is still delegated to a downstream retriever. We introduce CoGR, a retrieval framework that instead trains LLMs to directly construct retrieval representations on both query and item sides. Each generator produces a compact set of keywords, which are matched directly through an inverted index, preserving compatibility with existing keyword-based retrieval infrastructure. CoGR uses a two-stage training pipeline. Supervised fine-tuning first establishes an aligned keyword space, after which co-evolving reinforcement learning alternately optimizes the query- and item-side generators with GRPO against the opposite side's frozen index. Both sides optimize the same query-to-item retrieval $F_1$ objective: the query side receives retrieval $F_1$ directly, while the item side receives a counterfactual marginal reward measuring the change in query-side $F_1$ caused by its generated keywords. Across 10 representative sparse, dense, and generative baselines, CoGR achieves the best performance on both an internal APP Marketplace dataset and the public WANDS benchmark, improving $F_1$ over the strongest baseline by $10.9\%$ and $36.1\%$, respectively. Further analysis shows stable co-evolution and increasingly aligned query--item keyword spaces over training.

Runpeng Dai, Kai-Li Huang, Changsung Kang et al. · 0 citations
Book Open access Jul 2026

Learning to Summarize for Search Relevance with Reinforcement Learning

E-commerce search ranking models face the challenging and critical problem of balancing strict real-time latency constraints with the need for high-quality relevance predictions. In production environments, ranking models often rely primarily on product titles, which frequently omit critical attributes required to satisfy diverse query intents. While full product descriptions provide richer information, their length and verbosity make them computationally impractical for real-time ranking, particularly when using cross-encoder architectures. To address this challenge, we propose ReLSum, a reinforcement learning framework that generates concise, relevance-optimized product summaries for search ranking. ReLSum directly aligns summarization with the ranking objective by using downstream relevance scores as reward signals. The framework conditions the Large Language Model (LLM) solely on product information, while queries are used only to compute rewards during training. This design enables summaries to be generated and cached offline, ensuring no additional inference latency at serving time. Experiments on large-scale production data show substantial improvements in offline NDCG and recall. In online A/B tests, ReLSum delivers statistically significant gains in user engagement metrics such as orders per visitor and units per completed order, with particularly strong improvements for tail queries.

Nitin Yadav, Changsung Kang, Hongwei Shang · 0 citations