Scalable Linearized Laplace Approximation via Surrogate Neural Kernel

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Ortega, Luis A., Rodríguez-Santana, Simón, Hernández-Lobato, Daniel
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915769708707840
author Ortega, Luis A.
Rodríguez-Santana, Simón
Hernández-Lobato, Daniel
author_facet Ortega, Luis A.
Rodríguez-Santana, Simón
Hernández-Lobato, Daniel
contents We introduce a scalable method to approximate the kernel of the Linearized Laplace Approximation (LLA). For this, we use a surrogate deep neural network (DNN) that learns a compact feature representation whose inner product replicates the Neural Tangent Kernel (NTK). This avoids the need to compute large Jacobians. Training relies solely on efficient Jacobian-vector products, allowing to compute predictive uncertainty on large-scale pre-trained DNNs. Experimental results show similar or improved uncertainty estimation and calibration compared to existing LLA approximations. Notwithstanding, biasing the learned kernel significantly enhances out-of-distribution detection. This remarks the benefits of the proposed method for finding better kernels than the NTK in the context of LLA to compute prediction uncertainty given a pre-trained DNN.
format Preprint
id arxiv_https___arxiv_org_abs_2601_21835
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Scalable Linearized Laplace Approximation via Surrogate Neural Kernel
Ortega, Luis A.
Rodríguez-Santana, Simón
Hernández-Lobato, Daniel
Machine Learning
We introduce a scalable method to approximate the kernel of the Linearized Laplace Approximation (LLA). For this, we use a surrogate deep neural network (DNN) that learns a compact feature representation whose inner product replicates the Neural Tangent Kernel (NTK). This avoids the need to compute large Jacobians. Training relies solely on efficient Jacobian-vector products, allowing to compute predictive uncertainty on large-scale pre-trained DNNs. Experimental results show similar or improved uncertainty estimation and calibration compared to existing LLA approximations. Notwithstanding, biasing the learned kernel significantly enhances out-of-distribution detection. This remarks the benefits of the proposed method for finding better kernels than the NTK in the context of LLA to compute prediction uncertainty given a pre-trained DNN.
title Scalable Linearized Laplace Approximation via Surrogate Neural Kernel
topic Machine Learning
url https://arxiv.org/abs/2601.21835