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

51102152203 · May 202619922001200920172026
48 results for Path variance

We solve the paradox of score-based methods by minimizing path variance.

problem Score-based methods are path-dependent, leading to inaccurate and unstable estimators.
method Propose MVP Principle to minimize path variance, derive closed-form expression, and use flexible Kumaraswamy Mixture Model.
result Establishes new state-of-the-art results on challenging benchmarks.

The paper calculates sensitivities for financial derivatives using path weighting methods.

problem Computing sensitivities for path-dependent financial derivatives with high variance and degeneracy issues.
method Proposes explicit path weighting formula, variance reduction adjustment, and covariance inflation technique.
result Effective methods to address high variance and degeneracy in sensitivities computation.

Path-dependent PDEs model VIX and Realised Variance options.

problem Modeling volatility derivatives with path-dependence.
method Continuous stochastic volatility model with Gaussian Volterra process, proving well-posedness of PDEs.
result Formulae for greeks and implied volatility provided, finite-dimensional pricing PDEs obtained in Markovian models.

A variance swap is a derivative with a path-dependent payoff which allows investors to take positions on the future variability of an asset. In the idealised setting of a continuously monitored variance swap written on an asset with continuous paths it is well known that the variance swap payoff can be replicated exact…

2011-04-20abs ↗pdf ↗

We develop generic and efficient importance sampling estimators for Monte Carlo evaluation of prices of single- and multi-asset European and path-dependent options in asset price models driven by Lévy processes, extending earlier works which focused on the Black-Scholes and continuous stochastic volatility models. Usin…

2016-08-16abs ↗pdf ↗

A new path gradient estimator speeds up normalizing flows without sacrificing accuracy.

problem High computational cost and limited scalability of path gradient estimators for normalizing flows.
method Proposed a fast path gradient estimator that improves computational efficiency and scalability.
result The new estimator achieves superior performance and reduced variance across various applications.

New method for portfolio management learns from past wealth evolution.

problem Optimizing portfolio selection based on past performance.
method Simulated annealing clustering for asset selection, considering past wealth evolution.
result Strategy effectively learns from past performance and performs well in practice.

Model-free expression for SSR derived in terms of characteristic function.

problem Calculating the skew-stickiness-ratio (SSR) in financial markets.
method Model-free expression using characteristic function, focusing on diffusion and affine forward variance cases.
result General formula for SSR simplifies and becomes particularly tractable in affine forward variance cases, with a limit of H+3/2H+3/2 for short-term limit.

The paper proves a regret bound for a sub-Gaussian mixture on unbounded data.

problem Tackles the challenge of achieving regret bounds for sub-Gaussian mixtures on unbounded data.
method Uses path-wise (deterministic) regret bounds and a cumulative variance process to derive the bound.
result Shows that on a specific event, the regret is eventually bounded by ln(ln V_T).

New algorithms reduce regret in online MDPs by adapting to data and variance.

problem Adapting to both adversarial and stochastic environments in online MDPs.
method Develops algorithms based on global optimization and policy optimization, using optimistic follow-the-regularized-leader with log-barrier regularization.
result Achieves refined data-dependent and variance-dependent regret bounds.

This paper investigates the use of multiple directions of stratification as a variance reduction technique for Monte Carlo simulations of path-dependent options driven by Gaussian vectors. The precision of the method depends on the choice of the directions of stratification and the allocation rule within each strata. S…

2010-04-28abs ↗pdf ↗

A new method for portfolio optimization using signature signatures to incorporate path-dependencies.

problem Traditional portfolio optimization models struggle with path-dependencies and exogenous signals.
method Signature Trading framework using rough path signatures to represent trading strategies.
result Efficient incorporation of exogenous signals and drawdown control in optimal strategies.

Improved KL divergence estimators for normalizing flows lead to faster convergence and better approximations.

problem Estimating KL divergences for normalizing flows efficiently and accurately.
method Path-gradient estimators for reverse and forward KL divergences.
result Path-gradient estimators lead to faster convergence and better approximation results.

In this paper, we introduce a new approach to constructing unbiased estimators when computing expectations of path functionals associated with stochastic differential equations (SDEs). Our randomization idea is closely related to multi-level Monte Carlo and provides a simple mechanism for constructing a finite variance…

2012-07-10abs ↗pdf ↗

Bias - variance decomposition of the expected error defined for regression and classification problems is an important tool to study and compare different algorithms, to find the best areas for their application. Here the decomposition is introduced for the survival analysis problem. In our experiments, we study bias -…

2011-09-24abs ↗pdf ↗

Improves inference-time alignment for diffusion models without updating weights.

problem Aligning diffusion models without updating weights for high-reward outputs.
method Trust-Region Iterative Twisted Sequential Monte Carlo (TRI-TSMC) for variance reduction and efficiency.
result Improves primary alignment objectives on text generation tasks.

The study examines insurance demand under rough volatility and path-dependent shocks.

problem Optimal insurance and investment strategies under rough volatility and path-dependent shocks.
method Rough volatility model and Hawkes process with power kernel, Functional Ito formula extension.
result Individuals demand more catastrophe insurance when path-dependent effects are considered.

We introduce signature payoffs, a family of path-dependent derivatives that are given in terms of the signature of the price path of the underlying asset. We show that these derivatives are dense in the space of continuous payoffs, a result that is exploited to quickly price arbitrary continuous payoffs. This approach …

2018-09-25abs ↗pdf ↗

The paper develops a new simulation technique for estimating conditional expectations in financial models.

problem Estimating conditional expectations in financial models with expensive simulation of endogenous variables.
method Introduces a hierarchical simulation scheme with oversimplified defaults to address variance issues.
result The hierarchical simulation technique significantly improves the success of neural net regression for conditional expectation estimation.

The latest generation of volatility derivatives goes beyond variance and volatility swaps and probes our ability to price realized variance and sojourn times along bridges for the underlying stock price process. In this paper, we give an operator algebraic treatment of this problem based on Dyson expansions and moment …

2007-10-16abs ↗pdf ↗

This research develops a new model for cyber risk and insurance pricing.

problem Accurate calculation of aggregate losses in cyber insurance pricing.
method A path-based k-generation risk contagion model in a tree-shaped network structure.
result Explicit expressions for mean and variance of local loss on a single path.

New algorithm reduces regret in linear mixture SSPs without cost bounds.

problem Learning optimal paths in stochastic environments with cost constraints.
method Extended value iteration with variance-aware confidence set.
result Achieves nearly minimax optimal regret bound of O(dBK)O(dB_*\sqrt{K}).

Temporal aggregation reveals latent default correlation from monthly data.

problem Understanding effective default correlation from monthly default data.
method Temporal coarse-graining of latent default-probability paths.
result Temporal coarse-graining improves identifiability and reduces over-allocation of long-horizon fluctuations.

In this paper, we implement and test two types of market-based models for European-type options, based on the tangent Levy models proposed recently by R. Carmona and S. Nadtochiy. As a result, we obtain a method for generating Monte Carlo samples of future paths of implied volatility surfaces. These paths and the surfa…

2015-04-01abs ↗pdf ↗

Temporal coarse-graining of latent default paths explains effective correlation in corporate defaults.

problem Understanding effective default correlation in corporate defaults.
method Temporal coarse-graining of latent default-probability paths, applied to corporate default-count data.
result Temporal coarse-graining provides a scale-consistent baseline that improves identifiability and reduces over-allocation of long-horizon fluctuations.

Develops diffusion samplers for target distributions with efficient score and density estimates.

problem Estimating scores and densities for time-varying distributions.
method Sequential Monte Carlo with diffusion paths and control variates.
result Effective samplers for time-varying distributions with theoretical guarantees and practical applications.

Since Giles introduced the multilevel Monte Carlo path simulation method [18], there has been rapid development of the technique for a variety of applications in computational finance. This paper surveys the progress so far, highlights the key features in achieving a high rate of multilevel variance convergence, and su…

2012-12-06abs ↗pdf ↗

Breaks circular dependency in synthetic option pricing with a novel model.

problem Circular dependency in implied volatility limits synthetic data for machine learning and risk analysis.
method Uses a Jump-Hidden Markov Model to generate price paths and a modified Heston process to convert paths into implied volatility.
result Framework generates realistic synthetic American option prices without external calibration.

We establish several closed pricing formula for various path-independent payoffs, under an exponential Lévy model driven by the Variance Gamma process. These formulas take the form of quickly convergent series and are obtained via tools from Mellin transform theory as well as from multidimensional complex analysis. Par…

2019-12-12abs ↗pdf ↗

GH-PID uses guided harmonic paths for efficient SOT with interpretable diagnostics.

problem Efficiently solving Stochastic Optimal Transport with hard terminal distributions and soft costs.
method Guided Harmonic Path-Integral Diffusion (GH-PID) framework with low-dimensional guidance.
result GH-PID generates geometry-aware, cost-reducing trajectories that match terminal distributions.