Demo Data from EDBT 2026 / reviewers in the wild / expert
Sebastian Pineda-Arango
dblp:271/4257 · also Sebastian Pineda Arango
· DBLP profile ↗
6ranked-venue papers
3as first author
6since 2021 · last 2025
0000-0001-9057-3408ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 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
4 papers |
Trustworthy machine learning · 25% Optimization for machine learning · 24% Transfer learning and domain adaptation · 13% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
hyperparameter optimization |
1.4 | 2 | 2024 | Quick-Tune: Quickly Learning Which Pretrained Model to Finetune and How · ICLR 2024 Deep Ranking Ensembles for Hyperparameter Optimization · ICLR 2023 |
Machine learning › Deep learning architectures and training
hypernetwork |
0.8 | 1 | 2024 | Interpretable Mesomorphic Networks for Tabular Data · NeurIPS 2024 |
Machine learning › Trustworthy machine learning
interpretability |
0.8 | 1 | 2024 | Interpretable Mesomorphic Networks for Tabular Data · NeurIPS 2024 |
Machine learning › Trustworthy machine learning › interpretability › explainable AI
interpretable neural network |
0.8 | 1 | 2024 | Interpretable Mesomorphic Networks for Tabular Data · NeurIPS 2024 |
Machine learning › Transfer learning and domain adaptation › pre-trained models
pre-trained model selection |
0.8 | 1 | 2024 | Quick-Tune: Quickly Learning Which Pretrained Model to Finetune and How · ICLR 2024 |
Machine learning › Representation and self-supervised learning
tabular data |
0.8 | 1 | 2024 | Interpretable Mesomorphic Networks for Tabular Data · NeurIPS 2024 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference |
0.6 | 1 | 2022 | Transformers Can Do Bayesian Inference · ICLR 2022 |
Machine learning › Kernel, tree and ensemble methods
ensemble learning |
0.2 | 1 | 2023 | Deep Ranking Ensembles for Hyperparameter Optimization · ICLR 2023 |
Methods — techniques the papers use, named apart from their topics
performance prediction · 0.8per-instance linear models · 0.8learning curve modeling · 0.8deep hypernetworks · 0.8ranking ensembles · 0.7deep learning · 0.7transformer · 0.6bayesian inference · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | ChronosX: Adapting Pretrained Time Series Models with Exogenous VariablesabstractCovariates provide valuable information on external factors that influence time series and are critical in many real-world time series forecasting tasks. For example, in retail, covariates may indicate promotions or peak dates such as holiday seasons that heavily influence demand forecasts. Recent advances in pretraining large language model architectures for time series forecasting have led to highly accurate forecasters. However, the majority of these models do not readily use covariates as they are often specific to a certain task or domain. This paper introduces a new method to incorporate covariates into pretrained time series forecasting models. Our proposed approach incorporates covariate information into pretrained forecasting models through modular blocks that inject past and future covariate information, without necessarily modifying the pretrained model in consideration. In order to evaluate our approach, we introduce a benchmark composed of 32 different synthetic datasets with varying dynamics to evaluate the effectivity of forecasting models with covariates. Extensive evaluations on both synthetic and real datasets show that our approach effectively incorporates covariate information into pretrained models, outperforming existing baselines. Sebastian Pineda-Arango, Shubham Kapoor, Abdul Fatir Ansari, Lorenzo Stella, Huibin Shen, Hugo Senetaire, Ali Caner Türkmen, Oleksandr Shchur, Danielle C. Maddix, Michael Bohlke-Schneider, Yuyang Wang 0001, Syama Sundar Rangapuram |
AISTATS | 1 |
| 2024 | Quick-Tune: Quickly Learning Which Pretrained Model to Finetune and HowabstractWith the ever-increasing number of pretrained models, machine learning practitioners are continuously faced with which pretrained model to use, and how to finetune it for a new dataset. In this paper, we propose a methodology that jointly searches for the optimal pretrained model and the hyperparameters for finetuning it. Our method transfers knowledge about the performance of many pretrained models with multiple hyperparameter configurations on a series of datasets. To this aim, we evaluated over 20k hyperparameter configurations for finetuning 24 pretrained image classification models on 87 datasets to generate a large-scale meta-dataset. We meta-learn a gray-box performance predictor on the learning curves of this meta-dataset and use it for fast hyperparameter optimization on new datasets. We empirically demonstrate that our resulting approach can quickly select an accurate pretrained model for a new dataset together with its optimal hyperparameters. Sebastian Pineda-Arango, Fabio Ferreira, Arlind Kadra, Frank Hutter, Josif Grabocka |
ICLR | 1 |
| 2024 | Interpretable Mesomorphic Networks for Tabular DataabstractEven though neural networks have been long deployed in applications involving tabular data, still existing neural architectures are not explainable by design. In this paper, we propose a new class of interpretable neural networks for tabular data that are both deep and linear at the same time (i.e. mesomorphic). We optimize deep hypernetworks to generate explainable linear models on a per-instance basis. As a result, our models retain the accuracy of black-box deep networks while offering free-lunch explainability for tabular data by design. Through extensive experiments, we demonstrate that our explainable deep networks have comparable performance to state-of-the-art classifiers on tabular data and outperform current existing methods that are explainable by design. Arlind Kadra, Sebastian Pineda-Arango, Josif Grabocka |
NeurIPS | 2 |
| 2023 | Deep Ranking Ensembles for Hyperparameter Optimization
Abdus Salam Khazi, Sebastian Pineda-Arango, Josif Grabocka |
ICLR | 2 |
| 2023 | Deep Pipeline Embeddings for AutoMLabstractAutomated Machine Learning (AutoML) is a promising direction for democratizing AI by automatically deploying Machine Learning systems with minimal human expertise. The core technical challenge behind AutoML is optimizing the pipelines of Machine Learning systems (e.g. the choice of preprocessing, augmentations, models, optimizers, etc.). Existing Pipeline Optimization techniques fail to explore deep interactions between pipeline stages/components. As a remedy, this paper proposes a novel neural architecture that captures the deep interaction between the components of a Machine Learning pipeline. We propose embedding pipelines into a latent representation through a novel per-component encoder mechanism. To search for optimal pipelines, such pipeline embeddings are used within deep-kernel Gaussian Process surrogates inside a Bayesian Optimization setup. Furthermore, we meta-learn the parameters of the pipeline embedding network using existing evaluations of pipelines on diverse collections of related datasets (a.k.a. meta-datasets). Through extensive experiments on three large-scale meta-datasets, we demonstrate that pipeline embeddings yield state-of-the-art results in Pipeline Optimization. Sebastian Pineda-Arango, Josif Grabocka |
KDD | 1 |
| 2022 | Transformers Can Do Bayesian Inference
Samuel Müller 0005, Noah Hollmann, Sebastian Pineda-Arango, Josif Grabocka, Frank Hutter |
ICLR | 3 |