VLDB 2026 Research / reviewers in the wild / expert
Artjom Joosen
dblp:287/4883
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0007-6189-2515ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 2 · 2 first-author · 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.
| Artificial intelligence
2 papers |
Transfer learning and domain adaptation · 28% Time series and sequential data · 24% Learning theory · 24% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 92% Performance modeling and evaluation · 8% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Transfer learning and domain adaptation › model adaptation
online adaptation |
0.9 | 1 | 2025 | Lightweight Online Adaption for Time Series Foundation Model Forecasts · ICML 2025 |
Data mining › time series analysis
time series forecasting |
0.9 | 1 | 2025 | Lightweight Online Adaption for Time Series Foundation Model Forecasts · ICML 2025 |
Cloud and datacenter computing › serverless computing
cold start mitigation |
0.9 | 1 | 2025 | Serverless Cold Starts and Where to Find Them · EuroSys 2025 |
Cloud and datacenter computing › serverless computing
function scheduling |
0.9 | 1 | 2025 | Serverless Cold Starts and Where to Find Them · EuroSys 2025 |
Cloud and datacenter computing
serverless computing |
0.9 | 1 | 2025 | Serverless Cold Starts and Where to Find Them · EuroSys 2025 |
Machine learning › Time series and sequential data › time series analysis
time series forecasting |
0.8 | 1 | 2024 | DAM: Towards a Foundation Model for Forecasting · ICLR 2024 |
Machine learning › Deep learning architectures and training
transformer |
0.8 | 1 | 2024 | DAM: Towards a Foundation Model for Forecasting · ICLR 2024 |
Machine learning › Learning theory › online learning › sequence prediction
universal prediction |
0.8 | 1 | 2024 | DAM: Towards a Foundation Model for Forecasting · ICLR 2024 |
Cloud and datacenter computing
datacenter workloads |
0.3 | 1 | 2025 | Serverless Cold Starts and Where to Find Them · EuroSys 2025 |
Performance modeling and evaluation
workload characterization |
0.3 | 1 | 2025 | Serverless Cold Starts and Where to Find Them · EuroSys 2025 |
Methods — techniques the papers use, named apart from their topics
online feedback · 1.7forecast combination · 1.7trace analysis · 0.9transformer · 0.8basis function composition · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Serverless Cold Starts and Where to Find ThemabstractThis paper analyzes a month-long trace of 85 billion user requests and 11.9 million cold starts from Huawei's serverless cloud platform. Our analysis spans workloads from five data centers. We focus on cold starts and provide a comprehensive examination of the underlying factors influencing the number and duration of cold starts. These factors include trigger types, request synchronicity, runtime languages, and function resource allocations. We investigate components of cold starts, including pod allocation time, code and dependency deployment time, and scheduling delays, and examine their relationships with runtime languages, trigger types, and resource allocation. We introduce pod utility ratio to measure the pod's useful lifetime relative to its cold start time, giving a more complete picture of cold starts, and see that some pods with long cold start times have longer useful lifetimes. Our findings reveal the complexity and multifaceted origins of the number, duration, and characteristics of cold starts, driven by differences in trigger types, runtime languages, and function resource allocations. For example, cold starts in Region 1 take up to 7 seconds, dominated by dependency deployment time and scheduling. In Region 2, cold starts take up to 3 seconds and are dominated by pod allocation time. Based on this, we identify opportunities to reduce the number and duration of cold starts using strategies for multi-region scheduling. Finally, we suggest directions for future research to address these challenges and enhance the performance of serverless cloud platforms. Artjom Joosen, Martin Asenov, Rajkarn Singh, Luke Nicholas Darlow, Qiwen Deng, Adam Barker |
EuroSys | 1 |
| 2025 | Lightweight Online Adaption for Time Series Foundation Model ForecastsabstractFoundation models (FMs) have emerged as a promising approach for time series forecasting. While effective, FMs typically remain fixed during deployment due to the high computational costs of learning them online. Consequently, deployed FMs fail to adapt their forecasts to current data characteristics, despite the availability of online feedback from newly arriving data. This raises the question of whether FM performance can be enhanced by the efficient usage of this feedback. We propose ELF to answer this question. ELF is a lightweight mechanism for the online adaption of FM forecasts in response to online feedback. ELF consists of two parts: a) the ELF-Forecaster which is used to learn the current data distribution; and b) the ELF-Weighter which is used to combine the forecasts of the FM and the ELF-Forecaster. We evaluate the performance of ELF in conjunction with several recent FMs across a suite of standard time series datasets. In all of our experiments we find that using ELF improves performance. This work demonstrates how efficient usage of online feedback can be used to improve FM forecasts. Thomas L. Lee, William Toner, Rajkarn Singh, Artjom Joosen, Martin Asenov |
ICML | 4 |
| 2024 | DAM: Towards a Foundation Model for ForecastingabstractIt is challenging to scale time series forecasting models such that they forecast accurately for multiple distinct domains and datasets, all with potentially different underlying collection procedures (e.g., sample resolution), patterns (e.g., periodicity), and prediction requirements (e.g., reconstruction vs. forecasting). We call this general task universal forecasting. Existing methods usually assume that input data is regularly sampled, and they forecast to pre-determined horizons, resulting in failure to generalise outside of the scope of their training. We propose the DAM -- a neural model that takes randomly sampled histories and outputs an adjustable basis composition as a continuous function of time for forecasting to non-fixed horizons. It involves three key components: (1) a flexible approach for using randomly sampled histories from a long-tail distribution, that enables an efficient global perspective of the underlying temporal dynamics while retaining focus on the recent history; (2) a transformer backbone that is trained on these actively sampled histories to produce, as representational output, (3) the basis coefficients of a continuous function of time. We show that a single univariate DAM, trained on 25 time series datasets, either outperformed or closely matched existing SoTA models at multivariate long-term forecasting across 18 datasets, including 8 held-out for zero-shot transfer, even though these models were trained to specialise for each dataset-horizon combination. This single DAM excels at zero-shot transfer and very-long-term forecasting, performs well at imputation, is interpretable via basis function composition and attention, can be tuned for different inference-cost requirements, is robust to missing and irregularly sampled data by design. Luke Nicholas Darlow, Qiwen Deng, Martin Asenov, Rajkarn Singh, Artjom Joosen, Adam Barker, Amos J. Storkey |
ICLR | 6 |
| 2023 | How Does It Function?: Characterizing Long-term Trends in Production Serverless WorkloadsabstractThis paper releases and analyzes two new Huawei cloud serverless traces. The traces span a period of over 7 months with over 1.4 trillion function invocations combined. The first trace is derived from Huawei's internal workloads and contains detailed per-second statistics for 200 functions running across multiple Huawei cloud data centers. The second trace is a representative workload from Huawei's public FaaS platform. This trace contains per-minute arrival rates for over 5000 functions running in a single Huawei data center. We present the internals of a production FaaS platform by characterizing resource consumption, cold-start times, programming languages used, periodicity, per-second versus per-minute burstiness, correlations, and popularity. Our findings show that there is considerable diversity in how serverless functions behave: requests vary by up to 9 orders of magnitude across functions, with some functions executed over 1 billion times per day; scheduling time, execution time and cold-start distributions vary across 2 to 4 orders of magnitude and have very long tails; and function invocation counts demonstrate strong periodicity for many individual functions and on an aggregate level. Our analysis also highlights the need for further research in estimating resource reservations and time-series prediction to account for the huge diversity in how serverless functions behave. Artjom Joosen, Martin Asenov, Rajkarn Singh, Luke Nicholas Darlow, Adam Barker |
SoCC | 1 |