VLDB 2026 Research / reviewers in the wild / expert
Shahine Bouabid
dblp:260/0855
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 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
3 papers |
Trustworthy machine learning · 28% Learning theory · 26% Kernel, tree and ensemble methods · 19% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 50% Information theory · 50% |
Topics — the 9 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
domain generalization |
0.8 | 1 | 2024 | Domain Generalisation via Imprecise Learning · ICML 2024 |
Machine learning › Trustworthy machine learning
out-of-distribution generalization |
0.8 | 1 | 2024 | Domain Generalisation via Imprecise Learning · ICML 2024 |
Machine learning › Trustworthy machine learning
robustness |
0.8 | 1 | 2024 | Domain Generalisation via Imprecise Learning · ICML 2024 |
Machine learning › Probabilistic and Bayesian machine learning
causal inference |
0.7 | 1 | 2023 | Returning The Favour: When Regression Benefits From Probabilistic Causal Knowledge · ICML 2023 |
Machine learning › Learning theory
inductive bias |
0.7 | 1 | 2023 | Returning The Favour: When Regression Benefits From Probabilistic Causal Knowledge · ICML 2023 |
Machine learning › Kernel, tree and ensemble methods › kernel embedding
conditional mean embedding |
0.5 | 1 | 2021 | Deconditional Downscaling with Gaussian Processes · NeurIPS 2021 |
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel mean embedding |
0.5 | 1 | 2021 | Deconditional Downscaling with Gaussian Processes · NeurIPS 2021 |
Information theory › probability theory › stochastic processes
gaussian processes |
0.5 | 1 | 2021 | Deconditional Downscaling with Gaussian Processes · NeurIPS 2021 |
Algorithms and data structures
kernel methods |
0.5 | 1 | 2021 | Deconditional Downscaling with Gaussian Processes · NeurIPS 2021 |
Methods — techniques the papers use, named apart from their topics
kernel ridge regression · 1.0gaussian process · 1.0conditional mean embedding · 1.0minimax optimisation · 0.8imprecise probability · 0.8reproducing kernel hilbert space · 0.7empirical risk minimization · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Domain Generalisation via Imprecise LearningabstractOut-of-distribution (OOD) generalisation is challenging because it involves not only learning from empirical data, but also deciding among various notions of generalisation, e.g. optimise based on the average-case risk, worst-case risk, or interpolations thereof. While this decision should in principle be decided by the model operator like medical doctors in practice, this information might not always be available at training time. This situation leads to arbitrary commitments to specific generalisation strategies by machine learners due to these deployment uncertainties. We introduce the Imprecise Domain Generalisation framework to mitigate this, featuring an imprecise risk optimisation that allows learners to stay imprecise by optimising against a continuous spectrum of generalisation strategies during training, and a model framework that allows operators to specify their generalisation preference at deployment. Our work, supported by theoretical and empirical evidence, showcases the benefits of integrating imprecision into domain generalisation. Anurag Singh 0006, Siu Lun Chau, Shahine Bouabid, Krikamol Muandet |
ICML | 3 |
| 2023 | Returning The Favour: When Regression Benefits From Probabilistic Causal KnowledgeabstractA directed acyclic graph (DAG) provides valuable prior knowledge that is often discarded in regression tasks in machine learning. We show that the independences arising from the presence of collider structures in DAGs provide meaningful inductive biases, which constrain the regression hypothesis space and improve predictive performance. We introduce collider regression, a framework to incorporate probabilistic causal knowledge from a collider in a regression problem. When the hypothesis space is a reproducing kernel Hilbert space, we prove a strictly positive generalisation benefit under mild assumptions and provide closed-form estimators of the empirical risk minimiser. Experiments on synthetic and climate model data demonstrate performance gains of the proposed methodology. Shahine Bouabid, Jake Fawkes, Dino Sejdinovic |
ICML | 1 |
| 2021 | Deconditional Downscaling with Gaussian ProcessesabstractRefining low-resolution (LR) spatial fields with high-resolution (HR) information, often known as statistical downscaling, is challenging as the diversity of spatial datasets often prevents direct matching of observations. Yet, when LR samples are modeled as aggregate conditional means of HR samples with respect to a mediating variable that is globally observed, the recovery of the underlying fine-grained field can be framed as taking an "inverse" of the conditional expectation, namely a deconditioning problem. In this work, we propose a Bayesian formulation of deconditioning which naturally recovers the initial reproducing kernel Hilbert space formulation from Hsu and Ramos (2019). We extend deconditioning to a downscaling setup and devise efficient conditional mean embedding estimator for multiresolution data. By treating conditional expectations as inter-domain features of the underlying field, a posterior for the latent field can be established as a solution to the deconditioning problem. Furthermore, we show that this solution can be viewed as a two-staged vector-valued kernel ridge regressor and show that it has a minimax optimal convergence rate under mild assumptions. Lastly, we demonstrate its proficiency in a synthetic and a real-world atmospheric field downscaling problem, showing substantial improvements over existing methods. Siu Lun Chau, Shahine Bouabid, Dino Sejdinovic |
NeurIPS | 2 |