LACRM: LLM-Guided Mining of Directed Advertiser Competition Relationships in E-Commerce Advertising
summary
The gist
The gist In e-commerce advertising, ad platforms typically fail to model the externalities among advertisers when making optimization decisions, and this paper proposes LACRM, a novel framework that
In short
LACRM proposes a framework to model competition among e-commerce advertisers by creating directed competition graphs with continuous edge intensities. It uses a three-stage pipeline—Dual-Profile Generation, Multi-Route Retrieval, and Dynamic Behavioral Alignment—to learn how advertisers compete. The method successfully identifies latent rivals beyond historical data and shows measurable revenue gains in online bidding experiments.
Key concepts
- Continuous Intensity
- This concept measures the strength of competition between two advertisers as a continuous value rather than just a binary 'rival/not rival.' It is operationally approximated by analyzing how much traffic one advertiser diverts from another within auction settings, capturing subtle competitive pressure.
- Dual-Profile Generation
- Advertiser profiles are split into two views: an invariant factual profile ('who the merchant is') and a variable query profile ('which cohort of rivals they target'). This allows the system to understand both a merchant's identity and their strategic targeting behavior simultaneously.
- Latent Discovery Competition
- The framework goes beyond known rivals by discovering competition that hasn't been observed in past auctions. It uses LLMs to generate semantic representations, allowing it to uncover hidden competitive relationships between advertisers based on their underlying business profiles.
Terminology used across episodes
This episode discusses
- LACRM: LLM-Guided Mining of Directed Advertiser Competition Relationships in E-Commerce Advertising · Paper Radio
- Seed2.0 Model Card: Towards Intelligence Frontier for Real-World Complexity
- DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence
- GLM-5: from Vibe Coding to Agentic Engineering
- A Survey on LLM-as-a-Judge
- Inherent Limits on Topology-Based Link Prediction
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- InterCorpRel-LLM: Enhancing Financial Relational Understanding with Graph-Language Models
- Text Embeddings by Weakly-Supervised Contrastive Pre-training
- Qwen3 Technical Report
- Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models
The paper
LACRM: LLM-Guided Mining of Directed Advertiser Competition Relationships in E-Commerce Advertising · Read on arXiv
Xiang Shi, Yitian Kou, Bing Li, Shengsheng Niu, Chun Gan, Linghui Meng, Jie He, Zhangang Lin
JD.com, Beijing, China and East China Normal University, Shanghai
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: Today's paper: "LACRM: LLM-Guided Mining of Directed Advertiser Competition Relationships in E-Commerce Advertising".
Jane: The gist In e-commerce advertising, ad platforms typically fail to model the externalities among advertisers when making optimization decisions, and this paper proposes LACRM,
Tom: First, who's behind it and why it matters.
Title and authors: Tom: So, we're looking at this paper called "LACRM: LLM-Guided Mining of Directed Advertiser Competition Relationships in E-Commerce Advertising". Jane, how would you quickly explain what that title means for someone who isn't deep in the field?
Jane: Well, basically, it’s about using a large language model to find out who is competing with whom in online advertising—and not just if they are similar advertisers. It focuses on making those competition relationships directed and weighted.
Lu: What that means is that instead of seeing two companies as just being similar, the system wants to show the specific way one advertiser pressures another, which is a one-way street.
Meng: So, it’s moving past simple similarity checks to something more nuanced about how rivals are actually interacting in the market structure.
Lalam: The core idea is building these directed competition graphs with continuous edge weights, which acts as this foundational representation for whatever you want to do next downstream.
The paper's summary: Tom: So, what’s the main mechanism they propose to achieve this? I’m looking for the technical setup—what are they building?
Jane: They propose a three-stage pipeline. It starts with Dual-Profile Generation, then Multi-Route Retrieval, and finally Dynamic Behavioral Alignment. It’s quite structured.
Lu: Module one is Dual-Profile Generation, where they structurally decouple each advertiser’s semantic footprint into two views: an Advertiser Representation and a Query Representation. The AR captures the merchant's market identity, while the QR characterizes which cohort of rivals the merchant targets.
Meng: That sounds like they are trying to define *who* you are versus *who* you want to hit with your ads, which is a big concept in itself.
Lalam: And Module two handles Multi-Route Retrieval using these profiles. They decompose the query space into five fine-grained competitive views, derived from brand relations and category relations, plus a temporal overlay.
Tom: Five views? Are we talking about five different ways to look at competition? And what's the final scoring mechanism?
Jane: The final refinement is in Module three, which uses a listwise Learning-to-Rank paradigm implemented with LambdaMART. This produces the final score for the directed competition intensity, sfinal(vi → vj) = HLTR(xi j).
The paper's improvements: Tom: What are they trying to improve over what we have now? What’s the specific claim here about their method versus other approaches?
Lu: They address the issue that existing methods, like interaction graphs or single-embedding models, don't fully capture the directed and intensity-aware nature of competition. They propose this framework specifically to infer a directed, weighted graph quantifying asymmetric competitive intensities among advertisers.
Meng: So they are tackling the problem where old methods treat competition as symmetric or just binary pairs, and they claim LACRM is better at modeling that asymmetry.
Jane: The paper also suggests improvements in verification through latent rivalry detection. They use an ensemble of LLM-as-a-Judge scorers alongside a blind human expert study to validate these latent relations.
Lalam: They found that the LLM judges clearly separate the realized and negative controls, showing strong cross-judge agreement with an ICC of zero point nine one eight and a mean pairwise Spearman correlation of zero point nine four six, which is really high confidence in their findings <ref:2610.13959#pg1>.
Tom: And what about the real-world impact? Where do these improvements lead us in practice?
Jane: The online experiments show that when you use LACRM signals for competition-aware bidding, you see a one point seven three percent increase in ad revenue and a zero point nine one percentage-point improvement in the daily budget-target fulfillment rate.
Conclusion: Tom: So, to wrap up, what’s the big picture here? What is the main implication for how we think about advertising optimization?
Jane: The main implication is that explicit competition modeling provides a reusable market representation for advertiser-facing optimization tasks. It moves us toward a system that understands directed competitive pressure.
Lu: They successfully combine the broad coverage of LLM-derived semantic representations with the precision of observed behavioral evidence to capture heterogeneous patterns and directional pressure.
Meng: What’s important is that they showed this works beyond just historical auction interactions; they discovered latent rivals too, which is a major addition to the signal we get.
Lalam: The LACRM framework enables the capture of heterogeneous competition patterns and the distinction of directional competitive pressure, leading to measurable gains in advertising revenue and budget utilization when deployed.
Tom: So, this paper successfully combines LLM semantic coverage with behavioral evidence to create a usable market structure representation for optimization. That’s what we have today with LACRM.
More episodes
- 2610.13819-Shared Canonical Component Removal Beyond Expert Views
- 2610.13844-Inference-Time Steering Across Scaffolds and Epitopes for Sample-Efficient De Novo Nanobody Design
- 2610.13871-Partially Informed Stochastic Optimization via Zeroth-Order Residual Tracking
- 2610.13990-DoSA: Dots Sparse Attention
- 2610.13881-Prediction Is Not a Sufficient Memory State
- 2610.14023-Historical Anchors for Scientific Forecasting on Human-Aware Knowledge Graphs
- 2610.14012-Perfect Reconstruction Cannot Show Whether Two Codebooks on a VAE's Latent Space Agree
- 2610.13711-Towards Understanding the Training of GFlowNets: A Theoretical Perspective
- 2610.14097-A Physics-Informed Hybrid Forward-Inverse Machine Learning Framework for High-Dimensional Sparse Recipe Reconstruction
- 2610.13750-Studying the Effects of Task Diversity Using Small Mathematical Worlds