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,742 papers · 148 categories

Trend · papers per month

50100150200 · May 202619922001200920172026
48 results for Laplace Matching

This study examines the practical equivalence of Laplace and neural tangent kernels.

problem Understanding the practical equivalence of Laplace and neural tangent kernels.
method The study matches the kernels exactly and by matching posteriors of a Gaussian process. It also analyzes the kernels in R^d and experiments with them in regression tasks.
result The Laplace and neural tangent kernels are practically equivalent.

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.

Expectation propagation (EP) is a powerful approximate inference algorithm. However, a critical barrier in applying EP is that the moment matching in message updates can be intractable. Handcrafting approximations is usually tricky, and lacks generalizability. Importance sampling is very expensive. While Laplace propag…

2019-10-27abs ↗pdf ↗

A new method matches similar regions in non-rigid shapes using spectra of differential operators.

problem Evaluating similarity of non-rigid shapes with partiality.
method Alignment of spectra of differential operators (SI-LBO and regular LBO) on a manifold with multiple metrics.
result Matching spectra outperforms competing methods on standard benchmarks.

We compare various extensions of the Bradley-Terry model and a hierarchical Poisson log-linear model in terms of their performance in predicting the outcome of soccer matches (win, draw, or loss). The parameters of the Bradley-Terry extensions are estimated by maximizing the log-likelihood, or an appropriately penalize…

2018-07-04abs ↗pdf ↗

A scalable method for Bayesian inference in large linear models.

problem High computational cost in Bayesian linear models for large networks.
method Sample-based inference and g-prior for hyperparameter selection.
result Linearised neural network inference on large datasets (ResNet-18, ResNet-50, U-Net).

We show that if two closed hyperbolic surfaces (not necessarily orientable or even connected) have the same Laplace spectrum, then for every length they have the same number of orientation-preserving geodesics and the same number of orientation-reversing geodesics. Restricted to orientable surfaces, this result reduces…

2006-05-30abs ↗pdf ↗

Improved regret bounds for DP-KLUCB and DP-IMED in Bernoulli bandits.

problem Minimizing regret in stochastic bandits under ε-global Differential Privacy.
method Developed DP versions of KLUCB and IMED, proving tighter lower bounds and matching upper bounds.
result DP-KLUCB and DP-IMED achieve asymptotically optimal regret under ε-global DP.

The paper analyzes rates of approximation for eigenpairs of Laplace-Beltrami operators on manifolds.

problem Estimating eigenpairs of elliptic differential operators from manifold samples.
method Analyzes minimax rates for eigenvalue and eigenvector estimation using graph Laplacians.
result The minimax rate for H1(M)H^1(M)-sense approximation is n2/(d+4)n^{-2/(d+4)}.

Let x:MEmx : M \to E^m be an isometric immersion of a Riemannian manifold MM into a Euclidean mm-space. Denote by ΔΔ the Laplace operator of MM. Then ΔΔ gives rise to a differentiable map L:MEmL :M \to E^m, called the Laplace map, defined by L(p)=(Δx)(p)L(p)=(Δx)(p), pMp\in M. We call L(M)L(M) the Laplace image, and the transformat…

2013-07-05abs ↗pdf ↗

Paper improves parameter estimation of continuous distributions using preference feedback.

problem Improving parameter estimation of continuous distributions.
method Preference-based M-estimators and deterministic preferences.
result Preference-based estimators achieve an estimation error scaling of O(1/n), significantly faster than sample-only methods.

Estimates eigenvalues of poly-Laplace operator on lattice subgraphs.

problem Estimating eigenvalues of poly-Laplace operator on subgraphs of lattice graphs.
method Introduced discrete poly-Laplace operator, derived upper and lower bounds for eigenvalues.
result Poly-Laplace eigenvalues are at least squares of lower-order poly-Laplace eigenvalues.

Revisits online Laplace methods for neural networks, showing they are sound under certain conditions.

problem Online Laplace methods violate the Laplace approximation's critical assumption.
method Re-derives online Laplace methods, showing they target a variational bound on a mode-corrected variant of the Laplace evidence.
result Online Laplace and its mode-corrected counterpart share stationary points that satisfy the Laplace method's assumption.

Formula derived for Laplace-Beltrami on Stiefel manifold.

problem Finding Laplace-Beltrami operator on Stiefel manifold.
method Using the general framework of Laplace operators on constraint manifolds, derived the explicit formula in terms of ambient Euclidean coordinates.
result Extended previously known formulas for sphere and special orthogonal group.

Study compares eigenvalues on spherically symmetric manifolds to Euclidean balls.

problem Comparing eigenvalues on spherically symmetric manifolds to Euclidean balls.
method Examines Dirichlet Laplace eigenvalues on balls of spherically symmetric manifolds and Euclidean space.
result Eigenvalues on spherically symmetric manifolds are smaller for small radii, but larger for hyperbolic spaces.

New methods improve Laplace approximations for deep neural networks by selecting key parameters.

problem Improving uncertainty quantification in deep neural networks using computationally feasible approximations.
method Gradient-Laplace and Greedy-Laplace methods for selecting parameters in sub-network Laplace approximations.
result Gradient-Laplace method outperforms existing heuristic approaches and provides formal optimality guarantees.

A new method combines Laplace and Variational Bayes for scalable inference.

problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.

The paper studies graph Laplace operator behavior near isolated singularities.

problem Investigating asymptotics of graph Laplace operator near isolated singularities.
method Analyzing curvature growth and conformal modifications to understand operator behavior.
result The graph Laplace operator converges to a weighted Laplace-Beltrami operator as bandwidth decreases, or behaves like \(O(\frac{1}{\sqrt{t}})\) if curvature grows too fast.

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.

MCMC complexity matches optimization for large nn and dd.

problem Lack of theoretical understanding of MCMC complexity for large nn and dd.
method Comparison of MCMC, LA, and VI complexities for linear, logistic, and Poisson regression.
result MCMC complexity matches optimization complexity for ndn\gtrsim d.

Neural Laplace models diverse DEs in the Laplace domain for better dynamics.

problem Inadequate ODEs for long-range dependencies and discontinuities.
method Unified framework in Laplace domain, using stereographic map for smoothness.
result Superior performance in diverse DEs, including complex history dependency and abrupt changes.

Graph Laplace operators uniquely identify metrics and densities on manifolds.

problem Identifying Riemannian metrics and sampling densities from graph Laplace operators.
method Analyzing intrinsic and extrinsic graph Laplace operators on compact Riemannian manifolds.
result Graph Laplace operators uniquely determine metrics and densities under certain conditions.

The study optimizes distribution estimation from samples with relative entropy error, adapting to sparse distributions.

problem Estimating discrete distributions with high-probability accuracy in relative entropy.
method Analysis of Laplace estimator and confidence-dependent smoothing techniques, including data-dependent smoothing.
result Optimal high-probability risk bounds for various estimators, including a new data-dependent smoothing method.

The paper introduces Laplace-type operators for functions defined on the tangent space of a Finsler Lie algebroid, using a volume form on the prolongation of the algebroid. It also presents the construction of a horizontal Laplace operator for forms defined on the prolongation of the algebroid. All of the Laplace opera…

2017-09-07abs ↗pdf ↗

The standard Laplace operator is a generalization of the Hodge Laplace operator on differential forms to arbitrary geometric vector bundles, alternatively it can be seen as generalization of the Casimir operator acting on sections of homogeneous vector bundles over symmetric spaces to general Riemannian manifolds. Stre…

2017-08-16abs ↗pdf ↗

We consider the Laplace normal vector field of relatively normalized ruled surfaces with non-vanishing Gaussian curvature in the three-dimensional Euclidean space R3\mathbb{R}^{3}. We determine all ruled surfaces and all relative normalizations for which the Laplace normal image degenerates into a point or into a curve…

2015-10-28abs ↗pdf ↗

We prove inequalities for Laplace eigenvalues of Kaehler manifolds generalising to higher eigenvalues the classical inequality for the first Laplace eigenvalue due to Bourguignon, Li, and Yau in 1994. We also obtain similar inequalities for analytic varieties in Kaehler manifolds.

2018-01-07abs ↗pdf ↗

Variational Laplace improves Bayesian neural network performance without sampling.

problem Improving Bayesian neural network performance and calibration.
method Develops a new variational Laplace method for BNNs, exploiting curvature of likelihood.
result Variational Laplace outperforms standard VI methods in test performance and calibration.

This research proves that quadratic regularized optimal transport can approximate the Laplace-Beltrami operator on smooth manifolds.

problem Approximating the Laplace-Beltrami operator using optimal transport with quadratic regularization.
method Deriving first-order optimal potentials and analyzing the convergence of discrete Laplace operators.
result The discrete Laplace operators converge to the Laplace-Beltrami operator on smooth manifolds.

Paper studies Laplace operator estimates in harmonic map heat flows.

problem Estimating Laplace operator in harmonic map heat flows outside singularities.
method Investigates estimates using spherical coordinates for T2\mathbb{T}^2 and T3\mathbb{T}^3 boundary conditions.
result Provides higher-order estimates for the Ericksen--Leslie system.

Method finds domain of Laplace-Beltrami operator on 2D almost-Riemannian manifolds.

problem Determining the domain of the Laplace-Beltrami operator on 2D almost-Riemannian manifolds with tangency points.
method Using tools from Lie groupoids, natural domains of perturbations are found.
result Method allows treatment of geometries with tangency points.

Study the smallest Laplace eigenvalue in special geometric spaces.

problem Finding the smallest positive eigenvalue of Laplace-Beltrami operator in strongly isotropy irreducible spaces.
method Explicit expression for simply connected cases, proving Einstein manifold properties and eigenvalue bounds.
result Proved E<λ116EE<λ_1\leq 16E for all strongly isotropy irreducible spaces.

Paper introduces Laplace-HDC for better binary hyperdimensional computing.

problem Improving binary hyperdimensional computing for spatial information.
method Develops Laplace-HDC using the Laplace kernel and Haar convolutional features.
result Laplace-HDC outperforms previous methods in encoding spatial information.

The paper studies Fourier-Laplace transforms in polynomial OU volatility models for option pricing.

problem Calibrating and pricing options in polynomial Ornstein-Uhlenbeck volatility models.
method Analyzes Fourier-Laplace transforms, connects to Riccati equations, and develops numerical schemes.
result Establishes existence and solution for Riccati equations and provides efficient numerical methods.