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

3867711,1571,542 · Jun 202019922001200920172026
48 results for pathwise learning

This work proposes using zero-variance control variates to reduce variance in pathwise gradient estimators for variational inference.

problem Pathwise gradient estimators in variational inference have high variance, leading to inefficient optimization.
method Apply zero-variance control variates to pathwise gradient estimators.
result Zero-variance control variates can significantly reduce the variance of pathwise gradient estimators without requiring complex assumptions.

We consider a strictly pathwise setting for Delta hedging exotic options, based on Föllmer's pathwise Itō calculus. Price trajectories are dd-dimensional continuous functions whose pathwise quadratic variations and covariations are determined by a given local volatility matrix. The existence of Delta hedging strategie…

2015-10-30abs ↗pdf ↗

Develops portfolio theory without probabilistic analysis, focusing on pathwise decomposition.

problem Ensuring market viability without probabilistic assumptions.
method Uses pathwise decomposition and trend extractors to replace semimartingale decomposition.
result Growth-numéraire and viability equivalences are similar but not identical in pathwise setting.

A new approach to continuous-time universal portfolios using pathwise Itô calculus.

problem Continuous-time version of Cover's universal portfolio strategies.
method Pathwise Itô calculus approach to establish existence and properties of universal portfolio strategies.
result The universal portfolio strategy's portfolio value process is the average of all values of constant rebalanced strategies.

This work introduces efficient sampling methods for Gaussian processes by focusing on pathwise conditioning.

problem Intractable mathematical expressions in Gaussian process posteriors limit practical applications.
method Investigates a pathwise interpretation of conditioning to derive efficient sampling methods.
result Derives a general family of approximations that allow for efficient sampling of Gaussian process posteriors.

We use pathwise Itô calculus to prove two strictly pathwise versions of the master formula in Fernholz' stochastic portfolio theory. Our first version is set within the framework of Föllmer's pathwise Itô calculus and works for portfolios generated from functions that may depend on the current states of the market port…

2016-06-10abs ↗pdf ↗

Efficient estimators for smooth Hilbert-valued parameters with theoretical guarantees.

problem Estimating smooth Hilbert-valued parameters with theoretical guarantees.
method Pathwise differentiable Hilbert-valued parameters, efficient influence functions, regularized one-step estimators.
result Theoretical guarantees for efficient estimators even when nuisance functions are arbitrary.

The paper optimizes bridge-type estimators for sparse models using pathwise methods.

problem Sparse parametric models with adaptive coefficients and multiple penalties.
method Pathwise optimization with accelerated proximal gradient descent and blockwise alternating optimization.
result Efficient computation of the full solution path for adaptive bridge estimators.

This paper develops a mathematical framework for the analysis of continuous-time trading strategies which, in contrast to the classical setting of continuous-time mathematical finance, does not rely on stochastic integrals or other probabilistic notions. Our purely analytic framework allows for the derivation of a path…

2016-02-16abs ↗pdf ↗

This paper simplifies hedge ratios in financial models using pathwise algorithmic differentiation.

problem Expensive and unstable computation of hedge ratios from pathwise sensitivities.
method Develops reduced stochastic hedge ratios of the form φ_j^r = Σ_j^r ξ_j^q X_q, retaining sensitivity tensor through empirical averages.
result Two coefficient criteria are introduced to minimize pathwise residuals and satisfy moment equations.

The Monte Carlo pathwise sensitivities approach is well established for smooth payoff functions. In this work, we present a new Monte Carlo algorithm that is able to calculate the pathwise sensitivities for discontinuous payoff functions. Our main tool is to combine the one-step survival idea of Glasserman and Staum wi…

2018-04-11abs ↗pdf ↗

This paper gives several simple constructions of the pathwise Ito integral 0tφdω\int_0^tφdω for an integrand φφ and a price path ωω as integrator, with φφ and ωω satisfying various topological and analytical conditions. The definitions are purely pathwise in that neither φφ nor ωω are assumed to be paths of stochast…

2015-12-05abs ↗pdf ↗

This dissertation advances scalable Gaussian processes using iterative methods and pathwise conditioning.

problem The classical Gaussian process formulation is not scalable for large datasets and modern hardware.
method Combining iterative methods and pathwise conditioning to improve scalability.
result Significantly reduced memory requirements and facilitated application to larger datasets.

MuRiT efficiently computes multi-parameter persistence barcodes.

problem Efficient computation of multi-parameter persistent homology.
method Vietoris-Rips transformation to reduce multi-parameter to single-parameter computation.
result MuRiT computes pathwise persistence barcodes for multi-filtered flag complexes.

We exploit the link between the transport equation and derivatives of expectations to construct efficient pathwise gradient estimators for multivariate distributions. We focus on two main threads. First, we use null solutions of the transport equation to construct adaptive control variates that can be used to construct…

2018-06-05abs ↗pdf ↗

Picasso is a new library for sparse learning problems in R and Python.

problem Sparse learning problems in high-dimensional data analysis.
method Unified framework of pathwise coordinate optimization with efficient active set selection strategies.
result picasso can efficiently handle large-scale problems.

We study the use of the multilevel Monte Carlo technique in the context of the calculation of Greeks. The pathwise sensitivity analysis differentiates the path evolution and reduces the payoff's smoothness. This leads to new challenges: the inapplicability of pathwise sensitivities to non-Lipschitz payoffs often makes …

2011-02-07abs ↗pdf ↗

We observe that gradients computed via the reparameterization trick are in direct correspondence with solutions of the transport equation in the formalism of optimal transport. We use this perspective to compute (approximate) pathwise gradients for probability distributions not directly amenable to the reparameterizati…

2018-06-05abs ↗pdf ↗

Study shows how market firm capitalization models converge to stochastic PDE solutions.

problem Understanding convergence of rank-based models with common noise to stochastic PDE solutions.
method Analysis of mean field limit, martingale problem, and pathwise entropy solutions.
result Empirical cumulative distribution function converges to solution of a stochastic PDE under certain conditions.

Following a hedging based approach to model free financial mathematics, we prove that it should be possible to make an arbitrarily large profit by investing in those one-dimensional paths which do not possess local times. The local time is constructed from discrete approximations, and it is shown that it is αα-Hölder …

2014-05-17abs ↗pdf ↗

Exact simulation method for market impact estimation under various execution strategies.

problem Estimating market impact from observed price trajectories under different execution strategies.
method Conditional simulation of point processes under perturbed intensities.
result Exact, event-driven algorithm for reconstructing counterfactual paths.

NM-PPG optimizes adaptive feature acquisition in POMDPs for better predictions.

problem Optimizing adaptive feature acquisition in prediction problems with costly features.
method Non-myopic pathwise policy gradients (NM-PPG) with continuous relaxation and straight-through rollout.
result NM-PPG outperforms state-of-the-art AFA methods on synthetic and real-world datasets.

New method reduces errors in pricing and sensitivities for discontinuous payoffs.

problem Errors in pricing and sensitivities for discontinuous payoffs in digital and barrier options.
method Alternative methods for estimating sensitivities, including likelihood ratio and hybrid methods.
result New methods substantially reduce test errors in prices and sensitivities.

This paper precisely estimates transformer derivatives for explicit learning guarantees.

problem Computing fully-explicit generalization bounds for transformers with precise higher-order derivative estimates.
method Analyzes and estimates all higher-order derivatives of transformers with multiple attention heads and layer normalization.
result Obtains explicit pathwise generalization bounds for transformers learning from non-i.i.d. samples.

Develops a method for solving optimal stopping problems with multiple exercise rights.

problem Optimal stopping with multiple exercise rights under model uncertainty.
method Pathwise duality approach based on robust martingale dual representation.
result Establishes upper and lower bounds that converge to the true solution.

We provide a unifying treatment of pathwise moderate deviations for models commonly used in financial applications, and for related integrated functionals. Suitable scaling allows us to transfer these results into small-time, large-time and tail asymptotics for diffusions, as well as for option prices and realised vari…

2018-03-12abs ↗pdf ↗

A new reinforcement learning method uses model derivatives to improve policy optimization.

problem Improving sample efficiency and performance in model-based reinforcement learning.
method Constructs an actor-critic algorithm that uses the pathwise derivative of the learned model and policy.
result Consistently more sample efficient and matches model-free algorithms' asymptotic performance.

Develops a fast algorithm for high-dimensional LASSO penalized quantile regression.

problem Computational challenges in high-dimensional 1\ell_1 penalized quantile regression.
method Pathwise coordinate descent algorithm to solve exact coordinatewise minimum of the nonsmooth loss function.
result Algorithm runs faster than existing alternatives and maintains estimation accuracy.

Quantum machine learning solves high-dimensional PDEs with lower variance and improved accuracy.

problem Approximating solutions to high-dimensional parabolic PDEs.
method Pure Variational Quantum Circuit (VQC) for BSDE approximation, using temporal discretization and Monte Carlo simulation.
result VQC achieves lower variance and improved accuracy in most cases, particularly in highly nonlinear regimes.

The paper proves signatures of non-geometric rough paths can approximate functionals uniformly.

problem Approximating functionals of non-geometric rough paths.
method Extending rough paths with time and quadratic variation terms, proving uniform approximation.
result Linear functionals of extended signatures uniformly approximate continuous functionals.

In this paper we provide a pricing-hedging duality for the model-independent superhedging price with respect to a prediction set ΞC[0,T]Ξ\subseteq C[0,T], where the superhedging property needs to hold pathwise, but only for paths lying in ΞΞ. For any Borel measurable claim ξξ which is bounded from below, the superhedging …

2017-11-07abs ↗pdf ↗

Consider a family of portfolio strategies with the aim of achieving the asymptotic growth rate of the best one. The idea behind Cover's universal portfolio is to build a wealth-weighted average which can be viewed as a buy-and-hold portfolio of portfolios. When an optimal portfolio exists, the wealth-weighted average c…

2015-10-09abs ↗pdf ↗

A scalable method for BED with implicit models using approximate gradients.

problem Efficiently estimating posterior distribution and maximizing MI for implicit models.
method Stochastic approximate gradient ascent with smoothed variational MI estimator.
result Significantly improves scalability of BED in high-dimensional problems.

Estimates roughness of volatility from discrete variance data.

problem Estimating roughness exponent of stochastic volatility from discrete observations of integrated variance.
method Pathwise estimator based on fractional Brownian motion with drift.
result Strong consistency theorems for rough volatility models.

Almost twenty years ago, E.R. Fernholz introduced portfolio generating functions which can be used to construct a variety of portfolios, solely in the terms of the individual companies' market weights. I. Karatzas and J. Ruf recently developed another methodology for the functional construction of portfolios, which lea…

2018-09-26abs ↗pdf ↗

The paper discovers the family of identically-derived Euclidean one-parameter even-dimensional differential linear operators with unique eigenproperties, which prove to be inherently related to the emergent characterizations of fundamental building blocks of embedded minimal surfaces and the Nitsche conjecture proof.

2019-02-06abs ↗pdf ↗