mlsanityData to 7 Oct 2026

asLLR: LLM based Leads Ranking in Auto Sales

arXiv 2510.21713 ↗First posted 10 Sep 2025cs.IR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In the area of commercial auto sales system, high-quality lead score sequencing determines the priority of a sale's work and is essential for optimizing the efficiency of the sales system. Since CRM (Customer Relationship Management) system contains plenty of textual interaction features between sales and customers, traditional techniques such as Click Through Rate (CTR) prediction struggle with processing the complex information inherent in natural language features, which limits their effectiveness in sales lead ranking. Bridging this gap is critical for enhancing business intelligence and decision-making. Recently, the emergence of large language models (LLMs) has opened new avenues for improving recommendation systems, 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. This integration enables the simultaneous modeling of both tabular and natural language features. To verify the efficacy of asLLR, we constructed an innovative dataset derived from the customer lead pool of a prominent new energy vehicle brand, with 300,000 training samples and 40,000 testing samples. Our experimental results demonstrate that asLLR effectively models intricate patterns in commercial datasets, achieving the AUC of 0.8127, surpassing traditional CTR estimation methods by 0.0231. Moreover, asLLR enhances CTR models when used for extracting text features by 0.0058. 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, providing a valuable tool for business intelligence and operational decision-making.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 31 references that are in the map. First posted on arXiv 10 Sep 2025.

Builds on

21 of 31 references.

References · 21

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  2. 2020Scaling Laws for Neural Language Modelscited by 6,411
  3. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  4. 2019PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarizationcited by 1,100
  5. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
  6. 2016Wide & Deep Learning for Recommender Systemscited by 745
  7. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
  8. 2019Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Modelcited by 431
  9. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  10. 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
  11. 2016SummaRuNNer: A Recurrent Neural Network based Sequence Model for Extractive Summarization of Documentscited by 245
  12. 2020AutoInt: Automatic Integration for Fast Neural Volume Renderingcited by 204
9 more
  1. 2020Extractive Summarization as Text Matchingcited by 189
  2. 2018Ranking Sentences for Extractive Summarization with Reinforcement Learningcited by 128
  3. 2021MS2: Multi-Document Summarization of Medical Studiescited by 80
  4. 2024Wukong: Towards a Scaling Law for Large-Scale Recommendationcited by 72
  5. 2024CRMArena: Understanding the Capacity of LLM Agents to Perform Professional CRM Tasks in Realistic Environmentscited by 69
  6. 2016Deep Learning over Multi-field Categorical Data: A Case Study on User Response Predictioncited by 67
  7. 2023Summarization is (Almost) Deadcited by 43
  8. 2018Neural Abstractive Text Summarization with Sequence-to-Sequence Modelscited by 39
  9. 2022Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systemscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.