Demo Data from EDBT 2026 / reviewers in the wild / expert
Margherita Lazzaretto
dblp:319/0393
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0002-7524-9113ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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
1 paper |
Trustworthy machine learning · 61% Probabilistic and Bayesian machine learning · 30% Learning theory · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › density estimation
conditional density estimation |
0.9 | 1 | 2025 | Invariant Subspace Decomposition · J. Mach. Learn. Res. 2025 |
Machine learning › Trustworthy machine learning › robustness
distribution shift |
0.9 | 1 | 2025 | Invariant Subspace Decomposition · J. Mach. Learn. Res. 2025 |
Machine learning › Trustworthy machine learning › causal machine learning
invariant prediction |
0.9 | 1 | 2025 | Invariant Subspace Decomposition · J. Mach. Learn. Res. 2025 |
Machine learning › Learning theory › statistical learning theory › finite-sample analysis
finite-sample guarantees |
0.3 | 1 | 2025 | Invariant Subspace Decomposition · J. Mach. Learn. Res. 2025 |
Methods — techniques the papers use, named apart from their topics
linear conditional models · 0.9joint matrix diagonalization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Invariant Subspace DecompositionabstractWe consider the task of predicting a response $Y$ from a set of covariates $X$ in settings where the conditional distribution of $Y$ given $X$ changes over time. For this to be feasible, assumptions on how the conditional distribution changes over time are required. Existing approaches assume, for example, that changes occur smoothly over time so that short-term prediction using only the recent past becomes feasible. To additionally exploit observations further in the past, we propose a novel invariance-based framework for linear conditionals, called Invariant Subspace Decomposition (ISD), that splits the conditional distribution into a time-invariant and a residual time-dependent component. As we show, this decomposition can be employed both for zero-shot and time-adaptation prediction tasks, that is, settings where either no or a small amount of training data is available at the time points we want to predict $Y$ at, respectively. We propose a practical estimation procedure, which automatically infers the decomposition using tools from approximate joint matrix diagonalization. Furthermore, we provide finite sample guarantees for the proposed estimator and demonstrate empirically that it indeed improves on approaches that do not use the additional invariant structure. Margherita Lazzaretto, Jonas Peters, Niklas Pfister |
J. Mach. Learn. Res. | 1 |