Rethinking Sales Lead Scoring with LLM-based Hierarchical Preference Ranking

• URL: http://arxiv.org/abs/2606.04387v1
• Date: Wed, 03 Jun 2026 03:05:57 GMT
• Title: Rethinking Sales Lead Scoring with LLM-based Hierarchical Preference Ranking
• Abstract summary: Sales lead conversion differs fundamentally from e-commerce recommendation due to prolonged decision cycles and multi-stage funnels.<n>Traditional lead scoring methods face severe challenges: sparse supervision, a semantic gap in unstructured CRM logs, and inability to capture relative lead priority.<n>We introduce an LLM-based discriminative framework for sales lead scoring, which supports joint modeling of structured CRM features and unstructured customer interactions.
• Score: 10.224056739324702
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Sales lead conversion in high-stakes domains (e.g., automotive, real estate) differs fundamentally from e-commerce recommendation due to prolonged decision cycles and multi-stage funnels. Traditional lead scoring methods rule-based scorecards, machine learning, or pointwise CTR models face severe challenges: sparse supervision, a semantic gap in unstructured CRM logs, and inability to capture relative lead priority. While Large Language Models(LLMs) offer superior semantic understanding of customer interactions, general-purpose LLMs are ill-suited for lead ranking: they generate text rather than comparable scores, and lack alignment with the hierarchical priorities of sales funnels. We introduce an LLM-based discriminative framework for sales lead scoring, which supports joint modeling of structured CRM features and unstructured customer interactions. On top of this framework, we propose HPRO (Hierarchical Preference Ranking Optimization), which augments sales lead scoring with a hierarchical preference ranking objective. HPRO employs a margin-aware Bradley-Terry formulation to transform sparse binary labels into dense, funnel-aware preference pairs, enabling lead scoring to leverage both pointwise and pairwise supervision. Experiments on large-scale data from a leading NEV brand demonstrate state-of-the-art classification (AUC 0.8161) and ranking performance (+39.7% precision among top-ranked leads). A 132-day online A/B test validates 9.5% sales volume uplift, confirming real-world commercial impact.

Related papers

• Shared Prefixes, Better Credit: Adaptive Routing for Multi-Agent Reasoning [72.49938949082117]
  Multi-agent reasoning (MAR) improves reasoning reliability through iterative solution exchange and refinement.<n>Existing adaptive MAR methods typically learn routing decisions from query-level labels or trajectory-level returns.<n>We propose TreeCredit, a shared-operator credit assignment framework for efficient adaptive MAR.
  arXiv  Detail & Related papers  (2026-08-03T14:22:23Z)
• SalesLoop: Reinforcement Learning from Performance Feedback for Sales Lead Ranking [3.337528987886516]
  SalesLoop is a performance-aware reward that encodes conversion outcomes weighted by ranking position and conversion velocity.<n>SalesLoop improves NDCG@K by +7.9% and P@K by +15.8% over the strongest static baseline.
  arXiv  Detail & Related papers  (2026-07-22T18:26:57Z)
• Joint Optimization of Relevance and Engagement in Multi-Task Ranking for E-Commerce with Efficient LLM Supervision [2.510555578533785]
  We present a production-scale multi-task ranking system that integrates semantic relevance as a primary optimization objective.<n>Our architecture employs an ordinal relevance head that predicts cumulative probabilities over relevance thresholds.<n>Our approach significantly improves semantic alignment while preserving core engagement objectives.
  arXiv  Detail & Related papers  (2026-05-26T21:26:17Z)
• EPM-RL: Reinforcement Learning for On-Premise Product Mapping in E-Commerce [0.0]
  We present EPM-RL, a reinforcement-learning-based framework for building an efficient on-premise e-commerce product mapping model.<n>Our central idea is to distill high-cost agentic reasoning into a trainable in-house model.<n>Preliminary results show that EPM-RL consistently improves over PEFT-only training and offers a stronger quality--cost trade-off than commercial API-based baselines.
  arXiv  Detail & Related papers  (2026-04-27T03:18:00Z)
• Breaking User-Centric Agency: A Tri-Party Framework for Agent-Based Recommendation [59.362016745945375]
  We propose the first Tri-party LLM-agent Recommendation framework (TriRec)<n>TriRec explicitly coordinates user utility, item exposure, and platform-level fairness.<n>We show consistent gains in accuracy, fairness, and item-level utility.
  arXiv  Detail & Related papers  (2026-03-11T11:40:13Z)
• CDRRM: Contrast-Driven Rubric Generation for Reliable and Interpretable Reward Modeling [61.75914342638658]
  CDRRM (Contrast-Driven Reward Model) is a framework for high-quality rubric generation and guided preference judgment.<n>This work offers a scalable, interpretable, and data-efficient path for reward modeling.
  arXiv  Detail & Related papers  (2026-03-09T07:15:23Z)
• PRECTR-V2:Unified Relevance-CTR Framework with Cross-User Preference Mining, Exposure Bias Correction, and LLM-Distilled Encoder Optimization [6.17916814159778]
  In search systems, effectively coordinating the two core objectives of search relevance matching and click-through rate (CTR) prediction is crucial.<n>We propose PRECTR-V2, which mitigates the low-activity users' sparse behavior problem by mining global relevance preferences.<n>This encoder replaces the frozen BERT module, enabling better adaptation to CTR fine-tuning and advancing beyond the traditional Emb+MLP paradigm.
  arXiv  Detail & Related papers  (2026-02-24T08:26:17Z)
• RGAlign-Rec: Ranking-Guided Alignment for Latent Query Reasoning in Recommendation Systems [25.34524038198569]
  We propose RGAlign-Rec, a closed-loop alignment framework for proactive intent prediction.<n>We also introduce Ranking-Guided Alignment (RGA), a multi-stage training paradigm.<n>Our framework achieves a 0.12% gain in GAUC, leading to a significant 3.52% relative reduction in error rate, and a 0.56% improvement in Recall@3.
  arXiv  Detail & Related papers  (2026-02-13T14:38:02Z)
• RankLLM: Weighted Ranking of LLMs by Quantifying Question Difficulty [102.02839046225468]
  RankLLM is a novel framework designed to quantify both question difficulty and model competency.<n>We evaluate 30 models on 35,550 questions across multiple domains.
  arXiv  Detail & Related papers  (2026-02-12T21:28:46Z)
• asLLR: LLM based Leads Ranking in Auto Sales [31.82007865964295]
  This study introduces asLLR (LLM-based Leads Ranking in Auto Sales), which integrates CTR loss and Question Answering (QA) loss within a decoder-only large language model architecture.<n>Our experimental results demonstrate that asLLR effectively models intricate patterns in commercial datasets, achieving the AUC of 0.8127.<n>In real-world sales scenarios, after rigorous online A/B testing, asLLR increased the sales volume by about 9.5% compared to the traditional method.
  arXiv  Detail & Related papers  (2025-09-10T01:26:29Z)
• In-context Ranking Preference Optimization [65.5489745857577]
  We propose an In-context Ranking Preference Optimization (IRPO) framework to optimize large language models (LLMs) based on ranking lists constructed during inference.<n>We show IRPO outperforms standard DPO approaches in ranking performance, highlighting its effectiveness in aligning LLMs with direct in-context ranking preferences.
  arXiv  Detail & Related papers  (2025-04-21T23:06:12Z)
• On the Role of Feedback in Test-Time Scaling of Agentic AI Workflows [71.92083784393418]
  Agentic AI (systems that autonomously plan and act) are becoming widespread, yet their task success rate on complex tasks remains low.<n>Inference-time alignment relies on three components: sampling, evaluation, and feedback.<n>We introduce Iterative Agent Decoding (IAD), a procedure that repeatedly inserts feedback extracted from different forms of critiques.
  arXiv  Detail & Related papers  (2025-04-02T17:40:47Z)
• Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning [76.50690734636477]
  We introduce Rank-R1, a novel LLM-based reranker that performs reasoning over both the user query and candidate documents before performing the ranking task.<n>Our experiments on the TREC DL and BRIGHT datasets show that Rank-R1 is highly effective, especially for complex queries.
  arXiv  Detail & Related papers  (2025-03-08T03:14:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.