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

3774110147 · Jun 202019922001200920172026
48 results for splitting scheme

Study shows splitting schemes can approximate WFR flows faster than the exact flow.

problem Improving sampling efficiency in Wasserstein-Fisher-Rao gradient flows.
method Investigates operator splitting techniques to numerically approximate WFR flows.
result A judicious choice of step size and operator ordering can lead to faster convergence of split schemes to the target distribution.

A new numerical scheme approximates nonlinear filtering densities for noisy and partial measurements.

problem Approximating nonlinear filtering densities for noisy and partial measurements.
method Deep splitting scheme applied to the Fokker--Planck equation followed by Bayes' formula.
result Convergence rate established for the numerical scheme under parabolic Hörmander condition.

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…

2016-10-25abs ↗pdf ↗

Study numerical methods for singular FBSDEs with degenerate forward component.

problem Numerical approximation of singular fully coupled FBSDEs with degenerate forward component and non-smooth terminal condition.
method Splitting approach to treat diffusion and transport parts separately.
result The splitting method converges with rate 1/2 under structural condition.

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…

2015-04-04abs ↗pdf ↗

We construct normed spaces of real-valued functions with controlled growth on possibly infinite-dimensional state spaces such that semigroups of positive, bounded operators (Pt)t0(P_t)_{t\ge 0} thereon with limt0+Ptf(x)=f(x)\lim_{t\to 0+}P_t f(x)=f(x) are in fact strongly continuous. This result applies to prove optimal rates of converge…

2010-11-11abs ↗pdf ↗

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…

2018-11-05abs ↗pdf ↗

New method uses symmetric splitting for efficient HMC inference in large neural networks.

problem Efficient inference for Bayesian neural networks with large datasets.
method Introduces a symmetric integration scheme for Hamiltonian Monte Carlo (HMC) that does not rely on stochastic gradients.
result Symmetric splitting leads to more efficient HMC inference over large data sets.

Study splitting submanifolds in specific homogeneous spaces.

problem Classify splitting submanifolds in rational homogeneous spaces of Picard number one.
method Use global holomorphic vector fields and projection maps to analyze submanifolds.
result Proves submanifolds in certain spaces are rational or Hermitian symmetric.

The paper efficiently solves a complex option valuation equation for two assets.

problem Valuation of European options under a two-asset Kou jump-diffusion model.
method Extends an efficient algorithm for a one-dimensional integral to a two-dimensional one, using operator splitting schemes for time discretization.
result The method achieves optimal computational cost and stable convergence for various operator splitting schemes.

New algorithms solve monotone inclusions and convex-concave minimax problems.

problem Solving maximally monotone equations and inclusions.
method Developed new accelerated algorithms based on Halpern-type fixed-point iteration and Popov's past extra-gradient method.
result Achieved O(1/k)\mathcal{O}(1/k) convergence rates for various problems.

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…

2018-06-22abs ↗pdf ↗

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…

2014-03-07abs ↗pdf ↗

Reshuffling splits improves hyperparameter optimization's generalization performance.

problem Improving peak performance of machine learning models through better hyperparameter optimization.
method Reshuffling splits for every hyperparameter configuration improves generalization performance.
result Reshuffling leads to better generalization performance compared to fixed splits.

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…

2019-01-18abs ↗pdf ↗

New method accelerates energetic variational inference using particle dynamics.

problem Efficiently solving variational inference problems with reduced computational cost.
method Particle-based variational inference with implicit scheme, inspired by energy quadratization and operator splitting.
result Significantly reduces computational cost compared to existing methods.

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…

2019-08-22abs ↗pdf ↗

A new adaptive splitting method improves accuracy for Cox-Ingersoll-Ross model.

problem Improving numerical solution accuracy for Cox-Ingersoll-Ross model.
method Adaptive splitting method over deterministic and random meshes, with uniform moment bound and strong error results.
result Uniform moment bound and strong error results of order 1/4 in L1 and L2 for κθ>σ^2, and order 1 for large noise.

CAOS aggregates multiple one-shot predictors for efficient uncertainty quantification.

problem Lack of principled uncertainty quantification in one-shot prediction.
method CAOS, a conformal framework that aggregates multiple one-shot predictors and uses a leave-one-out calibration scheme.
result CAOS produces smaller prediction sets with reliable coverage compared to split conformal baselines.

This paper considers the problem of estimating multiple related Gaussian graphical models from a pp-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…

2015-03-07abs ↗pdf ↗

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…

2017-12-07abs ↗pdf ↗

We define a deformation of the triply graded Khovanov-Rozansky homology of a link LL depending on a choice of parameters ycy_c for each component of LL, which satisfies link-splitting properties similar to the Batson-Seed invariant. Keeping the ycy_c as formal variables yields a link homology valued in triply graded …

2017-12-11abs ↗pdf ↗

Adaptive Multilevel Splitting improves rare event pricing for financial derivatives.

problem Efficient pricing of binary options in rare event regimes with discontinuous payoffs.
method Adaptive Multilevel Splitting (AMS) reformulates rare-event problem as conditional events.
result AMS achieves up to 200-fold improvements over standard Monte Carlo, preserving unbiasedness.

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…

2015-09-20abs ↗pdf ↗

New method models dewetting of anisotropic particles using numerical techniques.

problem Modeling dewetting dynamics of particles with varying surface energies.
method Level set numerical approach with convolution kernels to handle anisotropic interfacial energies.
result Validated numerical scheme supports merging and splitting of interfaces.

Combines neural networks with splitting-up method for filtering equations.

problem Approximating the solution of filtering equations for signal processes.
method Combines splitting-up method with neural networks.
result Produces an approximation of the unnormalised conditional distribution.

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…

2018-03-15abs ↗pdf ↗

Paper generalizes extragradient methods for solving equations and inclusions with improved convergence rates.

problem Solving equations and inclusions using extragradient methods.
method Unified and generalized extragradient methods for a broader class of algorithms, analyzing sublinear convergence rates.
result Unified and improved convergence results for various extragradient variants.