Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models

• URL: http://arxiv.org/abs/2509.20304v1
• Date: Wed, 24 Sep 2025 16:35:18 GMT
• Title: Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models
• Authors: Kailash Gopal Darmasubramanian, Akash Pareek, Arindam Khan, Arpit Agarwal,
• Abstract summary: Existing scheduling policies rely on simples, such as uniform spacing and frequency caps, that overlook long-term user interest.<n>We model change in user interest upon showing ads based on mere exposure, hedonic adaptation, and operant conditioning.<n>We show that, if the number of displayed ads is fixed, then the optimal ad-schedule only depends on the operant conditioning function.
• Score: 11.13292106104811
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Optimizing the timing and frequency of ads is a central problem in digital advertising, with significant economic consequences. Existing scheduling policies rely on simple heuristics, such as uniform spacing and frequency caps, that overlook long-term user interest. However, it is well-known that users' long-term interest and engagement result from the interplay of several psychological effects (Curmei, Haupt, Recht, Hadfield-Menell, ACM CRS, 2022). In this work, we model change in user interest upon showing ads based on three key psychological principles: mere exposure, hedonic adaptation, and operant conditioning. The first two effects are modeled using a concave function of user interest with repeated exposure, while the third effect is modeled using a temporal decay function, which explains the decline in user interest due to overexposure. Under our psychological behavior model, we ask the following question: Given a continuous time interval $T$, how many ads should be shown, and at what times, to maximize the user interest towards the ads? Towards answering this question, we first show that, if the number of displayed ads is fixed, then the optimal ad-schedule only depends on the operant conditioning function. Our main result is a quasi-linear time algorithm that outputs a near-optimal ad-schedule, i.e., the difference in the performance of our schedule and the optimal schedule is exponentially small. Our algorithm leads to significant insights about optimal ad placement and shows that simple heuristics such as uniform spacing are sub-optimal under many natural settings. The optimal number of ads to display, which also depends on the mere exposure and hedonistic adaptation functions, can be found through a simple linear search given the above algorithm. We further support our findings with experimental results, demonstrating that our strategy outperforms various baselines.

Related papers

• Causal Inference on Stopped Random Walks in Online Advertising [2.758187691493102]
  We consider a causal inference problem in online advertising systems.<n>Each treatment corresponds to a parameter value of the advertising mechanism.<n>We estimate through experiments the corresponding long-term treatment effect.
  arXiv  Detail & Related papers  (2026-02-05T18:43:29Z)
• Quantifying the Potential to Escape Filter Bubbles: A Behavior-Aware Measure via Contrastive Simulation [82.74100448579857]
  We introduce Bubble Escape Potential (BEP), a behavior-aware measure that quantifies how easily users can escape from filter bubbles.<n>We conduct extensive experiments across multiple recommendation models to examine the relationship between predictive accuracy and bubble escape potential across different groups.
  arXiv  Detail & Related papers  (2025-11-27T07:21:04Z)
• Chirality in Action: Time-Aware Video Representation Learning by Latent Straightening [54.66784646111214]
  We introduce a new task: chiral action recognition, where one needs to distinguish between a pair of temporally opposite actions.<n>Our goal is to build time aware video representations which offer linear separability between these chiral pairs.<n>We show that this results in a compact but time-sensitive video representation for the proposed task across three datasets.
  arXiv  Detail & Related papers  (2025-09-10T11:23:10Z)
• Practice on Long Behavior Sequence Modeling in Tencent Advertising [75.65309022911994]
  Long-sequence modeling has become an indispensable frontier in recommendation systems for capturing users' long-term preferences.<n>We propose several practical approaches within the two-stage framework for long-sequence modeling.<n> Deployed in production on Tencent's large-scale advertising platforms, our innovations delivered significant performance gains.
  arXiv  Detail & Related papers  (2025-09-10T06:55:57Z)
• 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.<n>It utilizes a simple yet effective method to enhance the consistency between pre-training and relevance tasks.<n>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)
• DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction [53.76601630407521]
  We propose a hypergraph network model called DisenHCN to bridge the gaps in existing solutions. In particular, we first unify fine-grained user similarity and the complex matching between user preferences andtemporal activity into a heterogeneous hypergraph. We then disentangle the user representations into different aspects (location-aware, time-aware, and activity-aware) and aggregate corresponding aspect's features on the constructed hypergraph.
  arXiv  Detail & Related papers  (2022-08-14T06:51:54Z)
• Hierarchically Constrained Adaptive Ad Exposure in Feeds [20.496491882160107]
  We focus on long-term performance optimization under hierarchical constraints in feeds. We propose an effective approach: Hierarchically Constrained Adaptive Ad Exposure(HCA2E)
  arXiv  Detail & Related papers  (2022-05-31T12:56:49Z)
• Ad Creative Discontinuation Prediction with Multi-Modal Multi-Task Neural Survival Networks [7.94957965474334]
  Discontinuing ad creatives at an appropriate time is one of the most important ad operations that can have a significant impact on sales. We propose a practical prediction framework for the discontinuation of ad creatives with a hazard function-based loss function. We evaluate our framework using the large-scale ad creative dataset, including 10 billion scale impressions.
  arXiv  Detail & Related papers  (2022-04-02T04:57:23Z)
• Contextual Bandits for Advertising Campaigns: A Diffusion-Model Independent Approach (Extended Version) [73.59962178534361]
  We study an influence problem in which little is assumed to be known about the diffusion network or about the model that determines how information may propagate. In this setting, an explore-exploit approach could be used to learn the key underlying diffusion parameters, while running the campaign. We describe and compare two methods of contextual multi-armed bandits, with upper-confidence bounds on the remaining potential of influencers.
  arXiv  Detail & Related papers  (2022-01-13T22:06:10Z)
• Mitigating Divergence of Latent Factors via Dual Ascent for Low Latency Event Prediction Models [0.739706777911384]
  Real-world content recommendation marketplaces exhibit certain behaviors and are imposed by constraints that are not always apparent in common static offline data sets. We present a systematic method to prevent model parameters from diverging by imposing a carefully chosen set of constraints on the model's latent vectors. We conduct an online experiment which shows a substantial reduction in the number of diverging instances, and a significant improvement to both user experience and revenue.
  arXiv  Detail & Related papers  (2021-11-15T16:09:48Z)
• Predicting Online Video Advertising Effects with Multimodal Deep Learning [33.20913249848369]
  We propose a method for predicting the click through rate (CTR) of video advertisements and analyzing the factors that determine the CTR. In this paper, we demonstrate an optimized framework for accurately predicting the effects by taking advantage of the multimodal nature of online video advertisements.
  arXiv  Detail & Related papers  (2020-12-22T06:24:01Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)
• Geometry-Inspired Top-k Adversarial Perturbations [68.32598950136504]
  Top-k adversarial examples as a simple multi-objective optimization. Top-k Universal Adversarial Perturbations, image-agnostic tiny perturbations that cause the true class to be absent among the Top-k prediction for the majority of natural images.
  arXiv  Detail & Related papers  (2020-06-28T18:05:57Z)

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.