Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

36811 · Feb 202019922001200920172026
48 results for advertiser

Study estimates long-term effects of online advertising mechanisms on user behavior and revenue.

problem Estimating long-term treatment effects in online advertising systems.
method Modeling treatment effects as a stopped random walk, using experimental design, and statistical methods.
result Confidence intervals for long-term treatment effects constructed using statistical techniques.

Study optimal bidding strategies for digital ads targeting purchases and health campaigns.

problem Optimizing advertising strategies in digital channels.
method Continuous-time models encoding user behavior and auction mechanisms, semi-explicit formulas for optimal bidding.
result Semi-explicit formulas for optimal value and bidding policy for different types of advertising.

Real-time bidding (RTB) systems, which utilize auctions to allocate user impressions to competing advertisers, continue to enjoy success in digital advertising. Assessing the effectiveness of such advertising remains a challenge in research and practice. This paper proposes a new approach to perform causal inference on…

2019-08-22abs ↗pdf ↗

Taobao, as the largest online retail platform in the world, provides billions of online display advertising impressions for millions of advertisers every day. For commercial purposes, the advertisers bid for specific spots and target crowds to compete for business traffic. The platform chooses the most suitable ads to …

2017-02-27abs ↗pdf ↗

New model uses symmetries and scaling laws to predict consumer advertising response.

problem Understanding consumer response to advertising efforts.
method Introduces a physics-based mathematical model to describe consumer response dynamics.
result The model better captures nonlinearities in advertising effects and provides new parameters for audience engagement.

This paper optimizes multi-channel sequential advertising to maximize cumulative revenue.

problem Maximizing cumulative revenue in multi-channel sequential advertising under a budget constraint.
method Formulated as a dynamic knapsack problem, proposed a bilevel optimization framework with action space reduction.
result Significantly improved cumulative revenue compared to state-of-the-art baselines.

The problem of detecting terms that can be interesting to the advertiser is considered. If a company has already bought some advertising terms which describe certain services, it is reasonable to find out the terms bought by competing companies. A part of them can be recommended as future advertising terms to the compa…

2009-06-26abs ↗pdf ↗

The traditional Sznajd model, as well as its Ochrombel simplification for opinion spreading, are applied to marketing with the help of advertising. The larger the lattice is the smaller is the amount of advertising needed to convince the whole market

2002-07-06abs ↗pdf ↗

The paper explores how to measure and optimize ad reach while maintaining user privacy.

problem Measuring ad reach while preserving user privacy in online advertising.
method Introduces kk-anonymity and probabilistic discounting for frequency capping.
result Privacy introduces a significant performance drop but with manageable costs.

Paper addresses CPA line forecasting in online advertising mid-flight.

problem Forecasting ad campaign performance mid-flight considering bidding mechanisms.
method Generates relationships between metrics and optimization signals, estimates sensitivity, and characterizes advertiser spends vs. eCPA.
result Demonstrates promising accuracy in forecasting against actual deliveries.

Online advertising in E-commerce platforms provides sellers an opportunity to achieve potential audiences with different target goals. Ad serving systems (like display and search advertising systems) that assign ads to pages should satisfy objectives such as plenty of audience for branding advertisers, clicks or conver…

2019-09-29abs ↗pdf ↗

Optimal bidding strategy for multi-platform ad auctions under budget constraints.

problem Optimizing ad placements for budget-constrained advertisers across multiple platforms.
method Developed an optimal bidding strategy for non-incentive-compatible auctions with budget constraints.
result Maximized total utility across auctions while satisfying budget constraints in expectation.

Improved conversion rate prediction in online advertising using self-supervised pre-training.

problem Data sparsity and calibration issues in predicting conversions given clicks.
method Self-supervised pre-training on all conversion events to enrich CVR prediction model without compromising calibration.
result Improvements in offline training and online A/B tests, with full deployment to Yahoo native advertising system.

New framework for online influencer selection considering cost constraints.

problem Real-world social advertising budget limitations and cost variability of influencers.
method Introduces a budgeted framework for online influence maximization using an algorithm with semi-bandit feedback.
result Improves the state of the art regret bound for cardinality constraint setting.

A new method for precise user targeting in advertising using hyperbolic manifold learning.

problem Improving user satisfaction in targeted advertising by overcoming skepticism and spam perception.
method Proposes a Multi-Manifold Learning framework to learn hierarchical user and ad representations in the hyperbolic space.
result Demonstrates improved performance in user targeting and prediction accuracy on both public datasets and a large-scale commercial system.

A simple Ising spin model which can describe the mechanism of advertising in a duopoly market is proposed. In contrast to other agent-based models, the influence does not flow inward from the surrounding neighbors to the center site, but spreads outward from the center to the neighbors. The model thus describes the spr…

2002-11-04abs ↗pdf ↗

BiCB combines traffic prediction and bidding optimization for live advertising.

problem Real-time bidding in live advertising with unknown future traffic.
method Binary Constrained Bidding (BiCB) that merges mathematical analysis and statistical traffic estimation.
result BiCB achieves good approximation to optimal bidding results with low complexity.

Some online advertising offers pay only when an ad elicits a response. Randomness and uncertainty about response rates make showing those ads a risky investment for online publishers. Like financial investors, publishers can use portfolio allocation over multiple advertising offers to pursue revenue while controlling r…

2015-06-05abs ↗pdf ↗

This paper optimizes ad bids and daily budgets for multiple campaigns in pay-per-click advertising.

problem Optimizing ad bids and daily budgets for multiple campaigns in pay-per-click advertising.
method Formulated as a combinatorial semi-bandit problem, solved using Gaussian Processes and four algorithms.
result Regret upper bounded as O(sqrt{T}), where T is the time horizon.

An average adult is exposed to hundreds of digital advertisements daily (https://www.mediadynamicsinc.com/uploads/files/PR092214-Note-only-150-Ads-2mk.pdf), making the digital advertisement industry a classic example of a big-data-driven platform. As such, the ad-tech industry relies on historical engagement logs (clic…

2020-02-07abs ↗pdf ↗

Approach to optimize bidding policies offline using reinforcement learning.

problem Optimizing spending in online advertising under budget constraints.
method Offline reinforcement learning for optimizing differentiable base policies.
result Statistically significant performance gains in production bidding environments.

A PID-based feedback-control system improves multiple KPIs in RTB display advertising.

problem Challenges in simultaneously improving multiple KPIs in RTB campaigns.
method Sequential Control using PID-based feedback and importance metrics.
result Effective in simultaneously controlling multiple KPIs in both simulations and live traffic.

Predicting the click-through rate of an advertisement is a critical component of online advertising platforms. In sponsored search, the click-through rate estimates the probability that a displayed advertisement is clicked by a user after she submits a query to the search engine. Commercial search engines typically rel…

2017-07-07abs ↗pdf ↗

The paper introduces SuccessProbaMax to optimize policy success probability in online advertising.

problem Optimizing policy success probability in online advertising systems.
method SuccessProbaMax algorithm that optimizes for the probability of success rather than expected value.
result SuccessProbaMax outperforms conventional algorithms in terms of success rate.

This paper examines and proposes several attribution modeling methods that quantify how revenue should be attributed to online advertising inputs. We adopt and further develop relative importance method, which is based on regression models that have been extensively studied and utilized to investigate the relationship …

2017-10-18abs ↗pdf ↗

Real time bidding (RTB) enables demand side platforms (bidders) to scale ad campaigns across multiple publishers affiliated to an RTB ad exchange. While driving multiple campaigns for mobile app install ads via RTB, the bidder typically has to: (i) maintain each campaign's efficiency (i.e., meet advertiser's target cos…

2018-11-11abs ↗pdf ↗

In markets for online advertising, some advertisers pay only when users respond to ads. So publishers estimate ad response rates and multiply by advertiser bids to estimate expected revenue for showing ads. Since these estimates may be inaccurate, the publisher risks not selecting the ad for each ad call that would max…

2015-06-05abs ↗pdf ↗

Paper improves privacy-preserving measurement of advertising incrementality.

problem Privacy degradation in randomized lift tests for advertising measurement.
method Formulates a robust causal decision problem under signal losses, projecting clean worlds onto incrementality.
result Sharp decision frontier shows valid certification or rejection outside the frontier.

MCNet improves uncertainty calibration in online advertising by modeling complex relations and balancing performance.

problem Lack of effective calibration for complex relations and context features in online advertising.
method Introduces MCNet with MCF, order-preserving, and field-balance regularizers.
result Superior performance in generating well-calibrated probability predictions on public and industrial datasets.

In the cost per click (CPC) pricing model, an advertiser pays an ad network only when a user clicks on an ad; in turn, the ad network gives a share of that revenue to the publisher where the ad was impressed. Still, advertisers may be unsatisfied with ad networks charging them for "valueless" clicks, or so-called accid…

2018-04-03abs ↗pdf ↗

Online audio advertising is a particular form of advertising used abundantly in online music streaming services. In these platforms, which tend to host tens of thousands of unique audio advertisements (ads), providing high quality ads ensures a better user experience and results in longer user engagement. Therefore, th…

2018-02-09abs ↗pdf ↗