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,657 papers · 148 categories

Trend · papers per month

19385675 · Jun 202019922001200920172026
48 results for FFT acceleration

Efficiently accelerates attention calculation for Transformers with relative positional encoding.

problem Quadratic complexity of attention in long sequences.
method Kernelized attention with Fast Fourier Transform (FFT) for RPE.
result Achieves O(n log n) time complexity, mitigates training instability, and outperforms other models.

New MCMC method speeds up quantum physics simulations by a factor of 100.

problem Simulating quantum many-body systems with high computational complexity.
method FFT-accelerated MCMC with coupled particle and auxiliary variables.
result Achieves O(NlogN)O(N \log N) scaling, significantly faster than traditional O(N3)O(N^3) methods.

The rough Heston model emerges from scaling bivariate INAR processes, linking microstructure to option pricing.

problem Modeling and pricing financial options with heavy-tailed and cumulative processes.
method Scaling limit of bivariate INAR processes converging to rough Heston model, explicit formulas linking asymmetry parameters to volatility.
result Weak-error estimates and FFT-accelerated simulation for European and path-dependent options.

Deep learning has delivered its powerfulness in many application domains, especially in image and speech recognition. As the backbone of deep learning, deep neural networks (DNNs) consist of multiple layers of various types with hundreds to thousands of neurons. Embedded platforms are now becoming essential for deep le…

2017-12-13abs ↗pdf ↗

Paper extends FFT-based differential privacy method to heterogeneous compositions.

problem Computing accurate differential privacy guarantees for mixed mechanisms.
method Uses Fast Fourier Transform (FFT) for error analysis and parameter selection.
result Provides tighter bounds for heterogeneous compositions compared to homogeneous cases.

New algorithms compute Volterra signature efficiently for time series analysis.

problem Efficient computation of Volterra signature with matrix-valued kernels.
method Decomposed Chen-type convolution relation, introduced FFT-based and exact recursion algorithms.
result Efficient algorithms for Volterra signature computation with various complexities.

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.

In the Lagrangian approach to 2-dimensional sigma models, B-fields and D-branes contribute topological terms to the action of worldsheets of both open and closed strings. We show that these terms naturally fit into a 2-dimensional, smooth open-closed functorial field theory (FFT) in the sense of Atiyah, Segal, and Stol…

2019-11-22abs ↗pdf ↗

We discuss various analytic and numerical methods that have been used to get option prices within a framework of the VG model. We show that some popular methods, for instance, Carr-Madan's FFT method could blow up for certain values of the model parameters even for an European vanilla option. Alternative methods - one …

2005-03-16abs ↗pdf ↗

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.

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.

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 …

2017-06-19abs ↗pdf ↗

A new FFT-based method for fast rigid alignment of 2D closed curves.

problem Rigid alignment of 2D closed curves with application to shape analysis.
method FFT-based algorithm for optimal rigid alignment of closed curves with O(N log N) complexity.
result Order of magnitude speed-up in curve alignment compared to previous methods.

The paper prices energy spread options using a complex stochastic model.

problem Pricing energy spread options with specific stochastic dynamics.
method Uses an exponential Ornstein-Uhlenbeck process driven by variance gamma processes, applying the Esscher transform and FFT method.
result Derives an analytical formula for pricing forwards and spread options.

This work introduces 'Artificial Entanglement' to understand LLMs' fine-tuning effectiveness.

problem Understanding the effectiveness of parameter-efficient fine-tuning methods for large language models.
method Adopting a quantum-information-inspired perspective, the study measures 'Artificial Entanglement' in neural networks.
result LoRA and FFT induce distinct internal entanglement signatures but not external ones, suggesting a 'no-hair' property.

A new FFT-based method simplifies causal structure recovery for linear dynamical systems.

problem Efficiently identifying dynamic causal effects from time-series data.
method FFT-based approach to reduce computational complexity to O(Tn3logN)O(Tn^3 \log N).
result Significant computational advantage for graph reconstruction.

The paper improves privacy accounting for discrete-valued mechanisms and the subsampled Gaussian mechanism.

problem Improving the accuracy and efficiency of differential privacy accounting for discrete outputs.
method Uses fast Fourier transform (FFT) for rigorous error analysis and accounting of privacy loss.
result Provides strict lower and upper bounds for (ε,δ)(\varepsilon,δ)-values, demonstrating up to 75% reduction in noise variance.

New simulation technique speeds up Lévy-driven OU process pricing.

problem Inefficient Monte Carlo simulations of Lévy-driven OU processes.
method Numerical inversion of characteristic function combined with FFT for fast and accurate simulations.
result The proposed technique is at least one order of magnitude faster than existing methods.

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…

2019-09-17abs ↗pdf ↗

In this paper, we present a reverberation removal approach for speaker verification, utilizing dual-label deep neural networks (DNNs). The networks perform feature mapping between the spectral features of reverberant and clean speech. Long short term memory recurrent neural networks (LSTMs) are trained to map corrupted…

2018-09-08abs ↗pdf ↗

Local laGPR speeds up multiscale mechanics simulations without neural networks.

problem High computational costs in multiscale mechanics simulations.
method Local approximate Gaussian process regression (laGPR) combined with FE schemes.
result laGPR offers better accuracy than neural networks for stress predictions.

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 N0×N1N_0 \times N_1 array and n0×n1n_0 \times n_1 wi…

2017-07-25abs ↗pdf ↗

SKI speeds up Toeplitz Neural Networks by avoiding explicit decay bias and using frequency response.

problem Efficiently compute and update Toeplitz matrices in neural networks.
method Sparse plus low-rank decomposition, asymmetric SKI, frequency response modeling.
result Achieved significant speedup with minimal performance loss.

In image deconvolution problems, the diagonalization of the underlying operators by means of the FFT usually yields very large speedups. When there are incomplete observations (e.g., in the case of unknown boundaries), standard deconvolution techniques normally involve non-diagonalizable operators, resulting in rather …

2016-02-03abs ↗pdf ↗

FastSecAgg improves federated learning security and efficiency.

problem Privacy leakage in federated learning due to model parameter sharing.
method Introduces FastSecAgg, a secure aggregation protocol with FFT-based multi-secret sharing (FastShare).
result Efficient in computation and communication, robust to client dropouts.

This paper computes exact posterior distributions of mixture weights in hierarchical Bayesian models.

problem Uncertainty in class membership or data-generating processes in heterogeneous data.
method Exact marginalization of mixture weights using dynamic programming and FFT for two components, and joint dynamic program for K >= 3 components.
result Exact posterior distributions of mixture weights are finite mixtures of Beta distributions, providing credible intervals and per-observation local false-discovery rates.

The Heston model stands out from the class of stochastic volatility (SV) models mainly for two reasons. Firstly, the process for the volatility is non-negative and mean-reverting, which is what we observe in the markets. Secondly, there exists a fast and easily implemented semi-analytical solution for European options.…

2010-10-08abs ↗pdf ↗

Improved SVM classification with interpretable features from scattered data.

problem Classification of scattered data points in high-dimensional spaces.
method Truncated ANOVA decomposition for sparse feature selection; use of trigonometric or wavelet feature maps.
result Better classification accuracy and interpretability with 1\ell_1-norm regularization.

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.

PF-LaCG removes the need for knowing smoothness and strong convexity parameters for locally accelerated CG.

problem Locally accelerated CG requires knowledge of smoothness and strong convexity parameters.
method Parameter-Free Locally Accelerated CG (PF-LaCG) algorithm.
result PF-LaCG achieves local acceleration without requiring knowledge of smoothness and strong convexity parameters.

In a range of fields including the geosciences, molecular biology, robotics and computer vision, one encounters problems that involve random variables on manifolds. Currently, there is a lack of flexible probabilistic models on manifolds that are fast and easy to train. We define an extremely flexible class of exponent…

2015-05-17abs ↗pdf ↗

Continuized Nesterov acceleration accelerates stochastic gradient descent and gossip algorithms.

problem Improving the convergence rate of stochastic gradient descent and gossip algorithms.
method Introducing a continuized variant of Nesterov acceleration, which mixes variables continuously and takes gradient steps at random times.
result The continuized Nesterov acceleration achieves convergence rates similar to Nesterov's original acceleration but with random parameters.

Accelerated gradient methods play a central role in optimization, achieving optimal rates in many settings. While many generalizations and extensions of Nesterov's original acceleration method have been proposed, it is not yet clear what is the natural scope of the acceleration concept. In this paper, we study accelera…

2016-03-14abs ↗pdf ↗