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.
Paper approximates fractional harmonic maps with numerical methods.
We present effective numerical algorithms for locally recovering unknown governing differential equations from measurement data. We employ a set of standard basis functions, e.g., polynomials, to approximate the governing equation with high accuracy. Upon recasting the problem into a function approximation problem, we …
Artificial neural networks (ANNs) have very successfully been used in numerical simulations for a series of computational problems ranging from image classification/image recognition, speech recognition, time series analysis, game intelligence, and computational advertising to numerical approximations of partial differ…
Deep learning method improves numerical approximation of FBSDEs with jumps.
New ADANNs improve PDE approximations.
In this paper we present qualitative and quantitative comparison of various analytical and numerical approximation methods for calculating a position of the early exercise boundary of the American put option paying zero dividends. First we analyze their asymptotic behavior close to expiration. In the second part of the…
Study validates numerical method for singular FBSDEs convergence.
Neural and numerical methods approximate G2-structures on Calabi-Yau manifolds.
Study uses neural networks to solve complex equations efficiently.
Study efficient numerical methods for American basket options.
We derive semi-analytic approximation formulae for bond and swaption prices in a Black-Karasiński interest rate model. Approximations are obtained using a novel technique based on the Karhunen-Loève expansion. Formulas are easily computable and prove to be very accurate in numerical tests. This makes them useful for nu…
The paper analyzes contraction rates for GP regression approximations.
Two-layer networks struggle with high frequencies due to numerical and computational limitations.
A new numerical scheme approximates nonlinear filtering densities for noisy and partial measurements.
We consider the numerical approximation of the quantile hedging price in a non-linear market. In a Markovian framework, we propose a numerical method based on a Piecewise Constant Policy Timestepping (PCPT) scheme coupled with a monotone finite difference approximation. We prove the convergence of our algorithm combini…
Stochastic differential equations (SDEs) and the Kolmogorov partial differential equations (PDEs) associated to them have been widely used in models from engineering, finance, and the natural sciences. In particular, SDEs and Kolmogorov PDEs, respectively, are highly employed in models for the approximative pricing of …
We develop a new method to solve complex physics equations more accurately and efficiently.
We consider the problem of numerical approximation for forward-backward stochastic differential equations with drivers of quadratic growth (qgFBSDE). To illustrate the significance of qgFBSDE, we discuss a problem of cross hedging of an insurance related financial derivative using correlated assets. For the convergence…
We consider a singular control problem with regime switching that arises in problems of optimal investment decisions of cash-constrained firms. The value function is proved to be the unique viscosity solution of the associated Hamilton-Jacobi-Bellman equation. Moreover, we give regularity properties of the value functi…
The Black Box Variational Inference (Ranganath et al. (2014)) algorithm provides a universal method for Variational Inference, but taking advantage of special properties of the approximation family or of the target can improve the convergence speed significantly. For example, if the approximation family is a transforma…
Bayesian neural networks speed up numerical integration.
VISA improves inference efficiency for complex models.
This paper develops numerical methods for finding optimal dividend pay-out and reinsurance policies. A generalized singular control formulation of surplus and discounted payoff function are introduced, where the surplus is modeled by a regime-switching process subject to both regular and singular controls. To approxima…
Study on Wasserstein distance for numerical approximations of stochastic differential equations.
This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as positive-semidefiniteness, and they can produce approximations with a user-speci…
The issue of developing simple Black-Scholes type approximations for pricing European options with large discrete dividends was popular since early 2000's with a few different approaches reported during the last 10 years. Moreover, it has been claimed that at least some of the resulting expressions represent high-quali…
In this paper we study recent developments in the approximation of the spread option pricing. As the Kirkś Approximation is extremely flawed in the cases when the correlation is very high, we explore a recent development that allows approximating with simplicity and accuracy the option price. To assess the goodness of …
New method approximates Gaussian curvature on discrete surfaces.
The ability to decompose a signal in an orthonormal basis (a set of orthogonal components, each normalized to have unit length) using a fast numerical procedure rests at the heart of many signal processing methods and applications. The classic examples are the Fourier and wavelet transforms that enjoy numerically effic…
New method calculates cut locus on surfaces without boundary.
Neural networks approximate Calabi-Yau metrics and curvature.
We introduce a novel numerical approach for a class of stochastic dynamic programs which arise as discretizations of backward stochastic differential equations or semi-linear partial differential equations. Solving such dynamic programs numerically requires the approximation of nested conditional expectations, i.e., it…
Study numerical methods for singular FBSDEs with degenerate forward component.
We propose and analyze numerical methods for the Heath-Jarrow-Morton (HJM) model. To construct the methods, we first discretize the infinite dimensional HJM equation in maturity time variable using quadrature rules for approximating the arbitrage-free drift. This results in a finite dimensional system of stochastic dif…
We develop new algorithms for approximating extremal toric Kähler metrics. We focus on an extremal metric on , which is conformal to an Einstein metric (the Chen-LeBrun-Weber metric). We compare our approximation to one given by Bunch and Donaldson and compute various g…
Unified framework for Gaussian process methods in differential equations.
Closed-form relations and approximations for SE(3) derivatives for robust numerical simulations.
New method uses tensor trains for efficient PDE approximation.
Deep neural networks struggle with numerical instability during training.
Efficiently approximates integrals using a subset of samples from a target distribution in RKHS.
The process of dynamic state estimation (filtering) based on point process observations is in general intractable. Numerical sampling techniques are often practically useful, but lead to limited conceptual insight about optimal encoding/decoding strategies, which are of significant relevance to Computational Neuroscien…
The need for parameter estimation with massive datasets has reinvigorated interest in stochastic optimization and iterative estimation procedures. Stochastic approximations are at the forefront of this recent development as they yield procedures that are simple, general, and fast. However, standard stochastic approxima…
Develops efficient methods for approximating densities of financial models with jumps.
DALTON improves ODE parameter estimation by learning from noisy data.
New method improves stability of Gaussian process approximations.
Several numerical approximation strategies for the expectation-propagation algorithm are studied in the context of large-scale learning: the Laplace method, a faster variant of it, Gaussian quadrature, and a deterministic version of variational sampling (i.e., combining quadrature with variational approximation). Exper…
SALSA efficiently approximates leverage scores for big data, improving ARMA model fitting.
Approximates call option prices for Barndorff-Nielsen and Shephard model.