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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for integral approximation

Smooth approximation of integral cycles mod 2 in Riemannian manifolds.

problem Approximating mod 2 integral cycles by smooth submanifolds.
method Approximation of mod 2 integral cycles by smooth submanifolds with controlled singularities.
result Every mod 2 integral cycle can be approximated by a smooth submanifold with a controlled singular set.

This paper develops a general method for constructing Poisson integrators.

problem Lack of a general theory for Poisson integrators due to geometric challenges.
method Adapting structural results about symplectic realizations to create geometric approximations.
result Developed a general approach for constructing geometric integrators on Poisson manifolds.

We use neural networks as control variates with geometric integration techniques.

problem Analytic integration of neural network approximations for variance reduction.
method Integration domain subdivision using computational geometry for MLPs with continuous piecewise linear activation functions.
result Neural networks can be used as control variates with geometric integration methods.

We develop variational integrators from discrete Hamiltonian systems with external forces.

problem Creating accurate discrete models of continuous Hamiltonian systems.
method Constructing discrete Hamiltonian systems with external forces, analyzing symplectic structure, and combining methods to build variational integrators.
result We derive variational integrators that approximate continuous Hamiltonian systems with high accuracy.

The paper proves signatures of non-geometric rough paths can approximate functionals uniformly.

problem Approximating functionals of non-geometric rough paths.
method Extending rough paths with time and quadratic variation terms, proving uniform approximation.
result Linear functionals of extended signatures uniformly approximate continuous functionals.

Posterior refinement improves sample efficiency in Bayesian neural networks.

problem Bayesian neural networks suffer from poor predictive performance due to inaccurate posterior approximations.
method Propose refining Gaussian approximate posteriors with normalizing flows to improve predictive distributions.
result Posterior refinement yields competitive predictive performance with minimal computational overhead.

We consider the problem of improving kernel approximation via randomized feature maps. These maps arise as Monte Carlo approximation to integral representations of kernel functions and scale up kernel methods for larger datasets. Based on an efficient numerical integration technique, we propose a unifying approach that…

2018-02-11abs ↗pdf ↗

In this paper, we prove that a shallow neural network with a monotone sigmoid, ReLU, ELU, Softplus, or LeakyReLU activation function can arbitrarily well approximate any L^p(p>=2) integrable functions defined on R*[0,1]^n. We also prove that a shallow neural network with a sigmoid, ReLU, ELU, Softplus, or LeakyReLU act…

2019-10-21abs ↗pdf ↗

Novel approach to financial derivatives pricing using rough path theory.

problem No-arbitrage conditions in financial markets necessitating precise integration methods.
method Developed a polynomial-based approximation class for rough path functionals, extending to non-geometric rough paths.
result Motivated a hypothesis for payoff functionals in financial markets, facilitating analysis.

We develop a framework for approximating collapsed Gibbs sampling in generative latent variable cluster models. Collapsed Gibbs is a popular MCMC method, which integrates out variables in the posterior to improve mixing. Unfortunately for many complex models, integrating out these variables is either analytically or co…

2018-07-19abs ↗pdf ↗

We show that non-elliptic prime 3-manifolds satisfy integral approximation for the simplicial volume, i.e., that their simplicial volume equals the stable integral simplicial volume. The proof makes use of integral foliated simplicial volume and tools from ergodic theory.

2019-10-14abs ↗pdf ↗

We give a pragmatic/pedagogical discussion of using Euclidean path integral in asset pricing. We then illustrate the path integral approach on short-rate models. By understanding the change of path integral measure in the Vasicek/Hull-White model, we can apply the same techniques to "less-tractable" models such as the …

2014-10-07abs ↗pdf ↗

Efficiently approximates integrals using a subset of samples from a target distribution in RKHS.

problem Approximating integrals with a target distribution using limited pointwise evaluations.
method Proposes a procedure using a small random subset of samples from the target distribution, either uniformly or using approximate leverage scores.
result Upper bound on approximation error for both sampling strategies, achieving optimal rate with reduced evaluations.

A new method combines AIS and SMCI for efficient evaluation of Ising models.

problem Efficiently evaluating expectations on Ising models under various temperatures.
method Combining Annealed Importance Sampling (AIS) and Spatial Monte Carlo Integration (SMCI).
result The proposed method performs efficiently in both high- and low-temperature regions.

Asymptotic error distribution for approximation of a stochastic integral with respect to continuous semimartingale by Riemann sum with general stochastic partition is studied. Effective discretization schemes of which asymptotic conditional mean-squared error attains a lower bound are constructed. Two applications are …

2010-04-13abs ↗pdf ↗

Integration of the form af(x)w(x)dx\int_a^\infty {f(x)w(x)dx} , where w(x)w(x) is either sin(ωx)\sin (ω{\kern 1pt} x) or cos(ωx)\cos (ω{\kern 1pt} x), is widely encountered in many engineering and scientific applications, such as those involving Fourier or Laplace transforms. Often such integrals are approximated by a numerical integration…

2010-05-11abs ↗pdf ↗

Let M be a compact Riemannian manifold without boundary and let H be a self-adjoint generalized Laplace operator acting on sections in a bundle over M. We give a path integral formula for the solution to the corresponding heat equation. This is based on approximating path space by finite dimensional spaces of geodesic …

2007-03-09abs ↗pdf ↗

Researchers create integral representations for two-layer ReLU networks with quantitative bounds.

problem Approximating functions with two-layer ReLU networks using explicit integral representations.
method Developed integral representations involving harmonic extension and projection, providing L2L^{2} bounds.
result Functions can be approximated with L2L^{2} errors independent of dimension or degree, depending on coefficients and distribution.

A new method for uncertainty estimation in neural networks using Gaussian-softmax integration.

problem Quantifying uncertainty in neural network predictions.
method Proposes a single-model approach integrating Gaussian distribution with softmax outputs, using mean-field approximation.
result Competitive performance on uncertainty estimation tasks and outperforms many methods on out-of-distribution detection.

We introduce the Variational Holder (VH) bound as an alternative to Variational Bayes (VB) for approximate Bayesian inference. Unlike VB which typically involves maximization of a non-convex lower bound with respect to the variational parameters, the VH bound involves minimization of a convex upper bound to the intract…

2015-06-19abs ↗pdf ↗

Graph manifolds are manifolds that decompose along tori into pieces with a tame S1S^1-structure. In this paper, we prove that the simplicial volume of graph manifolds (which is known to be zero) can be approximated by integral simplicial volumes of their finite coverings. This gives a uniform proof of the vanishing of …

2018-07-27abs ↗pdf ↗

Efficiently simulates SABR model with novel sampling methods.

problem Sampling integrated variance and terminal forward price in SABR model.
method Moment-matched shifted lognormal approximation for integrated variance, CEV approximation for terminal forward price.
result Enhanced simulation scheme is highly efficient, accurate, and reliable.

Improved approximation for socially fair clustering with p\ell_p-objective.

problem Finding a set of centers minimizing the maximum distance to all points in each group.
method Introduced a strengthened LP relaxation with an integrality gap of Θ(logloglog)\Theta(\frac{\log \ell}{\log\log\ell}).
result Improved approximation algorithm with (eO(p)logloglog)(e^{O(p)} \frac{\log \ell}{\log\log\ell})-approximation.

Paper provides estimates for varifolds with critical mean curvature.

problem Estimating tilt-excess on varifolds with critical mean curvature.
method Generalizing Lipschitz approximation and Sobolev-Poincaré estimates to almost-integral rectifiable varifolds.
result VMO-type estimates for quadratic tilt-excess on varifolds with critical mean curvature.

The paper studies the consistency of mean curvature flow via volumetric varifolds.

problem Consistency of mean curvature flow.
method Discretization using volumetric varifolds and derivation of Brakke approximate equality.
result Derivation of a Brakke approximate equality involving varifold masses and approximate mean curvatures.

In this survey article, we review the relation between heat kernels and path integrals. In particular, we review recent results on the approximation of the Wiener measure on compact manifold by measures on (finite-dimensional) spaces of piece-wise geodesics.

2018-10-18abs ↗pdf ↗

Consider a process, stochastic or deterministic, obtained by using a numerical integration scheme, or from Monte-Carlo methods involving an approximation to an integral, or a Newton-Raphson iteration to approximate the root of an equation. We will assume that we can sample from the distribution of the process from time…

2010-05-12abs ↗pdf ↗

NCV uses neural networks to improve Monte Carlo integration.

problem Improving variance reduction in parametric Monte Carlo integration.
method NCV combines a normalizing flow and a neural network to approximate the integrand and solve the integral equation, with a neural importance sampler to estimate the difference.
result NCV achieves state-of-the-art performance in light transport simulation with reduced noise and negligible bias.