• Corpus ID: 231951417

Truncation-Free Matching System for Display Advertising at Alibaba

  title={Truncation-Free Matching System for Display Advertising at Alibaba},
  author={Jin Li and Jie Liu and Shangzhou Li and Yao Xu and Ran Cao and Qi Li and Biye Jiang and Guan Wang and Han Zhu and Kun Gai and Xiaoqiang Zhu},
Matching module plays a critical role in display advertising systems. Different from sponsored search where user intentions can be captured naturally through query, display advertising has no explicit information about user intentions. Thus, it is challenging for display advertising systems to match user traffic and ads suitably w.r.t. both user experience and advertising performance. From the advertiser’s view, system packs up a group of users with common properties, such as the same gender or… 

Figures and Tables from this paper

A Unified Framework for Campaign Performance Forecasting in Online Display Advertising

A novel Campaign Performance Forecasting framework is proposed, which firstly reproduces campaign performance on historical logs under various bidding types with a unified replay algorithm, and introduces a multi-task learning method to calibrate the deviation of estimation brought by hard-to-reproduce bidding strategies in replay.



Optimized Cost per Click in Taobao Display Advertising

A bid optimizing strategy called optimized cost per click (OCPC) is proposed which automatically adjusts the bid to achieve finer matching of bid and traffic quality of page view (PV) request granularity and yields substantially better results than previous fixed bid manner.

The Online Advertising Industry: Economics, Evolution, and Privacy

Online advertising accounts for almost 9 percent of all advertising in the United States. This share is expected to increase as more media is consumed over the Internet and as more advertisers shift

Online Display Advertising: Targeting and Obtrusiveness

It is found that matching an ad to website content and increasing an ad's obtrusiveness independently increase purchase intent, however, in combination, these two strategies are ineffective.

Real-Time Bidding with Multi-Agent Reinforcement Learning in Display Advertising

The results show cluster-based bidding would largely outperform single-agent and bandit approaches, and the coordinated bidding achieves better overall objectives than purely self-interested bidding agents.

COLD: Towards the Next Generation of Pre-Ranking System

This paper designs a new pre- ranking system by joint optimization of both the pre-ranking model and the computing power it costs, and names it COLD (Computing power cost-aware Online and Lightweight Deep Pre-ranking system).

Joint Optimization of Tree-based Index and Deep Model for Recommender Systems

Experimental evaluations with two large-scale real-world datasets show that the proposed method improves recommendation accuracy significantly and a novel hierarchical user preference representation utilizing the tree index hierarchy is come up.

Learning Tree-based Deep Model for Recommender Systems

A novel tree-based method which can provide logarithmic complexity w.r.t. corpus size even with more expressive models such as deep neural networks is proposed and can be jointly learnt towards better compatibility with users' interest distribution and hence facilitate both training and prediction.

Deep Interest Network for Click-Through Rate Prediction

A novel model: Deep Interest Network (DIN) is proposed which tackles this challenge by designing a local activation unit to adaptively learn the representation of user interests from historical behaviors with respect to a certain ad.

Deep Interest Evolution Network for Click-Through Rate Prediction

This paper proposes a novel model, named Deep Interest Evolution Network~(DIEN), for CTR prediction, which significantly outperforms the state-of-the-art solutions and design interest extractor layer to capture temporal interests from history behavior sequence.

Auction Theory