pith. sign in

arxiv: 2504.05308 · v1 · pith:LLSGADAJnew · submitted 2025-02-15 · 💻 cs.IR

RARe: Raising Ad Revenue Framework with Context-Aware Reranking

classification 💻 cs.IR
keywords modelclickrareframeworkmathsfrelevancerevenuesearch
0
0 comments X
read the original abstract

Modern recommender systems excel at optimizing search result relevance for e-commerce platforms. While maintaining this relevance, platforms seek opportunities to maximize revenue through search result adjustments. To address the trade-off between relevance and revenue, we propose the $\mathsf{RARe}$ ($\textbf{R}$aising $\textbf{A}$dvertisement $\textbf{Re}$venue) framework. $\mathsf{RARe}$ stacks a click model and a reranking model. We train the $\mathsf{RARe}$ framework with a loss function to find revenue and relevance trade-offs. According to our experience, the click model is crucial in the $\mathsf{RARe}$ framework. We propose and compare two different click models that take into account the context of items in a search result. The first click model is a Gradient-Boosting Decision Tree with Concatenation (GBDT-C), which includes a context in the traditional GBDT model for click prediction. The second model, SAINT-Q, adapts the Sequential Attention model to capture influences between search results. Our experiments indicate that the proposed click models outperform baselines and improve the overall quality of our framework. Experiments on the industrial dataset, which will be released publicly, show $\mathsf{RARe}$'s significant revenue improvements while preserving a high relevance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization

    cs.IR 2026-06 unverdicted novelty 4.0

    PermR approximates constrained ILP revenue maximization via neighbor swaps, reaching 63% of optimal gains within latency bounds and delivering 2% revenue lift in a 56M-query online test.