Demo Data from VLDB 2026 / reviewers in the wild / expert
Niclas Dern
dblp:351/0711
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 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
1 paper |
Learning theory · 67% Probabilistic and Bayesian machine learning · 33% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory › generalization
ensemble generalization |
0.9 | 1 | 2025 | Theoretical Limitations of Ensembles in the Age of Overparameterization · ICML 2025 |
Machine learning › Learning theory
generalization |
0.9 | 1 | 2025 | Theoretical Limitations of Ensembles in the Age of Overparameterization · ICML 2025 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
random feature regression |
0.9 | 1 | 2025 | Theoretical Limitations of Ensembles in the Age of Overparameterization · ICML 2025 |
Computational social science and digital humanities
causal inference |
0.8 | 1 | 2024 | Targeted Sequential Indirect Experiment Design · NeurIPS 2024 |
Mathematical optimization
bilevel optimization |
0.2 | 1 | 2024 | Targeted Sequential Indirect Experiment Design · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
kernel-based estimator · 1.5causal bound estimation · 1.5bilevel optimization · 0.8bi-level optimization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Theoretical Limitations of Ensembles in the Age of OverparameterizationabstractClassic ensembles generalize better than any single component model. In contrast, recent empirical studies find that modern ensembles of (overparameterized) neural networks may not provide any inherent generalization advantage over single but larger neural networks. This paper clarifies how modern overparameterized ensembles differ from their classic underparameterized counterparts, using ensembles of random feature (RF) regressors as a basis for developing theory. In contrast to the underparameterized regime, where ensembling typically induces regularization and increases generalization, we prove with minimal assumptions that infinite ensembles of overparameterized RF regressors become pointwise equivalent to (single) infinite-width RF regressors, and finite width ensembles rapidly converge to single models with the same parameter budget. These results, which are exact for ridgeless models and approximate for small ridge penalties, imply that overparameterized ensembles and single large models exhibit nearly identical generalization. We further characterize the predictive variance amongst ensemble members, demonstrating that it quantifies the expected effects of increasing capacity rather than capturing any conventional notion of uncertainty. Our results challenge common assumptions about the advantages of ensembles in overparameterized settings, prompting a reconsideration of how well intuitions from underparameterized ensembles transfer to deep ensembles and the overparameterized regime. Niclas Dern, John P. Cunningham, Geoff Pleiss |
ICML | 1 |
| 2024 | Targeted Sequential Indirect Experiment DesignabstractScientific hypotheses typically concern specific aspects of complex, imperfectly understood or entirely unknown mechanisms, such as the effect of gene expression levels on phenotypes or how microbial communities influence environmental health. Such queries are inherently causal (rather than purely associational), but in many settings, experiments can not be conducted directly on the target variables of interest, but are indirect. Therefore, they perturb the target variable, but do not remove potential confounding factors. If, additionally, the resulting experimental measurements are high-dimensional and the studied mechanisms nonlinear, the query of interest is generally not identified. We develop an adaptive strategy to design indirect experiments that optimally inform a targeted query about the ground truth mechanism in terms of sequentially narrowing the gap between an upper and lower bound on the query. While the general formulation consists of a bi-level optimization procedure, we derive an efficiently estimable analytical kernel-based estimator of the bounds for the causal effect, a query of key interest, and demonstrate the efficacy of our approach in confounded, multivariate, nonlinear synthetic settings. Elisabeth Ailer, Niclas Dern, Jason S. Hartford, Niki Kilbertus |
NeurIPS | 2 |