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 develops a finite dimensional approximation scheme for Riemannian manifolds.
We develop high-order approximations for the Heston model.
We consider a general class of high order weak approximation schemes for stochastic differential equations driven by Lévy processes with infinite activity. These schemes combine a compound Poisson approximation for the jump part of the Lévy process with a high order scheme for the Brownian driven component, applied bet…
Efficient simulation scheme for rough Heston model reduces computational cost.
In this paper we propose a generalized numerical scheme for backward stochastic differential equations(BSDEs). The scheme is based on approximation of derivatives via Lagrange interpolation. By changing the distribution of sample points used for interpolation, one can get various numerical schemes with different stabil…
A fast, accurate method for pricing American options with free boundaries.
A new numerical scheme approximates nonlinear filtering densities for noisy and partial measurements.
The paper analyzes convergence of Riemannian SA schemes for stochastic optimization.
Novel weak MLMC scheme for Lévy-driven SDEs, applied to financial derivatives pricing.
New method approximates CVaR with less data for heavy-tailed risks.
Develops a curvature-corrected tangent space method for manifold-valued data.
We develop continuous time Markov chain (CTMC) approximation of one-dimensional diffusions with a lower sticky boundary. Approximate solutions to the action of the Feynman-Kac operator associated with a sticky diffusion and first passage probabilities are obtained using matrix exponentials. We show how to compute matri…
In this article, a three-time levels compact scheme is proposed to solve the partial integro-differential equation governing the option prices under jump-diffusion models. In the proposed compact scheme, the second derivative approximation of unknowns is approximated by the value of unknowns and their first derivative …
Develops multifactor approximations for SVEs with completely monotone kernels.
New high-order approximations for CIR process using random grids.
Variational approximations for curve flows on Riemannian manifolds.
New learning scheme solves high-dimensional semi-linear PDEs using sparse grids and Picard approximations.
This note gives a simple analysis of a randomized approximation scheme for matrix multiplication proposed by Sarlos (2006) based on a random rotation followed by uniform column sampling. The result follows from a matrix version of Bernstein's inequality and a tail inequality for quadratic forms in subgaussian random ve…
Study validates numerical method for singular FBSDEs convergence.
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…
Computing approximate nearest neighbors in high dimensional spaces is a central problem in large-scale data mining with a wide range of applications in machine learning and data science. A popular and effective technique in computing nearest neighbors approximately is the locality-sensitive hashing (LSH) scheme. In thi…
We obtain the first positive results for bounded sample compression in the agnostic regression setting with the loss, where . We construct a generic approximate sample compression scheme for real-valued function classes exhibiting exponential size in the fat-shattering dimension but independen…
Matrix multiplication is a fundamental building block for large scale computations arising in various applications, including machine learning. There has been significant recent interest in using coding to speed up distributed matrix multiplication, that are robust to stragglers (i.e., machines that may perform slower …
The paper analyzes fixed step-size SA schemes on Riemannian manifolds.
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 …
We introduce a simulation scheme for Brownian semistationary processes, which is based on discretizing the stochastic integral representation of the process in the time domain. We assume that the kernel function of the process is regularly varying at zero. The novel feature of the scheme is to approximate the kernel fu…
We introduce variational approximations for curve evolutions in two-dimensional Riemannian manifolds that are conformally flat, i.e.\ conformally equivalent to the Euclidean space. Examples include the hyperbolic plane, the hyperbolic disk, the elliptic plane as well as any conformal parameterization of a two-dimension…
New sampling scheme improves ML accuracy in physics simulations.
Improved multilevel scheme for value-at-risk computation.
Novel IMEX scheme solves financial PDEs with mixed derivatives.
Efficiently simulates SABR model with novel sampling methods.
Bayesian learning in undirected graphical models|computing posterior distributions over parameters and predictive quantities is exceptionally difficult. We conjecture that for general undirected models, there are no tractable MCMC (Markov Chain Monte Carlo) schemes giving the correct equilibrium distribution over param…
Estimates expected information gain using density approximations and dimension reduction.
We evaluate the hedging performance of a high-order compact finite difference scheme from [4] for option pricing in Bates model. We compare the scheme's hedging performance to standard finite difference methods in different examples. We observe that the new scheme outperforms a standard, second-order central finite dif…
A discretization scheme for nonnegative diffusion processes is proposed and the convergence of the corresponding sequence of approximate processes is proved using the martingale problem framework. Motivations for this scheme come typically from finance, especially for path-dependent option pricing. The scheme is simple…
In this work, we revisit fast dimension reduction approaches, as with random projections and random sampling. Our goal is to summarize the data to decrease computational costs and memory footprint of subsequent analysis. Such dimension reduction can be very efficient when the signals of interest have a strong structure…
New gradient coding schemes reduce decoding error in both random and adversarial straggler settings.
Paper explores properties of slice-matching operators for measure transfer.
In this paper we discuss the possibility of using multilevel Monte Carlo (MLMC) methods for weak approximation schemes. It turns out that by means of a simple coupling between consecutive time discretisation levels, one can achieve the same complexity gain as under the presence of a strong convergence. We exemplify thi…
A new EVI framework improves ParVI methods by maintaining variational structure and reducing KL-divergence.
New method improves credit risk estimation and pricing.
Suppose that one particular block in a stochastic block model is of interest, but block labels are only observed for a few of the vertices in the network. Utilizing a graph realized from the model and the observed block labels, the vertex nomination task is to order the vertices with unobserved block labels into a rank…
Study approximates probability measures using structured classes of functions.
Nyström KPCA balances computational efficiency and statistical accuracy.
The digital telecommunications receiver is an important context for inference methodology, the key objective being to minimize the expected loss function in recovering the transmitted information. For that criterion, the optimal decision is the Bayesian minimum-risk estimator. However, the computational load of the Bay…
Asynchronous stochastic approximations (SAs) are an important class of model-free algorithms, tools and techniques that are popular in multi-agent and distributed control scenarios. To counter Bellman's curse of dimensionality, such algorithms are coupled with function approximations. Although the learning/ control pro…
We show that asymptotically, completely asynchronous stochastic gradient procedures achieve optimal (even to constant factors) convergence rates for the solution of convex optimization problems under nearly the same conditions required for asymptotic optimality of standard stochastic gradient procedures. Roughly, the n…
New discretization scheme for Wasserstein gradient flows using Schrödinger bridges.