Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lukas Tatzel

dblp:294/5415 · DBLP profile ↗
← Back
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
2 papers
Probabilistic and Bayesian machine learning · 61% Optimization for machine learning · 14% Trustworthy machine learning · 14%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › approximate bayesian inference
laplace approximation
1.622025
Debiasing Mini-Batch Quadratics for Applications in Deep Learning · ICLR 2025
Reparameterization invariance in approximate Bayesian inference · NeurIPS 2024
Machine learning › Optimization for machine learning
second-order optimization
0.912025
Debiasing Mini-Batch Quadratics for Applications in Deep Learning · ICLR 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Debiasing Mini-Batch Quadratics for Applications in Deep Learning · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
approximate bayesian inference
0.812024
Reparameterization invariance in approximate Bayesian inference · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models › bayesian deep learning
bayesian neural networks
0.812024
Reparameterization invariance in approximate Bayesian inference · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › sampling
posterior sampling
0.812024
Reparameterization invariance in approximate Bayesian inference · NeurIPS 2024
Machine learning › Generative modeling › diffusion model › geometric diffusion model
riemannian diffusion model
0.812024
Reparameterization invariance in approximate Bayesian inference · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

mini-batch estimation · 0.9debiasing · 0.9riemannian diffusion process · 0.8linearized laplace approximation · 0.8
YearPublicationVenuePosition
2025 Debiasing Mini-Batch Quadratics for Applications in Deep Learning
abstract
Quadratic approximations form a fundamental building block of machine learning methods. E.g., second-order optimizers try to find the Newton step into the minimum of a local quadratic proxy to the objective function; and the second-order approximation of a network's loss function can be used to quantify the uncertainty of its outputs via the Laplace approximation. When computations on the entire training set are intractable - typical for deep learning - the relevant quantities are computed on mini-batches. This, however, distorts and biases the shape of the associated *stochastic* quadratic approximations in an intricate way with detrimental effects on applications. In this paper, we (i) show that this bias introduces a systematic error, (ii) provide a theoretical explanation for it, (iii) explain its relevance for second-order optimization and uncertainty quantification via the Laplace approximation in deep learning, and (iv) develop and evaluate debiasing strategies.
Lukas Tatzel, Bálint Mucsányi, Osane Hackel, Philipp Hennig
ICLR1
2024 Reparameterization invariance in approximate Bayesian inference
abstract
Current approximate posteriors in Bayesian neural networks (BNNs) exhibit a crucial limitation: they fail to maintain invariance under reparameterization, i.e. BNNs assign different posterior densities to different parametrizations of identical functions. This creates a fundamental flaw in the application of Bayesian principles as it breaks the correspondence between uncertainty over the parameters with uncertainty over the parametrized function. In this paper, we investigate this issue in the context of the increasingly popular linearized Laplace approximation. Specifically, it has been observed that linearized predictives alleviate the common underfitting problems of the Laplace approximation. We develop a new geometric view of reparametrizations from which we explain the success of linearization. Moreover, we demonstrate that these reparameterization invariance properties can be extended to the original neural network predictive using a Riemannian diffusion process giving a straightforward algorithm for approximate posterior sampling, which empirically improves posterior fit.
Hrittik Roy, Marco Miani, Carl Henrik Ek, Philipp Hennig, Marvin Pförtner, Lukas Tatzel, Søren Hauberg
NeurIPS6