<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Multi-task learning in programmatic advertising</dc:title><dc:creator>Vreš,	Domen	(Avtor)
	</dc:creator><dc:creator>Robnik Šikonja,	Marko	(Mentor)
	</dc:creator><dc:creator>Jakomin,	Martin	(Komentor)
	</dc:creator><dc:subject>artificial intelligence</dc:subject><dc:subject>machine learning</dc:subject><dc:subject>multi-task learning</dc:subject><dc:subject>real-time bidding</dc:subject><dc:subject>viewability prediction</dc:subject><dc:subject>click-through rate prediction</dc:subject><dc:subject>conversion rate prediction</dc:subject><dc:subject>deep &amp; cross network</dc:subject><dc:subject>cross-stitch layer</dc:subject><dc:subject>soft attention</dc:subject><dc:subject>uncertainty based loss weighing</dc:subject><dc:description>With the popularity of the world wide web, online advertising became crucial for the advertising industry. A large part of online advertising is based on real-time bidding, where automated software is used to buy and sell ad space. In this ecosystem, demand-side platforms (DSP) work with advertisers to display their ads on websites by bidding for ad space. Three crucial problems for DSP companies are viewability prediction, click-through rate (CTR) prediction, and conversion rate (CVR) prediction. In this work, we model these three problems using multi-task learning, which was not done before. We take the deep &amp; cross network architecture, a state-of-the-art for CTR and CVR prediction, and expand it into a multi-task model. Additionally, we expand the multi-task model with recent techniques of cross-stitch layer, soft attention mask, uncertainty-based loss weighing, and relationship layer. We compare the multi-task model with single-task baselines on a large proprietary real-world data set. We show that the multi-task models significantly outperform the CVR baseline, which is our main goal, as CVR prediction is the most difficult task to model.</dc:description><dc:date>2023</dc:date><dc:date>2023-09-28 11:25:00</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>151061</dc:identifier><dc:identifier>VisID: 35431</dc:identifier><dc:identifier>COBISS_ID: 170173187</dc:identifier><dc:language>sl</dc:language></metadata>
