We study the solution to Kolmogorov-Feller equation and by using it provide pricing formulas of well known some options under jump-diffusion model.
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,742 papers · 148 categories
Trend · papers per month
48 results for “Kolmogorov equations”
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 …
Fokker-Planck and Chapman-Kolmogorov equations for Ito processes with finite memorycond-mat.stat-mech
The usual derivation of the Fokker-Planck partial differential eqn. assumes the Chapman-Kolmogorov equation for a Markov process. Starting instead with an Ito stochastic differential equation we argue that finitely many states of memory are allowed in Kolmogorov's two pdes, K1 (the backward time pde) and K2 (the Fokker…
We link SVEs to SPDEs and derive Kolmogorov equations for singular kernels.
problem Solving stochastic Volterra equations with singular kernels.
method Establishing connections between SVEs and SPDEs, using stochastic calculus in Hilbert spaces.
result Solutions of SVEs can be expressed in terms of backward Kolmogorov equations.
About Some Applications of Kolmogorov Equations to the Simulation of Financial Institutions Activityq-fin.GN
The goal of this article is to describe the concepts of system dynamics and its applications to the simulation modeling of financial institutions daily activity. The hybrid method of the re-engineering of banking business processes based upon combination of system dynamics, queuing theory and tools of ordinary differen…
Study finds conjugate points in geodesics of Kolmogorov flows on torus.
problem Characterizing pairs of integers (m,n) for which geodesics have conjugate points.
method Analysis of geodesics in the group of volume-preserving diffeomorphisms of a torus using stream functions.
result Existence of conjugate points for all pairs of strictly positive integers (m,n).
A new machine learning method solves high-dimensional Kolmogorov PDEs efficiently.
problem Solving high-dimensional Kolmogorov PDEs and SDEs.
method Stochastic weighted minimization and stochastic gradient descent with Malliavin weights.
result Accurate approximation of high-dimensional Kolmogorov PDEs and SDEs without curse of dimensionality.
Deep learning solves high-dimensional PDEs efficiently.
problem Solving high-dimensional Kolmogorov PDEs numerically.
method Reformulating as a statistical learning problem using Feynman-Kac formula.
result Single neural network learns entire family of PDEs.
New method speeds up SDE inference by matching moments to FPK equation.
problem Efficiency of sampling schemes in high-dimensional SDEs.
method Direct approximation of Fokker-Planck-Kolmogorov equation by matching moments.
result Fast, scalable inference in high-dimensional latent spaces.
A Nonlocal Approach to The Quantum Kolmogorov Backward Equation and Links to Noncommutative Geometryq-fin.MF
The Accardi-Boukas quantum Black-Scholes equation can be used as an alternative to the classical approach to finance, and has been found to have a number of useful benefits. The quantum Kolmogorov backward equations, and associated quantum Fokker-Planck equations, that arise from this general framework, are derived usi…
Projects Markovian processes from Itô semimartingales with jumps.
problem Modeling Itô semimartingales with jumps using Markovian projections.
method Construct Markovian projections for Itô semimartingales with jumps using non-local FPKEs.
result Markovian projections match the marginal laws of the original process.
Survey and new results link hydrodynamics, molecular physics, and financial engineering.
problem Understanding financial engineering topics like Asian options and volatility swaps.
method Linking Kevin waves, Klein-Kramers, and Kolmogorov equations to financial models.
result Corrected the original solution of the Kolmogorov equation.
The development of new classification and regression algorithms based on empirical risk minimization (ERM) over deep neural network hypothesis classes, coined deep learning, revolutionized the area of artificial intelligence, machine learning, and data analysis. In particular, these methods have been applied to the num…
A Probability Density Function for Google's stocksphysics.soc-ph
It is an approach to introduce the forward Kolmogorov equation as an interesting natural ingredient in studying the evolution of the market stock prices.
Uniform diffusion approximation for SGD in non-convex settings.
problem Finite-time diffusion approximation for SGD.
method Establishing uniform-in-time diffusion approximation with strong convexity and mild conditions.
result Uniform-in-time diffusion approximation of SGD without convexity of each loss function.
The paper studies dimensions of attractors for modified Leray-alpha equation on various surfaces.
problem Investigate attractor dimensions of the modified Leray-alpha equation.
method Existence and uniqueness of weak solutions, global attractor existence, estimates for vorticity scalar equations, Kolmogorov flows.
result Established upper and lower bounds for Hausdorff and fractal dimensions of global attractors on and .
KaCGM models provide transparent causal inference from tabular data.
problem Limited auditability in deep causal models for tabular data.
method KaCGM uses Kolmogorov-Arnold Networks to parameterize structural equations, enabling direct inspection and visualization of causal mechanisms.
result KaCGM achieves competitive performance and interpretable causal effects in real-world applications.
Opening the Black-Box: Symbolic Regression with Kolmogorov-Arnold Networks for Energy Applicationscs.LG
Kolmogorov-Arnold Networks offer interpretable models for energy applications.
problem Lack of interpretability in modern machine learning methods for sensitive industries.
method Symbolic regression with Kolmogorov-Arnold Networks compared to traditional feedforward neural networks.
result Kolmogorov-Arnold Networks yield perfectly interpretable models and learn real, physical relations.
New methods improve deep learning for solving linear PDEs.
problem Efficiently solving high-dimensional linear PDEs using deep learning.
method Rigorous investigation of gradient estimators for SDE-based variational formulations.
result Novel methods provide substantial performance improvements.
We consider the heat equation associated with a class of hypoelliptic operators of Kolmogorov-Fokker-Planck type in dimension two. We explicitly compute the first meaningful coefficient of the small time asymptotic expansion of the heat kernel on the diagonal, and we interpret it in terms of curvature-like invariants o…
Robust deep hedgingq-fin.RM
Proposes a deep hedging method for robust pricing and hedging under parameter uncertainty.
problem Pricing and hedging under parameter uncertainty for generalized affine processes.
method Deep learning approach linked to variational form of Kolmogorov equation.
result Robust deep hedging outperforms existing methods in volatile periods.
We study the mean field games equations, consisting of the coupled Kolmogorov-Fokker-Planck and Hamilton-Jacobi-Bellman equations. The equations are complemented by initial and terminal conditions. It is shown that with some specific choice of data, this problem can be reduced to solving a quadratically nonlinear syste…
We propose a deterministic numerical method for pricing vanilla options under the SABR stochastic volatility model, based on a finite element discretization of the Kolmogorov pricing equations via non-symmetric Dirichlet forms. Our pricing method is valid under mild assumptions on parameter configurations of the proces…
The paper develops a computational method for efficient online filtering of diffusion processes.
problem Online filtering of discretely observed nonlinear diffusion processes.
method The approach involves Doob's -transforms approximated by solving backward Kolmogorov equations using nonlinear Feynman-Kac formulas and neural networks.
result The proposed method can be orders of magnitude more efficient than state-of-the-art particle filters.
High order splitting schemes with complex timesteps and their application in mathematical financemath.NA
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,…
This paper deals with the exact calibration of semidiscretized stochastic local volatility (SLV) models to their underlying semidiscretized local volatility (LV) models. Under an SLV model, it is common to approximate the fair value of European-style options by semidiscretizing the backward Kolmogorov equation using fi…
Kolmogorov-Arnold Networks promise scalable performance in high dimensions.
problem Curse of dimensionality in multilayer perceptrons.
method Kolmogorov-Arnold representation theorem and interpolation methods.
result Kolmogorov-Arnold Networks achieve true freedom from the curse of dimensionality.
Calibration of stochastic local volatility (SLV) models to their underlying local volatility model is often performed by numerically solving a two-dimensional non-linear forward Kolmogorov equation. We propose a novel finite volume (FV) discretization in the numerical solution of general 1D and 2D forward Kolmogorov eq…
Kolmogorov neural networks can represent various types of functions.
problem Representing different types of functions with neural networks.
method Continuous, discontinuous bounded or unbounded activation functions in a two hidden layer model.
result Kolmogorov neural networks can represent continuous, discontinuous bounded and all unbounded multivariate functions.
Neural operators solve families of 2BSDEs efficiently.
problem Solving infinite families of 2BSDEs on bounded domains.
method Introduces a mild generative neural operator model to approximate solutions.
result Solution operators can be approximated by neural operators with polynomial parameters.
A framework solves parametric families of MFGs efficiently.
problem Efficiently solving MFG systems with varying initial distributions and terminal costs.
method Operator learning framework for parametric families of MFGs.
result Accurate approximation for cybersecurity and quadratic MFGs.
Revisits the connection between neural networks and the Kolmogorov-Arnold theorem.
problem Explains the limitations of using the Kolmogorov-Arnold theorem to explain neural networks with multiple hidden layers.
method Derives modifications of the Kolmogorov-Arnold representation that transfer smoothness properties to the outer function and can be well approximated by ReLU networks.
result Shows that a deep neural network with most layers approximating the interior function is a more natural interpretation of the Kolmogorov-Arnold representation.
Researchers use estimated Kolmogorov complexity for better link prediction in graphs.
problem Improving link prediction accuracy in complex networks.
method Regularization based on an approximation of Kolmogorov complexity, which is differentiable and compatible with recent link prediction algorithms.
result The regularization method shows good performance on diverse real-world networks, but the success is likely due to an aggregation method rather than actual estimation of Kolmogorov complexity.
Develops deep learning for fast, accurate option pricing models.
problem Computational efficiency and accuracy in option pricing models.
method Neural network generators solving backward Kolmogorov equations for TPDFs.
result Ultra-fast, highly accurate option pricing models for various asset models.
P1-KAN: an effective Kolmogorov-Arnold network with application to hydraulic valley optimizationcs.LG
A new Kolmogorov-Arnold network improves function approximation and optimization.
problem Approximating potentially irregular functions in high dimensions.
method Proposes a new Kolmogorov-Arnold network (KAN) and provides error bounds and universal approximation theorems.
result Outperforms multilayer perceptrons in accuracy and convergence speed for irregular functions.
SVGP KAN integrates uncertainty quantification into Kolmogorov-Arnold networks.
problem Uncertainty quantification in scientific machine learning models.
method Sparse variational Gaussian process inference with Kolmogorov-Arnold topology.
result Demonstrated ability to distinguish aleatoric and epistemic uncertainty in various scientific applications.
Centralized systemic risk control in the interbank system: Weak formulation and Gamma-convergencemath.OC
Paper studies central bank's strategy to control systemic risk in interbank system.
problem Minimizing average distance between log-monetary reserves and target levels.
method Weak formulation, Ekeland's variational principle, Gamma-convergence, stochastic Fokker-Planck-Kolmogorov equation.
result Proves convergence of optimal strategies as number of banks increases.
Efficient algorithm approximates discrete random variables with minimal Kolmogorov distance.
problem Estimating the probability of missing deadlines in series-parallel schedules.
method An efficient algorithm that computes a random variable with minimal Kolmogorov distance to a given discrete random variable.
result The algorithm efficiently approximates the probability of missing deadlines with minimal Kolmogorov distance.
It is shown that superpositions of path integrals with arbitrary Hamiltonians and different scaling parameters v ("variances") obey the Chapman-Kolmogorov relation for Markovian processes if and only if the corresponding smearing distributions for v have a specific functional form. Ensuing "smearing" distributions subs…
Enhanced autoencoders improve ROMs for PDEs by capturing essential properties.
problem Autoencoders struggle to capture essential properties for accurate ROMs.
method Introduced symmetric Convolutional AutoEncoders (CAEs) that preserve manifold properties.
result Symmetric CAEs yield more accurate latent trajectories and robust models.
Smooth KANs improve model reliability in computational biomedicine.
problem Limited convergence of KANs in representing generic smooth functions.
method Introducing smooth, structurally informed KANs that can approximate MLPs in specific function classes.
result Smooth KANs can achieve equivalence to MLPs in specific function classes, enhancing model reliability and performance.
K-DAREK improves KKANs for efficient function approximation with robust error bounds.
problem Efficient function approximation with uncertainty quantification for large-scale problems.
method Developed a novel learning algorithm, K-DAREK, for KKANs.
result Established robust error bounds that are distance-aware, improving efficiency and scalability.
We study gradient bounds and other functional inequalities for the diffusion semigroup generated by Kolmogorov type operators. The focus is on two different methods: coupling techniques and generalized -calculus techniques. The advantages and drawbacks of each of these methods are discussed.
Kolmogorov-Arnold Networks achieve optimal convergence rates in nonparametric regression.
problem Nonparametric function approximation in multivariate settings.
method Structured additive and multiplicative KANs using B-splines.
result Achieve minimax-optimal convergence rate for Sobolev space functions.
Proposes a flexible neural model for multi-state survival analysis.
problem Limited applicability of Cox models for multi-state and competing events.
method Uses neural ordinary differential equations to solve Kolmogorov forward equations.
result Demonstrates state-of-the-art performance and interpretability.
Kolmogorov-Smirnov GANstat.ML
KSGAN uses KS distance for deep generative modeling.
problem Deep generative modeling challenges, especially for multivariate distributions.
method Formulates adversarial training as minimization of KS distance, using quantile function as critic.
result KSGAN trained distributions closely match target distributions.
Kolmogorov-Arnold Networks improve deep learning adaptivity and can approximate Besov functions optimally.
problem Improving deep learning adaptivity and understanding approximation rates.
method Analyzing Besov norms and using Res-KANs for approximation.
result KANs can optimally approximate Besov functions at the optimal rate.
We consider several ways to measure the `geometric complexity' of an embedding from a simplicial complex into Euclidean space. One of these is a version of `thickness', based on a paper of Kolmogorov and Barzdin. We prove inequalities relating the thickness and the number of simplices in the simplicial complex, general…