DeepAI AI Chat
Log In Sign Up

Non-linear Label Ranking for Large-scale Prediction of Long-Term User Interests

by   Nemanja Djuric, et al.
Temple University

We consider the problem of personalization of online services from the viewpoint of ad targeting, where we seek to find the best ad categories to be shown to each user, resulting in improved user experience and increased advertisers' revenue. We propose to address this problem as a task of ranking the ad categories depending on a user's preference, and introduce a novel label ranking approach capable of efficiently learning non-linear, highly accurate models in large-scale settings. Experiments on a real-world advertising data set with more than 3.2 million users show that the proposed algorithm outperforms the existing solutions in terms of both rank loss and top-K retrieval performance, strongly suggesting the benefit of using the proposed model on large-scale ranking problems.


page 1

page 2

page 3

page 4


EENMF: An End-to-End Neural Matching Framework for E-Commerce Sponsored Search

E-commerce sponsored search contributes an important part of revenue for...

Predicting Audio Advertisement Quality

Online audio advertising is a particular form of advertising used abunda...

A Large-scale Friend Suggestion Architecture

Online social as an extension of traditional life plays an important rol...

Learning Piece-wise Linear Models from Large Scale Data for Ad Click Prediction

CTR prediction in real-world business is a difficult machine learning pr...

Addressing Delayed Feedback for Continuous Training with Neural Networks in CTR prediction

One of the challenges in display advertising is that the distribution of...

Multi-Manifold Learning for Large-scale Targeted Advertising System

Messenger advertisements (ads) give direct and personal user experience ...

Large-scale Validation of Counterfactual Learning Methods: A Test-Bed

The ability to perform effective off-policy learning would revolutionize...