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

35810 · May 202619922001200920172026
48 results for pathwise barcodes

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 propose to study neural networks' loss surfaces by methods of topological data analysis. We suggest to apply barcodes of Morse complexes to explore topology of loss surfaces. An algorithm for calculations of the loss function's barcodes of local minima is described. We have conducted experiments for calculating barc…

2019-11-29abs ↗pdf ↗

We define notions of differentiability for maps from and to the space of persistence barcodes. Inspired by the theory of diffeological spaces, the proposed framework uses lifts to the space of ordered barcodes, from which derivatives can be computed. The two derived notions of differentiability (respectively from and t…

2019-10-02abs ↗pdf ↗

Quantum-enhanced barcode decoding and pattern recognition outperforms classical methods.

problem Improving barcode decoding and pattern recognition using quantum entanglement.
method Quantum hypothesis testing applied to barcode decoding and pattern recognition using entangled quantum sources and measurements.
result Quantum-enhanced methods outperform classical coherent-state strategies for barcode data decoding and classification.

We introduce a new feature map for barcodes that arise in persistent homology computation. The main idea is to first realize each barcode as a path in a convenient vector space, and to then compute its path signature which takes values in the tensor algebra of that vector space. The composition of these two operations …

2018-06-01abs ↗pdf ↗

Paper introduces stable vectorization for multiparameter PH using signed barcodes.

problem Lack of stable vectorization methods for multiparameter persistent homology.
method Signed barcodes as measures for stable vectorization of MPH.
result Stable feature vectors from signed barcodes improve performance in data science.

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 ↗

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.

Homotopy types of Vietoris-Rips metric thickenings of the circle confirmed.

problem Understanding the homotopy types of Vietoris-Rips metric thickenings of the circle.
method Finding quotients of the metric thickenings that preserve homotopy type and showing that the quotient spaces can be described as CW complexes.
result The Vietoris-Rips metric thickenings of the circle are homotopy equivalent to odd-dimensional spheres at the expected scale parameters.

Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.

problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.

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.

We consider different notions of equivalence for Morse functions on the sphere in the context of persistent homology, and introduce new invariants to study these equivalence classes. These new invariants are as simple, but more discerning than existing topological invariants, such as persistence barcodes and Reeb graph…

2019-09-23abs ↗pdf ↗

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.

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 ↗

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.

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 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 ↗

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 ↗

Symplectic homology matches dual capacities for convex domains.

problem Understanding symplectic capacities and Reeb flows on convex domains.
method Isomorphic filtered symplectic homology to dual singular homology.
result Gutt-Hutchings capacities match spectral invariants for convex domains.

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.

Floer theory constructs filtrations on quantum cohomology for symplectic manifolds.

problem Quantum cohomology of symplectic manifolds with C\mathbb{C}^*-actions.
method Floer theory applied to C\mathbb{C}^*-actions on symplectic manifolds.
result Constructs a family of filtrations on quantum cohomology for Conical Symplectic Resolutions.

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.

We apply the barcodes of persistent homology theory to the Chekanov-Eliashberg algebra of a Legendrian submanifold to deduce displacement energy bounds for arbitrary Legendrians. We do not require the full Chekanov-Eliashberg algebra to admit an augmentation as we linearize the algebra only below a certain action level…

2018-10-24abs ↗pdf ↗

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.

Detection of rare variants by resequencing is important for the identification of individuals carrying disease variants. Rapid sequencing by new technologies enables low-cost resequencing of target regions, although it is still prohibitive to test more than a few individuals. In order to improve cost trade-offs, it has…

2009-09-02abs ↗pdf ↗

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 ↗

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.