Scalable Bid Landscape Forecasting in Real-time Bidding
- URL: http://arxiv.org/abs/2001.06587v1
- Date: Sat, 18 Jan 2020 03:20:05 GMT
- Title: Scalable Bid Landscape Forecasting in Real-time Bidding
- Authors: Aritra Ghosh, Saayan Mitra, Somdeb Sarkhel, Jason Xie, Gang Wu,
Viswanathan Swaminathan
- Abstract summary: In programmatic advertising, ad slots are usually sold using second-price (SP) auctions in real-time.
In SP, for a single item, the dominant strategy of each bidder is to bid the true value from the bidder's perspective.
We propose a heteroscedastic fully parametric censored regression approach, as well as a mixture density censored network.
- Score: 12.692521867728091
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In programmatic advertising, ad slots are usually sold using second-price
(SP) auctions in real-time. The highest bidding advertiser wins but pays only
the second-highest bid (known as the winning price). In SP, for a single item,
the dominant strategy of each bidder is to bid the true value from the bidder's
perspective. However, in a practical setting, with budget constraints, bidding
the true value is a sub-optimal strategy. Hence, to devise an optimal bidding
strategy, it is of utmost importance to learn the winning price distribution
accurately. Moreover, a demand-side platform (DSP), which bids on behalf of
advertisers, observes the winning price if it wins the auction. For losing
auctions, DSPs can only treat its bidding price as the lower bound for the
unknown winning price. In literature, typically censored regression is used to
model such partially observed data. A common assumption in censored regression
is that the winning price is drawn from a fixed variance (homoscedastic)
uni-modal distribution (most often Gaussian). However, in reality, these
assumptions are often violated. We relax these assumptions and propose a
heteroscedastic fully parametric censored regression approach, as well as a
mixture density censored network. Our approach not only generalizes censored
regression but also provides flexibility to model arbitrarily distributed
real-world data. Experimental evaluation on the publicly available dataset for
winning price estimation demonstrates the effectiveness of our method.
Furthermore, we evaluate our algorithm on one of the largest demand-side
platforms and significant improvement has been achieved in comparison with the
baseline solutions.
Related papers
- Cost-Control in Display Advertising: Theory vs Practice [0.2574913881702984]
In display advertising, advertisers want to achieve a marketing objective with constraints on budget and cost-per-outcome.
This is usually formulated as an optimization problem that maximizes the total utility under constraints.
The optimization is carried out in an online fashion in the dual space - for an incoming Ad auction, a bid is placed using an optimal bidding formula. based on the outcome of the previous auctions, the dual variables are updated in an online fashion.
While this approach is theoretically sound, in practice, the dual variables are not optimal from the beginning, but rather converge over time.
arXiv Detail & Related papers (2024-09-05T19:22:33Z) - Rejection via Learning Density Ratios [50.91522897152437]
Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions.
We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance.
Our framework is tested empirically over clean and noisy datasets.
arXiv Detail & Related papers (2024-05-29T01:32:17Z) - Advancing Ad Auction Realism: Practical Insights & Modeling Implications [2.8413290300628313]
This paper shows that one can still gain useful insight into modern ad auctions by modeling advertisers as agents governed by an adversarial bandit algorithm.
We find that soft floors yield lower revenues than suitably chosen reserve prices, even restricting attention to a single query.
arXiv Detail & Related papers (2023-07-21T17:45:28Z) - Adaptive Risk-Aware Bidding with Budget Constraint in Display
Advertising [47.14651340748015]
We propose a novel adaptive risk-aware bidding algorithm with budget constraint via reinforcement learning.
We theoretically unveil the intrinsic relation between the uncertainty and the risk tendency based on value at risk (VaR)
arXiv Detail & Related papers (2022-12-06T18:50:09Z) - Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions [42.002983450368134]
We study the question of how to bid in first-price auctions.
Unlike in second-price auctions, bidding one's private value truthfully is no longer optimal.
We consider two types of hints: one where a single point-prediction is available, and the other where a hint interval is available.
arXiv Detail & Related papers (2022-11-05T19:20:53Z) - A Reinforcement Learning Approach in Multi-Phase Second-Price Auction
Design [158.0041488194202]
We study reserve price optimization in multi-phase second price auctions.
From the seller's perspective, we need to efficiently explore the environment in the presence of potentially nontruthful bidders.
Third, the seller's per-step revenue is unknown, nonlinear, and cannot even be directly observed from the environment.
arXiv Detail & Related papers (2022-10-19T03:49:05Z) - Fast Rate Learning in Stochastic First Price Bidding [0.0]
First-price auctions have largely replaced traditional bidding approaches based on Vickrey auctions in programmatic advertising.
We show how to achieve significantly lower regret when the opponents' maximal bid distribution is known.
Our algorithms converge much faster than alternatives proposed in the literature for various bid distributions.
arXiv Detail & Related papers (2021-07-05T07:48:52Z) - Almost Tight L0-norm Certified Robustness of Top-k Predictions against
Adversarial Perturbations [78.23408201652984]
Top-k predictions are used in many real-world applications such as machine learning as a service, recommender systems, and web searches.
Our work is based on randomized smoothing, which builds a provably robust classifier via randomizing an input.
For instance, our method can build a classifier that achieves a certified top-3 accuracy of 69.2% on ImageNet when an attacker can arbitrarily perturb 5 pixels of a testing image.
arXiv Detail & Related papers (2020-11-15T21:34:44Z) - A novel auction system for selecting advertisements in Real-Time bidding [68.8204255655161]
Real-Time Bidding is a new Internet advertising system that has become very popular in recent years.
We propose an alternative betting system with a new approach that not only considers the economic aspect but also other relevant factors for the functioning of the advertising system.
arXiv Detail & Related papers (2020-10-22T18:36:41Z) - Sharp Statistical Guarantees for Adversarially Robust Gaussian
Classification [54.22421582955454]
We provide the first result of the optimal minimax guarantees for the excess risk for adversarially robust classification.
Results are stated in terms of the Adversarial Signal-to-Noise Ratio (AdvSNR), which generalizes a similar notion for standard linear classification to the adversarial setting.
arXiv Detail & Related papers (2020-06-29T21:06:52Z) - Optimal Bidding Strategy without Exploration in Real-time Bidding [14.035270361462576]
maximizing utility with a budget constraint is the primary goal for advertisers in real-time bidding (RTB) systems.
Previous works ignore the losing auctions to alleviate the difficulty with censored states.
We propose a novel practical framework using the maximum entropy principle to imitate the behavior of the true distribution observed in real-time traffic.
arXiv Detail & Related papers (2020-03-31T20:43:28Z)
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.