Demo Data from VLDB 2026 / reviewers in the wild / expert
Ahmed Zaoui
dblp:268/6658
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 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
2 papers |
Learning theory · 50% Probabilistic and Bayesian machine learning · 32% Learning paradigms · 18% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 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
statistical learning theory |
1.2 | 2 | 2024 | Distributional regression: CRPS-error bounds for model fitting, model selection and convex aggregation · NeurIPS 2024 Regression with reject option and application to kNN · NeurIPS 2020 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
distribution regression |
0.8 | 1 | 2024 | Distributional regression: CRPS-error bounds for model fitting, model selection and convex aggregation · NeurIPS 2024 |
Machine learning › Learning paradigms
semi-supervised learning |
0.4 | 1 | 2020 | Regression with reject option and application to kNN · NeurIPS 2020 |
Algorithms and data structures › similarity search › nearest neighbor search
k-nearest neighbors |
0.4 | 1 | 2020 | Regression with reject option and application to kNN · NeurIPS 2020 |
Algorithms and data structures › similarity search
nearest neighbor search |
0.4 | 1 | 2020 | Regression with reject option and application to kNN · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
convergence rates · 0.9conditional variance thresholding · 0.9empirical risk minimization · 0.8concentration inequalities · 0.8CRPS · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Distributional regression: CRPS-error bounds for model fitting, model selection and convex aggregationabstractDistributional regression aims at estimating the conditional distribution of a target variable given explanatory co-variates. It is a crucial tool for forecasting when a precise uncertainty quantification is required. A popular methodology consists in fitting a parametric model via empirical risk minimization where the risk is measured by the Continuous Rank Probability Score (CRPS). For independent and identically distributed observations, we provide a concentration result for the estimation error and an upper bound for its expectation. Furthermore, we consider model selection performed by minimization of the validation error and provide a concentration bound for the regret. A similar result is proved for convex aggregation of models. Finally, we show that our results may be applied to various models such as EMOS, distributional regression networks, distributional nearest neighbours or distributional random forests and we illustrate our findings on two data sets (QSAR aquatic toxicity and Airfoil self-noise). Dombry Clement, Ahmed Zaoui |
NeurIPS | 2 |
| 2020 | Regression with reject option and application to kNNabstractWe investigate the problem of regression where one is allowed to abstain from predicting. We refer to this framework as regression with reject option as an extension of classification with reject option. In this context, we focus on the case where the rejection rate is fixed and derive the optimal rule which relies on thresholding the conditional variance function. We provide a semi-supervised estimation procedure of the optimal rule involving two datasets: a first labeled dataset is used to estimate both regression function and conditional variance function while a second unlabeled dataset is exploited to calibrate the desired rejection rate. The resulting predictor with reject option is shown to be almost as good as the optimal predictor with reject option both in terms of risk and rejection rate. We additionally apply our methodology with kNN algorithm and establish rates of convergence for the resulting kNN predictor under mild conditions. Finally, a numerical study is performed to illustrate the benefit of using the proposed procedure. Ahmed Zaoui, Christophe Denis, Mohamed Hebiri |
NeurIPS | 1 |