Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

1122 · Jun 202419922001200920172026
10 results for Linearized-Laplace

The paper addresses the invariance issue in Bayesian neural networks using linearized Laplace approximation.

problem Bayesian neural networks fail to maintain invariance under reparameterization, leading to different posterior densities for identical functions.
method Developed a geometric view of reparameterizations and a Riemannian diffusion process to extend reparameterization invariance to neural network predictive.
result Empirically improved posterior fit through approximate posterior sampling.

LLA shows strong performance in Bayesian optimization but has unbounded search space issues.

problem Applying LLA in unbounded search spaces for Bayesian optimization.
method Linearized-Laplace approximation applied to Bayesian optimization problems.
result LLA demonstrates strong performance but also presents unbounded search space challenges.

New method optimizes hyperparameters in deep learning models efficiently.

problem Manual hyperparameter tuning in deep learning models is inefficient and requires expertise.
method Introduces lower bounds to the linearized Laplace approximation of the marginal likelihood using neural tangent kernels.
result Optimization of hyperparameters can be significantly accelerated using the method.

QLA improves Bayesian uncertainty estimation for DNNs without increasing computational cost.

problem Overconfident out-of-distribution predictions from DNNs.
method Proposes Quadratic Laplace Approximation (QLA) to improve Bayesian uncertainty quantification.
result QLA yields modest yet consistent uncertainty estimation improvements over Linearized Laplace Approximation (LLA) on five regression datasets.

A new method for efficient uncertainty estimation in deep learning models.

problem High computational costs in uncertainty estimation for deep neural networks.
method Variational sparse Gaussian Process approximation of the Linearized Laplace Approximation.
result Sub-linear training time and improved performance compared to existing methods.

We use the theory of rectifiable metric spaces to define a Dirichlet energy of Lipschitz functions defined on the support of integral currents. This energy is obtained by integration of the square of the norm of the tangential derivative, or equivalently of the approximate local dilatation, of the Lipschitz functions. …

2014-01-20abs ↗pdf ↗

A novel Laplace-approximated Bayesian Tensor Network Kernel Machine (LA-TNKM) provides principled uncertainty estimates.

problem How to provide principled uncertainty estimates for tensor network kernel machines.
method Employing a linearized Laplace approximation for Bayesian inference.
result Consistently matches or surpasses Gaussian Processes and BNNs across diverse UCI regression benchmarks.

LUNO linearizes neural operators to quantify their predictive uncertainty.

problem Quantifying the predictive error of neural operators for high-stakes simulations.
method Model linearization to push weight-space uncertainty forward to predictions.
result LUNO provides a practical and theoretically sound way to apply Bayesian methods to neural operators.

Bayesian optimization uses BNNs as efficient surrogate models for expensive function evaluations.

problem Optimizing expensive objective functions using Gaussian process surrogates.
method Study of Bayesian neural networks (BNNs) as alternatives to standard Gaussian process (GP) surrogates for optimization.
result Infinite-width BNNs are particularly promising, especially in high dimensions.