Middleman Bias in Advertising: Aligning Relevance of Keyphrase Recommendations with Search

• URL: http://arxiv.org/abs/2502.00131v2
• Date: Fri, 14 Feb 2025 05:05:02 GMT
• Title: Middleman Bias in Advertising: Aligning Relevance of Keyphrase Recommendations with Search
• Authors: Soumik Dey, Wei Zhang, Hansi Wu, Bingfeng Dong, Binbin Li,
• Abstract summary: We describe the shortcomings of training relevance filter models on biased click/sales signals. We re-conceptualize advertiser keyphrase relevance as interaction between two dynamical systems. We discuss the bias of search relevance systems and the need to align advertiser keyphrases with search relevance signals.
• Score: 4.275764895529604
• License:
• Abstract: E-commerce sellers are recommended keyphrases based on their inventory on which they advertise to increase buyer engagement (clicks/sales). Keyphrases must be pertinent to items; otherwise, it can result in seller dissatisfaction and poor targeting -- towards that end relevance filters are employed. In this work, we describe the shortcomings of training relevance filter models on biased click/sales signals. We re-conceptualize advertiser keyphrase relevance as interaction between two dynamical systems -- Advertising which produces the keyphrases and Search which acts as a middleman to reach buyers. We discuss the bias of search relevance systems (middleman bias) and the need to align advertiser keyphrases with search relevance signals. We also compare the performance of cross encoders and bi-encoders in modeling this alignment and the scalability of such a solution for sellers at eBay.

Related papers

• HCMRM: A High-Consistency Multimodal Relevance Model for Search Ads [10.61722566941537]
  This paper focuses on improving query-to-video relevance matching to enhance the effectiveness of ranking in ad systems. It utilizes a simple yet effective method to enhance the consistency between pre-training and relevance tasks. The proposed method has been deployed in the Kuaishou search advertising system for over a year, contributing to a 6.1% reduction in the proportion of irrelevant ads and a 1.4% increase in ad revenue.
  arXiv  Detail & Related papers  (2025-02-09T09:07:11Z)
• GraphEx: A Graph-based Extraction Method for Advertiser Keyphrase Recommendation [3.167259972777881]
  GraphEx is an innovative graph-based approach that recommends keyphrases to sellers using extraction of token permutations from item titles. It supports near real-time inferencing in resource-constrained production environments and scales effectively for billions of items.
  arXiv  Detail & Related papers  (2024-09-05T00:25:37Z)
• Query Expansion Using Contextual Clue Sampling with Language Models [69.51976926838232]
  We propose a combination of an effective filtering strategy and fusion of the retrieved documents based on the generation probability of each context. Our lexical matching based approach achieves a similar top-5/top-20 retrieval accuracy and higher top-100 accuracy compared with the well-established dense retrieval model DPR. For end-to-end QA, the reader model also benefits from our method and achieves the highest Exact-Match score against several competitive baselines.
  arXiv  Detail & Related papers  (2022-10-13T15:18:04Z)
• Hierarchical Conversational Preference Elicitation with Bandit Feedback [36.507341041113825]
  We formulate a new conversational bandit problem that allows the recommender system to choose either a key-term or an item to recommend at each round. We conduct a survey and analyze a real-world dataset to find that, unlike assumptions made in prior works, key-term rewards are mainly affected by rewards of representative items. We propose two bandit algorithms, Hier-UCB and Hier-LinUCB, that leverage this observed relationship and the hierarchical structure between key-terms and items.
  arXiv  Detail & Related papers  (2022-09-06T05:35:24Z)
• Optimal Keywords Grouping in Sponsored Search Advertising under Uncertain Environments [0.0]
  This paper proposes a programming model for keywords grouping. It takes click-through rate and conversion rate as random variables. A branch-and-bound algorithm is developed to solve our model.
  arXiv  Detail & Related papers  (2022-03-04T08:54:50Z)
• Incentives for Item Duplication under Fair Ranking Policies [69.14168955766847]
  We study the behaviour of different fair ranking policies in the presence of duplicates. We find that fairness-aware ranking policies may conflict with diversity, due to their potential to incentivize duplication more than policies solely focused on relevance.
  arXiv  Detail & Related papers  (2021-10-29T11:11:15Z)
• Compositional Attention: Disentangling Search and Retrieval [66.7108739597771]
  Multi-head, key-value attention is the backbone of the Transformer model and its variants. Standard attention heads learn a rigid mapping between search and retrieval. We propose a novel attention mechanism, called Compositional Attention, that replaces the standard head structure.
  arXiv  Detail & Related papers  (2021-10-18T15:47:38Z)
• Diversity driven Query Rewriting in Search Advertising [1.5289756643078838]
  generative retrieval models have been shown to be effective at the task of generating such query rewrites. We introduce CLOVER, a framework to generate both high-quality and diverse rewrites. We empirically show the effectiveness of our proposed approach through offline experiments on search queries across geographies spanning three major languages.
  arXiv  Detail & Related papers  (2021-06-07T17:30:45Z)
• Examining the Ordering of Rhetorical Strategies in Persuasive Requests [58.63432866432461]
  We use a Variational Autoencoder model to disentangle content and rhetorical strategies in textual requests from a large-scale loan request corpus. We find that specific (orderings of) strategies interact uniquely with a request's content to impact success rate, and thus the persuasiveness of a request.
  arXiv  Detail & Related papers  (2020-10-09T15:10:44Z)
• Learning to Infer User Hidden States for Online Sequential Advertising [52.169666997331724]
  We propose our Deep Intents Sequential Advertising (DISA) method to address these issues. The key part of interpretability is to understand a consumer's purchase intent which is, however, unobservable (called hidden states)
  arXiv  Detail & Related papers  (2020-09-03T05:12:26Z)
• Diverse, Controllable, and Keyphrase-Aware: A Corpus and Method for News Multi-Headline Generation [98.98411895250774]
  We propose generating multiple headlines with keyphrases of user interests. The proposed method achieves state-of-the-art results in terms of quality and diversity.
  arXiv  Detail & Related papers  (2020-04-08T08:30:05Z)

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.