A new SINC method for fast and accurate option pricing.
problem Computing option prices efficiently and accurately.
method SINC approach based on Shannon Sampling Theorem.
result SINC provides the most accurate and fast pricing computation.
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
48 results for “Fast Fourier techniques”
New method uses machine learning to optimize Fourier pricing methods.
problem Difficulty in tuning parameters for Fourier pricing methods.
method Learning tuning parameters of Fourier methods using machine learning.
result Very fast algorithms with full error control.
We apply a new numerical method, the singular Fourier-Padé (SFP) method invented by Driscoll and Fornberg (2001, 2011), to price European-type options in Lévy and affine processes. The motivation behind this application is to reduce the inefficiency of current Fourier techniques when they are used to approximate piecew…
A new algorithm computes Fourier coefficients for a specified range efficiently.
problem Inefficiency in FFT due to fixed output size for all applications.
method Fast Partial Fourier Transform (PFT) that allows specifying the range of Fourier coefficients to compute.
result PFT achieves significant speedup over state-of-the-art FFT algorithms for small output sizes.
Enhances Fourier estimator performance for asynchronous event-data.
problem Improving correlation and covariance estimation on event-data.
method Implement and test NUFFT methods with different averaging kernels.
result Demonstrates improved performance and relationship between averaging scales.
NUFFT for the Fast COS Methodq-fin.CP
A new NUFFT method speeds up option pricing for various strikes.
problem Efficiently pricing many options of the same maturity but different strikes.
method Non-uniform fast Fourier transform (NUFFT) applied to the COS method.
result Significantly faster computation of option prices.
A new method slices and sums radial kernels faster.
problem Fast computation of large kernel sums in kernel methods.
method Random projections to 1D subspaces and QMC for selecting projections.
result QMC-slicing outperforms existing methods on test datasets.
In this paper we consider Fourier transform techniques to efficiently compute the Value-at-Risk and the Conditional Value-at-Risk of an arbitrary loss random variable, characterized by having a computable generalized characteristic function. We exploit the property of these risk measures of being the solution of an ele…
Quasi-Monte Carlo with Domain Transformation for Efficient Fourier Pricing of Multi-Asset Optionsq-fin.CP
This work improves Fourier pricing for multi-asset options using RQMC with domain transformation.
problem Efficiently pricing multi-asset options in high dimensions with Fourier methods.
method Randomized quasi-Monte Carlo (RQMC) with domain transformation to handle singularities.
result RQMC with domain transformation provides accurate and scalable Fourier pricing for multi-asset options.
Random Fourier features classification achieves fast learning rates with fewer features.
problem Improving classification efficiency with fewer features.
method Utilizing Lipschitz continuous loss functions and regularity conditions, the study reduces the number of features required for classification.
result Random Fourier features classification can achieve learning rate with only features.
In this paper we propose a scalable version of a state-of-the-art deterministic time-invariant feature extraction approach based on consecutive changes of basis and nonlinearities, namely, the scattering network. The first focus of the paper is to extend the scattering network to allow the use of higher order nonlinear…
Scalable kernel methods for large datasets using Fourier representations and NUFFT.
problem Cubic complexity in kernel methods limits their use on large-scale datasets.
method Fourier representation of kernels combined with NUFFT for O(n log n) complexity.
result Achieves minimax convergence rates and processes up to tens of billions of samples.
Analytical pricing formulas and Greeks are obtained for European and American basket put options using Mellin transforms. We assume assets are driven by geometric Brownian motion which exhibit correlation and pay a continuous dividend rate. A novel approach to numerical Mellin inversion is achieved via the fast Fourier…
Quantum algorithm for pricing European call options.
problem Accurate valuation of financial derivatives, especially for complex models and options.
method Transforms classical FFT into quantum QFT for pricing European call options.
result Quantum algorithm outperforms classical Monte Carlo simulation in NISQ era.
In this paper, we derive the price of a European call option of an asset following a normal process assuming stochastic volatility. The volatility is assumed to follow the Cox Ingersoll Ross (CIR) process. We then use the fast Fourier transform (FFT) to evaluate the option price given we know the characteristic functio…
Constructing fast approximate eigenspaces with application to the fast graph Fourier transformscs.LG
Efficiently approximates eigenspaces for symmetric and general matrices.
problem Fast computation of eigenspaces for large matrices.
method Factor eigenspaces into fundamental components using transformations, solve minimization problems, and iteratively update.
result Improved computational efficiency for eigenspace approximation.
Integrates Fourier features for faster Gaussian process regression.
problem Efficiently scaling Gaussian process regression to large datasets.
method Integrated Fourier features for Gaussian processes.
result Improves Gaussian process regression speed to for a broad class of kernels.
Many theories of deep learning have shown that a deep network can require dramatically fewer resources to represent a given function compared to a shallow network. But a question remains: can these efficient representations be learned using current deep learning techniques? In this work, we test whether standard deep l…
DAFNO learns surrogates for complex systems on irregular geometries.
problem Learning accurate surrogates for complex physical systems on irregular geometries.
method DAFNO incorporates a smoothed characteristic function in the integral layer architecture of FNOs, leveraging FFT for rapid computations.
result DAFNO achieves state-of-the-art accuracy on material modeling and airfoil simulation datasets.
Many neural speech enhancement and source separation systems operate in the time-frequency domain. Such models often benefit from making their Short-Time Fourier Transform (STFT) front-ends trainable. In current literature, these are implemented as large Discrete Fourier Transform matrices; which are prohibitively inef…
New method for European option pricing faster and more robust.
problem Pricing European options efficiently and accurately.
method Fourier cosine series expansions for models with known characteristic functions.
result More robust and faster than the original COS method.
Improved barrier option pricing in Heston model using COS-BEM method.
problem Efficient barrier option pricing in the Heston model.
method Combining Fourier-cosine series (COS) method with Boundary Element Method (BEM).
result Significant computational efficiency improvement and BEM attractiveness for practitioners.
A hybrid framework uses machine learning to price options faster and more accurately.
problem Rapid recalibration of option pricing models in dynamic markets.
method Integrates smooth offset algorithm with supervised machine learning models.
result Surrogate pricing operators achieve up to 1000x speedup over direct SOA evaluation.
Stochastic optimal transport in Banach Spaces for regularized estimation of multivariate quantilesmath.PR
New algorithm for estimating multivariate quantiles using stochastic optimal transport.
problem Estimating multivariate quantiles from data.
method Stochastic algorithm for entropic optimal transport in Banach spaces, using Fourier coefficients.
result Almost sure convergence of the stochastic algorithm in infinite-dimensional Banach spaces.
We propose a new method for the numerical solution of backward stochastic differential equations (BSDEs) which finds its roots in Fourier analysis. The method consists of an Euler time discretization of the BSDE with certain conditional expectations expressed in terms of Fourier transforms and computed using the fast F…
We present a new algorithm for the 2D Sliding Window Discrete Fourier Transform (SWDFT). Our algorithm avoids repeating calculations in overlapping windows by storing them in a tree data-structure based on the ideas of the Cooley- Tukey Fast Fourier Transform (FFT). For an array and wi…
The paper introduces a new volatility model using Fourier techniques for pricing and hedging.
problem Pricing and hedging of financial derivatives with stochastic volatility.
method A Fourier-based approach to price and hedge European and path-dependent options in a stochastic volatility model.
result The model includes and extends popular volatility models like Stein-Stein, Bergomi, and Heston.
Monotone 2D Integration Scheme for Mean-CVaR Optimization via Fourier-Trained Transition Kernelsmath.OC
New method for optimizing risk in financial models using Fourier transforms.
problem Optimizing risk in financial models with multi-period mean-CVaR.
method Strictly monotone 2D integration scheme via Fourier-trained transition kernels.
result Established robust and accurate optimization method for financial models.
Fourier methods fail to accurately approximate option Greeks in realistic market conditions.
problem Failure of Fourier pricing techniques to approximate Greeks in realistic market parameters.
method Used Fourier techniques like Carr-Madan formula, COS method, and Lewis formula to approximate Greeks, which failed in some market conditions.
result Empirically showed that Fourier methods completely fail to approximate Greeks in realistic market environments.
In this paper we show that the computational complexity of the Iterative Thresholding and K-residual-Means (ITKrM) algorithm for dictionary learning can be significantly reduced by using dimensionality-reduction techniques based on the Johnson-Lindenstrauss lemma. The dimensionality reduction is efficiently carried out…
Spread options are a fundamental class of derivative contract written on multiple assets, and are widely used in a range of financial markets. There is a long history of approximation methods for computing such products, but as yet there is no preferred approach that is accurate, efficient and flexible enough to apply …
Random Fourier features improve tabular deep learning convergence.
problem Tabular deep learning convergence issues.
method Random Fourier projections as a pre-processing step, projecting inputs into a fixed feature space.
result Random Fourier pre-processing accelerates tabular deep learning convergence.
Improved graph-based multiclass classification for multilayer data.
problem Efficient classification of multilayer data with limited labeled examples.
method Generalized diffuse interface methods applied to multilayer graphs, using spectral decomposition and fast matrix-vector products.
result Highly scalable and efficient classification for large, high-dimensional data sets.
We offer new formulas for European option pricing under tempered stable processes.
problem Pricing European options under tempered stable processes.
method Series expansions for tempered stable densities and European option prices.
result Our formulas are hyperparameter-free and competitive with traditional methods.
This work develops fast and accurate ROMs for AM models using OL methods.
problem Achieving specific material properties in AM by manipulating process parameters increases computational load.
method Operator learning (OL) approach with Fourier neural operator (FNO) and DeepONet.
result OL methods offer comparable performance and outperform DNN in accuracy and generalizability.
Fast simulates Volterra processes using RFF, focusing on S-fBM.
problem Efficiently simulate Volterra processes for fractional Brownian motion.
method Random Fourier Features (RFF) approximation of kernel, spectral representation, Hamiltonian Monte Carlo sampling.
result Quantitative guarantees for RFF approximation, competitive in terms of efficiency and error.
Improved numerical solution for BSDEs with reduced boundary errors.
problem Boundary errors in numerical solution of BSDEs.
method Modified damping and shifting schemes to transform target function into a bounded periodic function, applying Fourier transforms.
result Significant reduction in boundary errors with improved accuracy and convergence.
New quantization methods improve accuracy of Random Fourier Features.
problem Improving accuracy of Random Fourier Features for machine learning.
method Sigma-Delta and distributed noise-shaping quantization methods for 1-bit and low bit-depth quantization.
result Quantized RFFs allow high accuracy approximation of underlying kernels with polynomial error decay.
We compare the CPU effort and pricing biases of seven Fourier-based implementations. Our analyses show that truncation and discretization errors significantly increase as we move away from the Black-Scholes-Merton framework. We rank the speed and accuracy of the competing choices, showing which methods require smaller …
The convolution method for the numerical solution of forward-backward stochastic differential equations (FBSDEs), introduced in [21], uses a uniform space grid. In this paper we utilize a tree-like spatial discretization that approximates the BSDE on the tree, so that no spatial interpolation procedure is necessary. In…
New neural network improves MRI reconstruction for non-Cartesian data.
problem Improving MRI reconstruction for non-Cartesian data acquisitions.
method Density-compensated unrolled neural networks.
result Density-compensated unrolled neural networks outperform baselines.
New analysis proves sketching operators' RIP guarantees for mixture models without importance sampling.
problem Proving sketching operators' Restricted Isometry Property (RIP) for mixture models without assuming importance sampling.
method Proposed alternative analysis based on new deterministic bounds and concentration inequalities.
result Theoretical guarantees for sketching operators without importance sampling.
Robust, Nonparametric, Efficient Decomposition of Spectral Peaks under Distortion and Interferenceeess.SP
A robust method for decomposing spectral peaks robust to distortion and interference.
problem Decomposing spectral peaks in the presence of distortion and interference.
method Optimizing a nonparametric approach using pseudo-symmetric functions with nonincreasing behavior.
result Decomposed spectral peaks show pseudo-orthogonal behavior and power preserving equality.
We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained …
This paper extends the Singular Fourier--Padé (SFP) method proposed by Chan (2018) to pricing/hedging early-exercise options--Bermudan, American and discrete-monitored barrier options--under a Lévy process. The current SFP method is incorporated with the Filon--Clenshaw--Curtis (FCC) rules invented by Domínguez et al. …
Fluctuation identities with continuous monitoring and their application to price barrier optionsq-fin.CP
We present a numerical scheme to calculate fluctuation identities for exponential Lévy processes in the continuous monitoring case. This includes the Spitzer identities for touching a single upper or lower barrier, and the more difficult case of the two-barriers exit problem. These identities are given in the Fourier-L…
This paper proposes a novel framework to regularize the highly ill-posed and non-linear Fourier ptychography problem using generative models. We demonstrate experimentally that our proposed algorithm, Deep Ptych, outperforms the existing Fourier ptychography techniques, in terms of quality of reconstruction and robustn…
An Efficient Calibration Framework for Volatility Derivatives under Rough Volatility with Jumpsq-fin.CP
A fast calibration method for rough volatility models with jumps.
problem Calibrating stochastic volatility models to market data efficiently.
method Structure-preserving approach: split pricing formula, precompute data-independent integrals, and approximate market-dependent remainder with neural networks.
result Calibration achieves high accuracy and speed, and a pure-jump rough volatility model adequately captures VIX dynamics.