Demo Data from EDBT 2026 / reviewers in the wild / expert
Eduard Oravkin
dblp:304/8553
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none
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 |
Learning theory · 60% Probabilistic and Bayesian machine learning · 40% |
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 › over-parameterization
interpolation |
0.5 | 1 | 2021 | On Optimal Interpolation in Linear Regression · NeurIPS 2021 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
linear regression |
0.5 | 1 | 2021 | On Optimal Interpolation in Linear Regression · NeurIPS 2021 |
Machine learning › Learning theory › over-parameterization › interpolation
minimum-norm interpolation |
0.5 | 1 | 2021 | On Optimal Interpolation in Linear Regression · NeurIPS 2021 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
regression |
0.5 | 1 | 2021 | On Optimal Interpolation in Linear Regression · NeurIPS 2021 |
Machine learning › Learning theory
statistical learning theory |
0.5 | 1 | 2021 | On Optimal Interpolation in Linear Regression · NeurIPS 2021 |
Methods — techniques the papers use, named apart from their topics
random features · 0.5preconditioned gradient descent · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | On Optimal Interpolation in Linear RegressionabstractUnderstanding when and why interpolating methods generalize well has recently been a topic of interest in statistical learning theory. However, systematically connecting interpolating methods to achievable notions of optimality has only received partial attention. In this paper, we ask the question of what is the optimal way to interpolate in linear regression using functions that are linear in the response variable (as the case for the Bayes optimal estimator in ridge regression) and depend on the data, the population covariance of the data, the signal-to-noise ratio and the covariance of the prior for the signal, but do not depend on the value of the signal itself nor the noise vector in the training data. We provide a closed-form expression for the interpolator that achieves this notion of optimality and show that it can be derived as the limit of preconditioned gradient descent with a specific initialization. We identify a regime where the minimum-norm interpolator provably generalizes arbitrarily worse than the optimal response-linear achievable interpolator that we introduce, and validate with numerical experiments that the notion of optimality we consider can be achieved by interpolating methods that only use the training data as input in the case of an isotropic prior. Finally, we extend the notion of optimal response-linear interpolation to random features regression under a linear data-generating model. Eduard Oravkin, Patrick Rebeschini |
NeurIPS | 1 |