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

Trend · papers per month

110220329439 · Jun 202019922001200920172026
48 results for Laplace process

New metrics using Laplace approximation improve Gaussian process model selection.

problem Finding a balance between model accuracy, interpretability, and simplicity.
method Introducing multiple metrics based on the Laplace approximation to evaluate Gaussian process models.
result Our metrics provide comparable performance to dynamic nested sampling but are significantly faster.

Extend classical theory of affine processes to path-dependent setting

problem Path-dependent affine processes
method Introduce path-dependent coefficients and provide analytic formulas for their Fourier--Laplace transform
result Define path-dependent affine processes through their exponential-affine Fourier--Laplace transform and establish a characterization theorem

New mechanism for pure differential privacy on functional summaries using Laplace-like process.

problem Challenges in achieving differential privacy for complex, structured functional summaries.
method Independent Component Laplace Process (ICLP) mechanism for infinite-dimensional Hilbert space.
result Effective enhancement of utility of private summaries through oversmoothing.

We establish an explicit expression for the conditional Laplace transform of the integrated Volterra Wishart process in terms of a certain resolvent of the covariance function. The core ingredient is the derivation of the conditional Laplace transform of general Gaussian processes in terms of Fredholm's determinant and…

2019-11-18abs ↗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.

We derive the explicit formula for the joint Laplace transform of the Wishart process and its time integral which extends the original approach of Bru. We compare our methodology with the alternative results given by the variation of constants method, the linearization of the Matrix Riccati ODE's and the Runge-Kutta al…

2011-07-14abs ↗pdf ↗

Unified analytical tool for non-Markovian jump processes.

problem Analyzing history-dependent jump processes with non-Markovian behavior.
method Developed a standard form of master equations using Laplace-space embedding and asymptotic solution.
result Unified analytical toolset for general non-Markovian processes, leading to the GLE approximation.

New iterative methods improve Vecchia-Laplace approximations for large data sets.

problem Inaccurate and slow Vecchia-Laplace approximations for large data sets.
method Iterative methods to improve Vecchia-Laplace approximations, including preconditioners and novel methods for predictive variances.
result Order of magnitude speed-up and threefold increase in prediction accuracy compared to state-of-the-art methods.

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.

Bayesian tensor train kernel machine uses Laplace approximation for scalable GP regression.

problem Scalability limitations of Gaussian process regression.
method Bayesian tensor train kernel machine with Laplace approximation and variational inference.
result VI replaces cross-validation and offers up to 65x faster training.

Sparse Gaussian process quantile regression tackles computational challenges in Bayesian quantile regression.

problem Nonconjugacy and computational cost in Gaussian process quantile regression.
method Sparse Gaussian process framework with Laplace approximation, adaptive inducing-input placement, and sequential data acquisition.
result Accuracy of Laplace approximation and effectiveness of adaptive mechanisms in reducing predictive uncertainty.

New SDEs from affine and polynomial perspectives for path-dependent processes.

problem Characterizing path-dependent stochastic processes.
method Affine and polynomial processes, signature SDEs, Fourier-Laplace transform, Riccati and linear ODEs.
result Explicit formulas for the Fourier-Laplace transform and expected values of entire functions of signature processes.

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.

Geometrically connects Laplace eigenfunctions to Borel-Weil theory on symmetric spaces.

problem Understanding the spectral properties of Laplace-Beltrami operators on Riemannian symmetric spaces.
method Using symplectic geometry and geometric quantization, associating flag manifolds to symmetric spaces and relating their Satake diagrams.
result Harmonic polynomials on flag manifolds induce all eigenfunctions on symmetric spaces.

This thesis disentangles Gauss-Newton and variational approximations in Bayesian deep learning.

problem Understanding the interplay between the Gauss-Newton method and variational approximations in Bayesian deep learning.
method Analysis of the Gauss-Newton method and Laplace/Gaussian variational approximations for neural networks.
result The combination of the Gauss-Newton method with approximate inference can be cast as inference in a linear or Gaussian process model.

In this paper, we obtain analytical expression for the distribution of the occupation time in the red (below level 00) up to an (independent) exponential horizon for spectrally negative Lévy risk processes and refracted spectrally negative Lévy risk processes. This result improves the existing literature in which only…

2019-03-09abs ↗pdf ↗

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.

Paper improves PBO using Skew Gaussian Processes for better optimization.

problem Optimizing with preference judgments, especially in A/B tests and recommender systems.
method Uses Skew Gaussian Processes to model preference function and exact posterior inference.
result Exact SkewGP posterior leads to better optimization results than Laplace approximation.

New method calculates geometric Brownian motion with affine drift and its integral.

problem Calculating the distribution of geometric Brownian motion with affine drift and its integral.
method Laplace transform approach and Heun differential equation.
result Joint distribution of geometric Brownian motion with affine drift and its integral can be determined.

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.

We analyze a simple asset transfer model in which the transfer amount is a fixed fraction ff of the giver's wealth. The model is analyzed in a new way by Laplace transforming the master equation, solving it analytically and numerically for the steady-state distribution, and exploring the solutions for various values o…

2010-04-29abs ↗pdf ↗

In this paper we study the Omega risk model with surplus-dependent tax payments in a time-homogeneous diffusion setting. The new model incorporates practical features from both the Omega risk model(Albrecher and Gerber and Shiu (2011)) and the risk model with tax(Albrecher and Hipp (2007)). We explicitly characterize t…

2014-03-29abs ↗pdf ↗

The stable under iterated tessellation (STIT) process is a stochastic process that produces a recursive partition of space with cut directions drawn independently from a distribution over the sphere. The case of random axis-aligned cuts is known as the Mondrian process. Random forests and Laplace kernel approximations …

2020-02-03abs ↗pdf ↗

We develop series expansions in powers of q1q^{-1} and q1/2q^{-1/2} of solutions of the equation ψ(z)=qψ(z) = q, where ψ(z)ψ(z) is the Laplace exponent of a hyperexponential Lévy process. As a direct consequence we derive analytic expressions for the prices of European call and put options and their Greeks (Theta, Delta, and G…

2017-05-16abs ↗pdf ↗

Develops a functional generalization of Eldan's stochastic localization for optimization and privacy.

problem Sampling under non-Euclidean geometries and optimization in differential privacy.
method Functional generalization of Eldan's stochastic localization, incorporating log-Laplace transform.
result Improves query complexities in zeroth-order differential private convex optimization.

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 ↗

We propose a family of models that enable predictive estimation of time-varying extreme event probabilities in heavy-tailed and nonlinearly dependent time series. The models are a white noise process with conditionally log-Laplace stochastic volatility. In contrast to other, similar stochastic volatility formalisms, th…

2019-01-08abs ↗pdf ↗

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.

New CRM models for sparse networks with linear edge growth.

problem Modeling extremely sparse networks with tractable properties.
method Introduced a new class of CRMs with index of variation α∈(0,1] based on mixtures of stable or generalized gamma processes.
result Models produce networks with near-linear edge growth, aligning with empirical evidence.

Post-hoc uncertainty quantification improves on pre-trained neural networks without underfitting.

problem Uncertainty quantification in neural networks is underfitting or computationally demanding.
method Gaussian Process Activation function (GAPA) for neuron-level uncertainty, with two methods: GAPA-Free and GAPA-Variational.
result GAPA-Variational outperforms Laplace approximation on most datasets in uncertainty quantification metrics.