Demo Data from EDBT 2026 / reviewers in the wild / expert
Hannes Karlbom
dblp:295/4800
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0006-2598-129XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 67% Information retrieval · 33% | |
| Theoretical computer science
1 paper |
Approximation and online algorithms · 67% Algorithmic game theory and mechanism design · 33% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › online advertising
ad targeting |
1.0 | 1 | 2026 | Cold-Starting Podcast Ads and Promotions with Multi-Task Learning on Spotify · WSDM 2026 |
Recommender systems
cold-start recommendation |
1.0 | 1 | 2026 | Cold-Starting Podcast Ads and Promotions with Multi-Task Learning on Spotify · WSDM 2026 |
Algorithmic game theory and mechanism design › online advertising
budget pacing |
0.9 | 1 | 2025 | Optimising Budget Management via Primal-Dual Approximation with Constrained Polynomial Weights Update · KDD (2) 2025 |
Approximation and online algorithms › online algorithms › online packing and covering
online knapsack |
0.9 | 1 | 2025 | Optimising Budget Management via Primal-Dual Approximation with Constrained Polynomial Weights Update · KDD (2) 2025 |
Approximation and online algorithms › approximation algorithms › LP-based approximation
primal-dual approximation |
0.9 | 1 | 2025 | Optimising Budget Management via Primal-Dual Approximation with Constrained Polynomial Weights Update · KDD (2) 2025 |
Methods — techniques the papers use, named apart from their topics
transfer learning · 1.0multi-task learning · 1.0primal-dual approximation · 0.9online learning · 0.9constrained polynomial weights update · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Cold-Starting Podcast Ads and Promotions with Multi-Task Learning on SpotifyabstractWe present a unified multi-objective model for targeting both advertisements and promotions within the Spotify podcast ecosystem. Our approach addresses key challenges in personalization and cold-start initialization, particularly for new advertising objectives. By leveraging transfer learning from large-scale ad and content interactions within a multi-task learning (MTL) framework, a single joint model can be fine-tuned or directly applied to new or low-data targeting tasks, including in-app promotions. This multi-objective design jointly optimizes podcast outcomes such as streams, clicks, and follows for both ads and promotions using a shared representation over user, content, context, and creative features, effectively supporting diverse business goals while improving user experience. Online A/B tests show up to a 22% reduction in effective Cost-Per-Stream (eCPS), particularly for less-streamed podcasts, and an 18-24% increase in podcast stream rates. Offline experiments and ablations highlight the contribution of ancillary objectives and feature groups to cold-start performance. Our experience shows that a unified modeling strategy improves maintainability, cold-start performance, and coverage, while breaking down historically siloed targeting pipelines. We discuss practical trade-offs of such joint models in a real-world advertising system. Shivam Verma, Hannes Karlbom, Yu Zhao 0002, Nick Topping, Vivian Chen, Kieran Stanley, Bharath Rengarajan |
WSDM | 2 |
| 2025 | Optimising Budget Management via Primal-Dual Approximation with Constrained Polynomial Weights UpdateabstractBudget management is an essential capability in many online applications, including running advertising campaigns in sponsored search and allocating promotional content in recommender systems (RS). Most existing approaches to optimising budget spendings rely on improving worst-case approximation guarantees in the respective online knapsack packing problem or leveraging online learning techniques to improve an average system performance. However, worst-case approaches often underperform in practice, as extreme scenarios are uncommon, while online learning methods may lack robustness in highly non-stationary environments. In our work, we bridge these two approaches by developing an online budget pacing algorithm that preserves worst-case guarantees while improving the average allocative efficiency of budget management systems. Dmitrii Moor, Per Berglund, Hannes Karlbom, Zhenwen Dai, Kyle Kretschman, Mounia Lalmas-Roelleke |
KDD (2) | 3 |