New approach connects stochastic gradient descent to ODE splitting schemes.
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.
Trend · papers per month
High order splitting schemes with complex timesteps are applied to Kolmogorov backward equations stemming from stochastic differential equations in Stratonovich form. In the setting of weighted spaces, the necessary analyticity of the split semigroups can be easily proved. A numerical example from interest rate theory,…
New algorithms improve sampling from constrained distributions.
Study shows splitting schemes can approximate WFR flows faster than the exact flow.
A new numerical scheme approximates nonlinear filtering densities for noisy and partial measurements.
This paper deals with the efficient numerical solution of the two-dimensional partial integro-differential complementarity problem (PIDCP) that holds for the value of American-style options under the two-asset Merton jump-diffusion model. We consider the adaptation of various operator splitting schemes of both the impl…
The three operator splitting scheme was recently proposed by [Davis and Yin, 2015] as a method to optimize composite objective functions with one convex smooth term and two convex (possibly non-smooth) terms for which we have access to their proximity operator. In this short note we provide an alternative proof for the…
Study validates numerical method for singular FBSDEs convergence.
Improved sampling for network community detection.
Study numerical methods for singular FBSDEs with degenerate forward component.
This work deals with the simulation of Wishart processes and affine diffusions on positive semidefinite matrices. To do so, we focus on the splitting of the infinitesimal generator, in order to use composition techniques as Ninomiya and Victoir or Alfonsi. Doing so, we have found a remarkable splitting for Wishart proc…
New deformation of link homology for colored diagrams.
Financial derivatives pricing aims to find the fair value of a financial contract on an underlying asset. Here we consider option pricing in the partial differential equations framework. The contemporary models lead to one-dimensional or multidimensional parabolic problems of the convection-diffusion type and generaliz…
Our aim in this note is to extend the semi discrete technique by combine it with the split step method. We apply our new method to the Ait-Sahalia model and propose an explicit and positivity preserving numerical scheme.
The Transformer architecture is widely used in natural language processing. Despite its success, the design principle of the Transformer remains elusive. In this paper, we provide a novel perspective towards understanding the architecture: we show that the Transformer can be mathematically interpreted as a numerical Or…
We construct normed spaces of real-valued functions with controlled growth on possibly infinite-dimensional state spaces such that semigroups of positive, bounded operators thereon with are in fact strongly continuous. This result applies to prove optimal rates of converge…
We describe a scheme for constructing generating sets for Kronheimer and Mrowka's singular instanton knot homology for the case of knots in lens spaces. The scheme involves Heegaard-splitting a lens space containing a knot into two solid tori. One solid torus contains a portion of the knot consisting of an unknotted ar…
New method uses symmetric splitting for efficient HMC inference in large neural networks.
Study splitting submanifolds in specific homogeneous spaces.
Performing exact Bayesian inference for complex models is computationally intractable. Markov chain Monte Carlo (MCMC) algorithms can provide reliable approximations of the posterior distribution but are expensive for large datasets and high-dimensional models. A standard approach to mitigate this complexity consists i…
The paper efficiently solves a complex option valuation equation for two assets.
Annotating large unlabeled datasets can be a major bottleneck for machine learning applications. We introduce a scheme for inferring labels of unlabeled data at a fraction of the cost of labeling the entire dataset. Our scheme, bounded expectation of label assignment (BELA), greedily queries an oracle (or human labeler…
New algorithms solve monotone inclusions and convex-concave minimax problems.
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…
The classification of multi-class microarray datasets is a hard task because of the small samples size in each class and the heavy overlaps among classes. To effectively solve these problems, we propose novel Error Correcting Output Code (ECOC) algorithm by Enhance Class Separability related Data Complexity measures du…
This paper is dedicated to the construction of high-order (in both space and time) finite-difference schemes for both forward and backward PDEs and PIDEs, such that option prices obtained by solving both the forward and backward equations are consistent. This approach is partly inspired by Andreasen & Huge, 2011 who re…
In the following paper we present a new type of optimization algorithms adapted for neural network training. These algorithms are based upon sequential operator splitting technique for some associated dynamical systems. Furthermore, we investigate through numerical simulations the empirical rate of convergence of these…
We introduce efficient numerical methods for generic HJM equations of interest rate theory by means of high-order weak approximation schemes. These schemes allow for QMC implementations due to the relatively low dimensional integration space. The complexity of the resulting algorithm is considerably lower than the comp…
Reshuffling splits improves hyperparameter optimization's generalization performance.
Co-Clustering, the problem of simultaneously identifying clusters across multiple aspects of a data set, is a natural generalization of clustering to higher-order structured data. Recent convex formulations of bi-clustering and tensor co-clustering, which shrink estimated centroids together using a convex fusion penalt…
New method accelerates energetic variational inference using particle dynamics.
A new scheme for private computation splits client data into shares for server operations.
Echo State Networks (ESNs) are known for their fast and precise one-shot learning of time series. But they often need good hyper-parameter tuning for best performance. For this good validation is key, but usually, a single validation split is used. In this rather practical contribution we suggest several schemes for cr…
A new adaptive splitting method improves accuracy for Cox-Ingersoll-Ross model.
We study a stochastic and distributed algorithm for nonconvex problems whose objective consists of a sum of nonconvex -smooth functions, plus a nonsmooth regularizer. The proposed NonconvEx primal-dual SpliTTing (NESTT) algorithm splits the problem into subproblems, and utilizes an augmented Lagrangian b…
The study finds an infinite number of minimal surfaces in 3D spheres.
CAOS aggregates multiple one-shot predictors for efficient uncertainty quantification.
This paper considers the problem of estimating multiple related Gaussian graphical models from a -dimensional dataset consisting of different classes. Our work is based upon the formulation of this problem as group graphical lasso. This paper proposes a novel hybrid covariance thresholding algorithm that can effecti…
Conventional decision trees have a number of favorable properties, including interpretability, a small computational footprint and the ability to learn from little training data. However, they lack a key quality that has helped fuel the deep learning revolution: that of being end-to-end trainable, and to learn from scr…
We define a deformation of the triply graded Khovanov-Rozansky homology of a link depending on a choice of parameters for each component of , which satisfies link-splitting properties similar to the Batson-Seed invariant. Keeping the as formal variables yields a link homology valued in triply graded …
Adaptive Multilevel Splitting improves rare event pricing for financial derivatives.
In this paper we develop a statistical theory and an implementation of deep learning models. We show that an elegant variable splitting scheme for the alternating direction method of multipliers optimises a deep learning objective. We allow for non-smooth non-convex regularisation penalties to induce sparsity in parame…
We propose a new, unified approach to solving jump-diffusion partial integro-differential equations (PIDEs) that often appear in mathematical finance. Our method consists of the following steps. First, a second-order operator splitting on financial processes (diffusion and jumps) is applied to these PIDEs. To solve the…
New method models dewetting of anisotropic particles using numerical techniques.
Combines neural networks with splitting-up method for filtering equations.
Utilizing a splitting of geometric flows on surfaces introduced by Buzano and Rupflin, we present a general scheme to prove blow up criteria for such geometric flows. A vital ingredient is a new compactness theorem for families of metrics on surfaces with a uniform bound on their volumes, square integrals of their curv…
Paper generalizes extragradient methods for solving equations and inclusions with improved convergence rates.
This paper considers exponential utility indifference pricing for a multidimensional non-traded assets model subject to inter-temporal default risk, and provides a semigroup approximation for the utility indifference price. The key tool is the splitting method, whose convergence is proved based on the Barles-Souganidis…