mlsanityData to 7 Oct 2026

Arbitrary Distribution Modeling with Censorship in Real-Time Bidding Advertising

arXiv 2110.13587 ↗First posted 26 Oct 2021cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

The purpose of Inventory Pricing is to bid the right prices to online ad opportunities, which is crucial for a Demand-Side Platform (DSP) to win advertising auctions in Real-Time Bidding (RTB). In the planning stage, advertisers need the forecast of probabilistic models to make bidding decisions. However, most of the previous works made strong assumptions on the distribution form of the winning price, which reduced their accuracy and weakened their ability to make generalizations. Though some works recently tried to fit the distribution directly, their complex structure lacked efficiency on online inference. In this paper, we devise a novel loss function, Neighborhood Likelihood Loss (NLL), collaborating with a proposed framework, Arbitrary Distribution Modeling (ADM), to predict the winning price distribution under censorship with no pre-assumption required. We conducted experiments on two real-world experimental datasets and one large-scale, non-simulated production dataset in our system. Experiments showed that ADM outperformed the baselines both on algorithm and business metrics. By replaying historical data of the production environment, this method was shown to lead to good yield in our system. Without any pre-assumed specific distribution form, ADM showed significant advantages in effectiveness and efficiency, demonstrating its great capability in modeling sophisticated price landscapes.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 20 of its 35 references that are in the map. First posted on arXiv 26 Oct 2021.

Builds on

20 of 35 references.

References · 20

  1. 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,441
  2. 2017Neural Collaborative Filteringcited by 1,108
  3. 2021Pay Attention to MLPscited by 367
  4. 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
  5. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
  6. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
  7. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  8. 2016Product-based Neural Networks for User Response Predictioncited by 145
  9. 2017Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networkscited by 126
  10. 2021Do You Even Need Attention? A Stack of Feed-Forward Layers Does Surprisingly Well on ImageNetcited by 61
  11. 2016Display Advertising with Real-Time Bidding (RTB) and Behavioural Targetingcited by 42
  12. 2021RepMLP: Re-parameterizing Convolutions into Fully-connected Layers for Image Recognitioncited by 40
8 more
  1. 2021Modeling the Sequential Dependence among Audience Multi-step Conversions with Multi-task Learning in Targeted Display Advertisingcited by 39
  2. 2013Real-time Bidding for Online Advertising: Measurement and Analysiscited by 32
  3. 2021Neural Auction: End-to-End Learning of Auction Mechanisms for E-Commerce Advertisingcited by 31
  4. 2018Bidding Machine: Learning to Bid for Directly Optimizing Profits in Display Advertisingcited by 21
  5. 2014Real-Time Bidding Benchmarking with iPinYou Datasetcited by 19
  6. 2021An Efficient Deep Distribution Network for Bid Shading in First-Price Auctionscited by 14
  7. 2019Deep Landscape Forecasting for Real-time Bidding Advertisingcited by 12
  8. 2020A Deep Recurrent Survival Model for Unbiased Rankingcited by 7

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.