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

162324486648 · Jun 202019922001200920172026
48 results for cumulant-generating function

We introduce the class of affine forward variance (AFV) models of which both the conventional Heston model and the rough Heston model are special cases. We show that AFV models can be characterized by the affine form of their cumulant generating function, which can be obtained as solution of a convolution Riccati equat…

2018-01-19abs ↗pdf ↗

The study optimizes bounds for comparing training and population loss.

problem Optimizing bounds for comparing training and population loss.
method Derives generic information-theoretic and PAC-Bayesian generalization bounds using convex comparator functions.
result The tightest possible bound is obtained with the comparator being the convex conjugate of the CGF of the bounding distribution.

The paper introduces a new method for detecting financial data outliers.

problem Detecting outliers in multivariate financial data.
method The approach uses the Cumulant Generating Function (CGF) to maximize projections on directions.
result The CGF maximization approach can be interpreted as an extension of principal component analysis.

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.

A new GAN loss function based on cumulant generating functions improves stability and robustness.

problem Improving the stability and performance of GANs.
method Cumulant GAN loss function based on variational R{é}nyi divergence.
result Cumulant GAN achieves linear convergence to Nash equilibrium and superior performance in image generation.

The Heston model is a popular stock price model with stochastic volatility that has found numerous applications in practice. In the present paper, we study the Riemannian distance function associated with the Heston model and obtain explicit formulas for this function using geometrical and analytical methods. Geometric…

2013-02-10abs ↗pdf ↗

We obtain a first order extension of the large deviation estimates in the Gärtner-Ellis theorem. In addition, for a given family of measures, we find a special family of functions having a similar Laplace principle expansion up to order one to that of the original family of measures. The construction of the special fam…

2014-06-14abs ↗pdf ↗

The study analyzes how machine learning classifiers' error rates decrease exponentially based on large deviations theory.

problem Understanding the convergence rate of machine learning classifiers' error probabilities.
method Large deviations theory applied to machine learning classification techniques.
result The error probability of ML classifiers converges to zero exponentially, with a rate dependent on the training set size.

Let σt(x)σ_t(x) denote the implied volatility at maturity tt for a strike K=S0extK=S_0 e^{xt}, where $x\in\bbR$ and S0S_0 is the current value of the underlying. We show that σt(x)σ_t(x) has a uniform (in xx) limit as maturity tt tends to infinity, given by the formula σ(x)=2(h(x)1/2+(h(x)x)1/2)σ_\infty(x)=\sqrt{2}(h^*(x)^{1/2}+(h^*(x)-x)^{1/2}), for…

2011-08-19abs ↗pdf ↗

New bounds derived using conditional ff-information for machine learning models.

problem Improving generalization bounds in machine learning.
method Introducing novel information-theoretic generalization bounds via conditional ff-information.
result Derives generalization bounds applicable to both bounded and unbounded loss functions.

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

problem Recovering hidden vertex correspondences in partially correlated graphs.
method Proposed partially correlated Erdős-Rényi graphs model; information-theoretic thresholds; correlated functional digraphs.
result Optimal rates for partial and exact recovery of vertex correspondences.

We investigate the position of the Buchen-Kelly density in a family of entropy maximising densities which all match European call option prices for a given maturity observed in the market. Using the Legendre transform which links the entropy function and the cumulant generating function, we show that it is both the uni…

2011-02-01abs ↗pdf ↗

We present a novel algorithm for overcomplete independent components analysis (ICA), where the number of latent sources k exceeds the dimension p of observed variables. Previous algorithms either suffer from high computational complexity or make strong assumptions about the form of the mixing matrix. Our algorithm does…

2019-01-24abs ↗pdf ↗

Paper improves PAC-Bayes bounds for various loss types.

problem Improving PAC-Bayes bounds for different types of losses.
method Introducing new high-probability PAC-Bayes bounds for bounded and general tail behaviors losses, and extending to anytime-valid bounds.
result New fast-rate and mixed-rate bounds for losses with bounded ranges, and parameter-free bounds for losses with general tail behaviors.

This paper optimizes importance sampling for rare-event options pricing under the Heston model.

problem Efficiently pricing European call options with short maturity and deep out-of-the-money strikes.
method Asymptotic importance sampling schemes leveraging the large deviation principle and state-dependent change of measure.
result Proposed IS methods achieve logarithmic efficiency in short-maturity and deep OTM regimes, significantly reducing variance.

This study provides an explicit expansion of KL divergence's gradient flow in Fisher-Rao geometry.

problem Sampling techniques struggle to traverse between modes in non-convex potential functions.
method Explicit expansion of KL divergence's gradient flow in Fisher-Rao geometry.
result The convergence rate to π is independent of the potential function.

Develops methods for selecting and estimating smooth functional coefficients in high-dimensional multivariate functional data.

problem Functional predictor selection and estimation of smooth functional coefficients in high-dimensional multivariate functional data.
method Functional group-sparse regression methods in a generic Hilbert space of infinite dimension.
result Consistency of estimation and selection (oracle property) under infinite-dimensional Hilbert spaces.

FFBO optimizes functions as inputs and outputs, improving on existing BO methods.

problem Optimizing functions as both inputs and outputs in complex systems.
method Function-on-function Gaussian process (FFGP) model with a separable operator-valued kernel, scalar upper confidence bound (UCB) acquisition function, and scalable functional gradient ascent algorithm (FGA).
result FFBO outperforms existing methods in synthetic and real-world data.

Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…

2015-01-25abs ↗pdf ↗

The Fridman function is bounded by the injectivity radius for certain hyperbolic manifolds.

problem Bounding the Fridman function for hyperbolic manifolds.
method Analyzing the relationship between the Fridman function and the injectivity radius function.
result The Fridman function is bounded above by the injectivity radius function for certain hyperbolic manifolds.

The paper proves isoparametric functions on Finsler space forms under specific conditions.

problem Understanding isoparametric functions in Finsler space forms.
method Proving transnormal functions as isoparametric functions and constructing global and local isoparametric functions using the distance function.
result Generalization of Theorem B to Finsler space forms.

Paper introduces a nonparametric functional graphical model for random functions.

problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.

Robustifies elicitable functionals to handle small distribution misspecifications.

problem Determining uniquely optimal forecasts under distributional misspecification.
method Integrates statistical robustness into elicitable functionals using Kullback-Leibler divergence.
result Robust elicitable functionals admit unique solutions at the boundary of uncertainty regions.

The paper characterizes strong Hamel functions using symmetries and proves their preservation properties.

problem Characterizing strong Hamel functions and their symmetries in Finsler spaces.
method Analyzing geodesic spray, strong dual symmetries, and strong dynamical symmetries.
result Strong Hamel functions can be characterized in terms of strong dual symmetries and strong dynamical symmetries.

Two new methods improve forecasting of functional time series data.

problem Forecasting of functional time-dependent data.
method Functional Singular Spectrum Analysis (FSFA) based forecasting methods.
result Our methods outperform existing algorithms for periodic stochastic processes.

Study stabilizers of smooth functions on surfaces, focusing on Morse-Bott functions.

problem Understanding the homotopy type of stabilizers of smooth functions on surfaces.
method Analyzing the homotopy properties of stabilizers for a specific class of smooth functions.
result The homotopy type of the connected component of the identity map of the stabilizer is completely described for Morse-Bott functions.

The paper connects convex functions to p-subharmonic functions and proves their equivalence.

problem Understanding the relationship between convex functions and p-subharmonic functions.
method Average principle, variational methods, and PDE techniques.
result Convex functions on R^n are p-subharmonic for every p > 1.

A new deep neural network tackles nonlinear functional regression with improved dimensionality reduction.

problem Nonlinear functional regression in infinite-dimensional functional data analysis.
method Functional deep neural network with adaptive kernel embedding and projection steps.
result Explicit rates of approximating nonlinear smooth functionals are derived, and the network is shown to be effective in both simulated and real datasets.

New model for network analysis using functional data.

problem Existing network models treat nodes as functions, but this paper introduces functional edges.
method Transform adjacency matrix into functional adjacency tensor, apply Tucker decomposition, regularize basis matrices, and solve tensor completion problem.
result The model effectively captures community structure and handles irregular functional edge data.

The study finds a special type of smooth function on connected sums of manifolds.

problem Finding smooth functions that are Morse on preimages of non-extrema values.
method Investigates internally Morse (I-Morse) and neat with respect to Reeb graph (N-Reeb) functions.
result Constructs an IN-Morse-Reeb function on a connected sum of given manifolds.

NeuTSFlow models continuous functions behind time series forecasting.

problem Forecasting treats time series as discrete sequences, ignoring their continuous nature.
method NeuTSFlow uses Neural Operators to learn the transition between historical and future function families.
result NeuTSFlow outperforms traditional methods in forecasting accuracy and robustness.

New spectral functionals for Dirac operators with inner fluctuations computed.

problem Spectral functionals and Dirac operators with inner fluctuations.
method Extension of spectral functionals for Dirac operators with inner fluctuations.
result Computed spectral Einstein functional for Dirac operator with inner fluctuations on even-dimensional spin manifolds.

Regularizers change the geometric properties of loss functions in neural networks.

problem Understanding how different regularizers affect the geometric properties of loss functions in neural networks.
method Examined several regularizers, including weight decay, to determine if the regularized loss function becomes Morse.
result For certain regularizers, the regularized loss function becomes Morse, indicating a change in geometric properties.