Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1102.2551

Yield Optimization of Display Advertising with Ad Exchange

Santiago Balseiro·Jon Feldman·Vahab Mirrokni·S. Muthukrishnan
View original source ↗Read source document ↗Export metadata ↓

Abstract

In light of the growing market of Ad Exchanges for the real-time sale of advertising slots, publishers face new challenges in choosing between the allocation of contract-based reservation ads and spot market ads. In this setting, the publisher should take into account the tradeoff between short-term revenue from an Ad Exchange and quality of allocating reservation ads. In this paper, we formalize this combined optimization problem as a stochastic control problem and derive an efficient policy for online ad allocation in settings with general joint distribution over placement quality and exchange bids. We prove asymptotic optimality of this policy in terms of any trade-off between quality of delivered reservation ads and revenue from the exchange, and provide a rigorous bound for its convergence rate to the optimal policy. We also give experimental results on data derived from real publisher inventory, showing that our policy can achieve any pareto-optimal point on the quality vs. revenue curve. Finally, we study a parametric training-based algorithm in which instead of learning the dual variables from a sample data (as is done in non-parametric training-based algorithms), we learn the parameters of the distribution and construct those dual variables from the learned parameter values. We compare parametric and non-parametric ways to estimate from data both analytically and experimentally in the special case without the ad exchange, and show that though both methods converge to the optimal policy as the sample size grows, our parametric method converges faster, and thus performs better on smaller samples.

Explore related subjects

math.OCcs.DScs.SYeess.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Santiago Balseiro, Jon Feldman, Vahab Mirrokni, S. Muthukrishnan. 2012-09-21. Yield Optimization of Display Advertising with Ad Exchange. https://arxiv.org/abs/1102.2551

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC↗
arXiv2026

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC↗
arXiv2026

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC↗