Real-Time Optimisation for Online Learning in Auctions

10/20/2020
by   Lorenzo Croissant, et al.
0

In display advertising, a small group of sellers and bidders face each other in up to 10 12 auctions a day. In this context, revenue maximisation via monopoly price learning is a high-value problem for sellers. By nature, these auctions are online and produce a very high frequency stream of data. This results in a computational strain that requires algorithms be real-time. Unfortunately, existing methods inherited from the batch setting suffer O(√(t)) time/memory complexity at each update, prohibiting their use. In this paper, we provide the first algorithm for online learning of monopoly prices in online auctions whose update is constant in time and memory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2018

Generalized Inverse Optimization through Online Learning

Inverse optimization is a powerful paradigm for learning preferences and...
research
11/24/2020

WeiPS: a symmetric fusion model framework for large-scale online learning

The recommendation system is an important commercial application of mach...
research
09/25/2019

Optimally Compressed Nonparametric Online Learning

Batch training of machine learning models based on neural networks is no...
research
05/24/2022

Multi-Head Online Learning for Delayed Feedback Modeling

In online advertising, it is highly important to predict the probability...
research
09/12/2018

A Unified Batch Online Learning Framework for Click Prediction

We present a unified framework for Batch Online Learning (OL) for Click ...
research
02/14/2022

An Application of Online Learning to Spacecraft Memory Dump Optimization

In this paper, we present a real-world application of online learning wi...
research
10/08/2019

Research on the Concept of Liquid State Machine

Liquid State Machine (LSM) is a neural model with real time computations...

Please sign up or login with your details

Forgot password? Click here to reset