Demo Data from VLDB 2026 / reviewers in the wild / expert
Jeffrey Näf
dblp:241/6527
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0003-0920-1899ORCID · reported
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
2 papers |
Probabilistic and Bayesian machine learning · 43% Learning theory · 28% Kernel, tree and ensemble methods · 14% |
Topics — the 7 heaviest of 8, 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.8 | 2 | 2023 | Distributional Random Forests: Heterogeneity Adjustment and Multivariate Distributional Regression · J. Mach. Learn. Res. 2022 Confidence and Uncertainty Assessment for Distributional Random Forests · J. Mach. Learn. Res. 2023 |
Machine learning › Learning theory › statistical estimation › asymptotic estimation theory
asymptotic distribution |
0.7 | 1 | 2023 | Confidence and Uncertainty Assessment for Distributional Random Forests · J. Mach. Learn. Res. 2023 |
Natural language and speech › Information extraction and text analysis
bootstrapping |
0.7 | 1 | 2023 | Confidence and Uncertainty Assessment for Distributional Random Forests · J. Mach. Learn. Res. 2023 |
Machine learning › Learning theory › statistical estimation › confidence set construction
confidence intervals |
0.7 | 1 | 2023 | Confidence and Uncertainty Assessment for Distributional Random Forests · J. Mach. Learn. Res. 2023 |
Machine learning › Kernel, tree and ensemble methods › ensemble learning › tree ensembles
random forest |
0.7 | 1 | 2023 | Confidence and Uncertainty Assessment for Distributional Random Forests · J. Mach. Learn. Res. 2023 |
Machine learning › Probabilistic and Bayesian machine learning
statistical inference |
0.7 | 1 | 2023 | Confidence and Uncertainty Assessment for Distributional Random Forests · J. Mach. Learn. Res. 2023 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
distribution regression |
0.6 | 1 | 2022 | Distributional Random Forests: Heterogeneity Adjustment and Multivariate Distributional Regression · J. Mach. Learn. Res. 2022 |
Methods — techniques the papers use, named apart from their topics
random forest · 1.2bootstrap · 0.7maximum mean discrepancy · 0.6kernel weighting · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | MMD-based Variable Importance for Distributional Random ForestabstractDistributional Random Forest (DRF) is a flexible forest-based method to estimate the full conditional distribution of a multivariate output of interest given input variables. In this article, we introduce a variable importance algorithm for DRFs, based on the well-established drop and relearn principle and MMD distance. While traditional importance measures only detect variables with an influence on the output mean, our algorithm detects variables impacting the output distribution more generally. We show that the introduced importance measure is consistent, exhibits high empirical performance on both real and simulated data, and outperforms competitors. In particular, our algorithm is highly efficient to select variables through recursive feature elimination, and can therefore provide small sets of variables to build accurate estimates of conditional output distributions. Clément Bénard, Jeffrey Näf, Julie Josse |
AISTATS | 2 |
| 2023 | Confidence and Uncertainty Assessment for Distributional Random ForestsabstractThe Distributional Random Forest (DRF) is a recently introduced Random Forest algorithm to estimate multivariate conditional distributions. Due to its general estimation procedure, it can be employed to estimate a wide range of targets such as conditional average treatment effects, conditional quantiles, and conditional correlations. However, only results about the consistency and convergence rate of the DRF prediction are available so far. We characterize the asymptotic distribution of DRF and develop a bootstrap approximation of it. This allows us to derive inferential tools for quantifying standard errors and the construction of confidence regions that have asymptotic coverage guarantees. In simulation studies, we empirically validate the developed theory for inference of low-dimensional targets and for testing distributional differences between two populations Jeffrey Näf, Corinne Emmenegger, Peter Bühlmann, Nicolai Meinshausen |
J. Mach. Learn. Res. | 1 |
| 2022 | Distributional Random Forests: Heterogeneity Adjustment and Multivariate Distributional RegressionabstractRandom Forest is a successful and widely used regression and classification algorithm. Part of its appeal and reason for its versatility is its (implicit) construction of a kernel-type weighting function on training data, which can also be used for targets other than the original mean estimation. We propose a novel forest construction for multivariate responses based on their joint conditional distribution, independent of the estimation target and the data model. It uses a new splitting criterion based on the MMD distributional metric, which is suitable for detecting heterogeneity in multivariate distributions. The induced weights define an estimate of the full conditional distribution, which in turn can be used for arbitrary and potentially complicated targets of interest. The method is very versatile and convenient to use, as we illustrate on a wide range of examples. The code is available as Python and R packages drf. Domagoj Cevid, Loris Michel, Jeffrey Näf, Peter Bühlmann, Nicolai Meinshausen |
J. Mach. Learn. Res. | 3 |