Demo Data from VLDB 2026 / reviewers in the wild / expert
Paul Egels
dblp:381/3896
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—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 |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models
bayesian deep learning |
0.9 | 1 | 2025 | Posterior and Variational Inference for Deep Neural Networks with Heavy-Tailed Weights · J. Mach. Learn. Res. 2025 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian asymptotics
posterior contraction rates |
0.3 | 1 | 2025 | Posterior and Variational Inference for Deep Neural Networks with Heavy-Tailed Weights · J. Mach. Learn. Res. 2025 |
Methods — techniques the papers use, named apart from their topics
variational inference · 0.9mean-field approximation · 0.9ReLU networks · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Posterior and Variational Inference for Deep Neural Networks with Heavy-Tailed WeightsabstractWe consider deep neural networks in a Bayesian framework with a prior distribution sampling the network weights at random. Following a recent idea of Agapiou and Castillo (2024), who show that heavy-tailed prior distributions achieve automatic adaptation to smoothness, we introduce a simple Bayesian deep learning prior based on heavy-tailed weights and ReLU activation. We show that the corresponding posterior distribution achieves near-optimal minimax contraction rates, simultaneously adaptive to both intrinsic dimension and smoothness of the underlying function, in a variety of contexts including nonparametric regression, geometric data and Besov spaces. While most works so far need a form of model selection built-in within the prior distribution, a key aspect of our approach is that it does not require to sample hyperparameters to learn the architecture of the network. We also provide variational Bayes counterparts of the results, that show that mean-field variational approximations still benefit from near-optimal theoretical support. Paul Egels, Ismaël Castillo |
J. Mach. Learn. Res. | 1 |