LACRM: LLM-Guided Mining of Directed Advertiser Competition Relationships in E-Commerce Advertising
Listen
Radio episode about this paper
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.
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
cs.LG
Submitted: 2026-08-26
Updated: 2026-08-26
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 87/100
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
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.
Summary
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 constructs directed competition graphs with continuous edge intensities via a three-stage pipeline.
Problem Formulation
The objective is to learn the scoring function s(·) to construct the dense competitive strength matrix W ∈ R N ×N, which serves as a foundational marketstructure representation for downstream tasks The framework is grounded in two core principles: Continuous Intensity and Latent Discovery Competition is characterized by the intensity of traffic diversion from vi attributable to vj, operationally approximated using auction co-occurrence signals The competition score is inherently asymmetric (s(vi → vj) ≠ s(vj → vi)) because 77.41% of all edges are strictly unidirectional
Methodology
LACRM converts structured merchant profiles into continuous asymmetric competition intensities across three sequential stages: Dual-Profile Generation, Multi-Route Retrieval, and Dynamic Behavioral Alignment
Dual-Profile Generation:
The framework structurally decouples each advertiser’s semantic footprint into an asymmetric dual-view representation by defining the LLM-guided Advertiser Representation (AR) and Query Representation (QR) AR is a factual profile that captures who the merchant is
to serve as the invariant retrieval anchor, whereas QR characterizes a strategic, multi-view trajectory identifying which cohort of rivals the merchant targets
to serve as the variable retrieval query
Multi-Route Retrieval:
The system decomposes the query space into a taxonomy of five fine-grained competitive views (V), derived from brand relation and category relation axes, augmented by a temporal overlay For each view ω ∈ V with active fields F(ω) ⊆ F, we define QR(i) = τ(ω)∥ Ê6 k=1 ψκ fk (xi) The resulting dense query embedding q(ωi) and target anchor embedding a j are extracted as follows: q(ωi) = ΦQR(ωi), IQ, a j = ΦAR j, IA
Dynamic Behavioral Alignment:
The final refinement stage is formulated as a fine-grained listwise Learning-to-Rank (LTR) paradigm implemented with LambdaMART The final competition score is produced by a gradient-boosted decision tree ensemble: sfinal(vi → vj) = HLTR(xi j) This ranker learns how the different competition views should be weighted and combined for each candidate pair, together with their interactions with observed market behavior
Experimental Validation
The evaluation is conducted along three dimensions: (1) offline candidate retrieval against realized rivalries, (2) verification of latent rivalries, and (3) online A/B testing in a production advertising system
Offline Retrieval:
The historical Realized Ground Truth graph Greal = (V, Ereal) is established if and only if the share of vi’s traffic diverted by vj within identical auction funnels exceeds a threshold τe = 0.05 over an observation window The novelty fraction indicates that a substantial fraction of evaluation-week competition consists of edges absent from recent history LACRM achieves emerging-edge Recall of 8.6%, 77.9%, and 86.0% at K ∈ 50, 100, respectively
Latent Rivalry Verification:
We assess their legitimacy through two independent and complementary lenses: an ensemble of LLM-as-a-Judge scorers [18] to rate directed competition intensity at scale, and a blind human expert study to guard against shared LLM priors The LLM judges clearly separate the realized and negative controls, with strong cross-judge agreement (ICC = 0.918, mean pairwise Spearman ρ = 0.946; p < 10−16) The latent cohort lies significantly above the negative controls (Mann–Whitney p < 10−16 for each judge) while remaining distinct from realized rivals (KS p ≈ 10−9), with a 61.3% ensemble positive rate
Online Experiments
In the Competition-Aware Bidding Experiment, the LACRM-guided condition yields a 1.73% increase in ad revenue and a 0.91 percentage-point improvement in the daily budget-target fulfillment rate In the Competition-Aware Incentive Experiment, the LACRM-derived competition signals can improve incentive precision and encourage advertisers to express their valuations more actively through bids and budget commitments, yielding a 1.14% increase in ad revenue relative to the existing incentive policy
The results demonstrate that explicit competition modeling provides a reusable market representation for advertiser-facing optimization tasks This framework demonstrates the practical value of explicit competition modeling in large-scale advertising systems. The results suggest that LACRM-derived competition relationships provide a more effective competition signal for auction-level bidding coordination and advertiser budget utilization than the rule-based baseline.
The paper concludes that LACRM enables the capture of heterogeneous competition patterns, the distinction of directional competitive pressure, and the discovery of latent rivals beyond historical auction interactions. The framework successfully combines the broad coverage of LLM-derived semantic representations with the precision of observed behavioral evidence. The results demonstrate that explicit competition modeling in large-scale advertising systems yields measurable gains in advertising revenue and budget fulfillment.
The paper is supported by numerous references including those on auction design [2], market structure surveillance [30], and LLM-based recommendation [42]. The authors contributed equally to this work. The results show that LACRM outperforms its ablated variants and two directed GNN baselines in realized-rival retrieval The deployment of LACRM-guided bidding and incentive allocation increases advertising revenue by 1.73% and 1.14%, respectively.
The paper is supported by numerous references including those on auction design [2], market structure surveillance [30], and LLM-based recommendation [42]. The authors contributed equally to this work. The results show that LACRM outperforms its ablated variants and two directed GNN baselines in realized-rival retrieval. The deployment of LACRM-guided bidding and incentive allocation increases advertising revenue by 1.73% and 1.14%, respectively.
The paper is supported by numerous references including those on auction design [2], market structure surveillance [30], and LLM-based recommendation [42]. The authors contributed equally to this work. The results show that LACRM outperforms its ablated variants and two directed GNN baselines in realized-rival retrieval<ref:
Improvements for AI systems
-
Based on
LACRM (LLM-driven Advertiser Competition Relationship Mining),
an AI system can construct adirected, weighted graph that quantifies asymmetric competitive intensities among advertisers,
providing afoundational market structure representation for downstream tasks.
This allows the system to move beyond symmetric similarity by using LLM-driven role-separated profiling to uncover bothrealized and latent rivals.
-
The improved system can perform
asymmetric multi-route retrieval to surface both realized and latent competitors,
capturing competition across multiple facets. This is achieved by decomposing the query space into five fine-grained competitive views—such asIntra-Brand Cross-Channel Friction
orCross-Category Functional Substitution
—to ensure that one vector does notconflate all competition types.
-
The AI can accurately model directed competition intensity by employing a
listwise learning-to-rank aligned with temporal auction behavior.
This module, using LambdaMART, calibrates semantic candidates against observed market dynamics to produce the final score, as described in the formula:sfinal(vi → vⱼ) = HLTR(xiⱼ).
-
The system can enhance its ability to discover novel competition by implementing a verification protocol. This involves using an
ensemble of LLM-as-a-Judge scorers
and ablind human expert study
to validate latent relations, ensuring that recovered competitors are notmerely model-generated artifacts.
-
In production, the system can improve advertising efficiency by integrating these signals into decision-making. Specifically, LACRM can be used for
LACRM-guided bidding and incentive allocation,
which has been shown to increaseadvertising revenue by 1.73% and 1.14%,
respectively, compared to rule-based baselines.
Sources
- 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
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks