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

65131196261 · Jun 202019922001200920172026
48 results for probability path

Study of most probable paths for anisotropic Brownian motions on manifolds.

problem Characterizing paths of Brownian motions with anisotropic diffusion on manifolds.
method Using stochastic development and fiber bundle of linear frames, the study provides a comprehensive characterization of most probable paths.
result Explicit equations and integration methods for most probable paths on different geometries, including constant curvature surfaces.

The path probability of a particle undergoing stochastic motion is studied by the use of functional technique, and the general formula is derived for the path probability distribution functional. The probability of finding paths inside a tube/band, the center of which is stipulated by a given path, is analytically eval…

2016-02-13abs ↗pdf ↗

New probability path model improves flow matching forecasting performance.

problem Impact of probability path model selection on flow matching forecasting performance.
method Proposed a novel probability path model designed to improve forecasting performance.
result Our model achieves faster convergence during training and improved predictive performance compared to existing models.

Develops methods to find most probable paths on complex manifolds.

problem Identifying optimal paths for manifold-valued processes, especially those with non-trivial structures.
method Constructs a general approach to defining and identifying most probable paths by measuring the Onsager-Machlup function on the anti-development of such processes.
result Derives explicit equations for development most probable paths that encompass various manifold-valued processes.

Flow Matching enables robust training of CNFs with various probability paths.

problem Training Continuous Normalizing Flows (CNFs) at large scales.
method Flow Matching (FM) is a simulation-free approach for training CNFs by regressing vector fields of conditional probability paths.
result Flow Matching with diffusion paths yields more robust and stable training compared to diffusion-based methods.

This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann distribution is defined over a bag of paths in a network, that is, on a representati…

2013-02-27abs ↗pdf ↗

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.

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 a machine learning framework for computing most probable paths in stochastic systems.

problem Computing the most probable paths in stochastic dynamical systems.
method Reformulates the boundary value problem of Hamiltonian systems and uses a neural network to solve the Euler-Lagrange equation for the Onsager-Machlup action functional.
result Demonstrates the efficacy and accuracy of the machine learning approach in computing most probable paths for stochastic systems with various types of noise.

BWFlow improves graph generation by smoothly interpolating graph components.

problem Disjoint modeling of graph nodes and edges leads to irregular and non-smooth probability paths.
method Modeling graphs as MRFs and using optimal transport displacement for a smooth probability path.
result BWFlow achieves better training convergence and efficient sampling in graph generation.

Study uses Bayes Hilbert framework to recover probability measure flows from sensors.

problem Recovering probability measure flows from moving sensors in a Hilbert space.
method Bayes Hilbert framework, minimum-energy transport, linearization, variational theory.
result Localized sensors can recover reduced path directions but not full state space.

This paper uses probability tensors for efficient path planning in complex scenarios.

problem Efficient path planning in complex environments with obstacles and multiple goals.
method Probability tensors are used to model agent motion and decision-making, incorporating past and future information.
result The model finds solutions in complex scenarios, demonstrating realistic emergent behaviors.

We describe the pricing and hedging of financial options without the use of probability using rough paths. By encoding the volatility of assets in an enhancement of the price trajectory, we give a pathwise presentation of the replication of European options. The continuity properties of rough-paths allow us to generali…

2018-08-28abs ↗pdf ↗

The relaxed maximum entropy problem is concerned with finding a probability distribution on a finite set that minimizes the relative entropy to a given prior distribution, while satisfying relaxed max-norm constraints with respect to a third observed multinomial distribution. We study the entire relaxation path for thi…

2013-11-07abs ↗pdf ↗

Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a diffusion equation with a diffusion coefficient that inversely depends on the dat…

2012-10-19abs ↗pdf ↗

This paper establishes a non-stochastic analogue of the celebrated result by Dubins and Schwarz about reduction of continuous martingales to Brownian motion via time change. We consider an idealized financial security with continuous price path, without making any stochastic assumptions. It is shown that typical price …

2009-04-28abs ↗pdf ↗

New algorithms sample from complex path measures using neural networks.

problem Sampling from posterior path measures under a general prior process.
method Combines controlled equilibrium dynamics and optimization in infinite-dimensional probability space.
result The algorithms can be integrated with neural networks for learning target trajectory ensembles.

Study Fourier estimator for spot volatility with unbounded coefficients and jumps.

problem Estimating spot volatility with unbounded coefficients and jumps in price process.
method Fourier estimator for spot volatility, convergence analysis for unbounded coefficients and jumps.
result Convergence of trigonometric polynomial to volatility's path, almost sure convergence of reconstructed volatility.

Efficient hybrid method for pricing barrier options with stochastic volatility.

problem Valuation of barrier options on assets with stochastic volatility.
method Combining Monte Carlo simulation and semi-analytical heat potential method.
result Our method provides better accuracy and is orders of magnitude faster than existing methods.

Without probability theory, we define classes of supermartingales, martingales, and semimartingales in idealized financial markets with continuous price paths. This allows us to establish probability-free versions of a number of standard results in martingale theory, including the Dubins-Schwarz theorem, the Girsanov t…

2017-03-25abs ↗pdf ↗

The classical theorem of Fáry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of Fáry's theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest pa…

2016-02-22abs ↗pdf ↗

We consider idealized financial markets in which price paths of the traded securities are cadlag functions, imposing mild restrictions on the allowed size of jumps. We prove the existence of quadratic variation for typical price paths, where the qualification "typical" means that there is a trading strategy that risks …

2011-08-03abs ↗pdf ↗

Paper simplifies calculating causation probabilities and ranks root causes.

problem Computational challenges in assessing causal relationships.
method Algorithmic simplifications and novel methodological framework for Root Cause Analysis.
result Significantly reduces computational complexity for calculating causation probabilities.

For a positive integer n3n\ge 3, the collection of nn-sided polygons embedded in 33-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded nn-sided polygons with unit length edges. Paths in this space determine isotopies of polygons, so path-components …

2018-10-28abs ↗pdf ↗

In implicit models, one often interpolates between sampled points in latent space. As we show in this paper, care needs to be taken to match-up the distributional assumptions on code vectors with the geometry of the interpolating paths. Otherwise, typical assumptions about the quality and semantics of in-between points…

2017-10-31abs ↗pdf ↗

Unified approach to DP problems using Gumbel distribution and variational Bayesian inference.

problem Solving classical optimal path problems in a probabilistic framework.
method Gumbel distribution and variational Bayesian inference for latent optimal paths.
result Unified approach transforms DP problems into directed acyclic graphs with Gibbs distribution.

Solar algorithm selects variables faster and more accurately in high-dimensional data.

problem Variable selection in high-dimensional data with high accuracy and stability.
method Subsample-ordered least-angle regression (solar) and its coordinate descent generalization (solar-cd) using L0L_0 norm solution path averaging.
result Solar selects variables with high accuracy and stability, reducing redundant variable selection.

New MCMC method improves sampling from multimodal distributions.

problem Sampling from multimodal distributions is challenging for classical MCMC methods.
method Interpolating along the diffusion path, preserving mode weights and mixing properties.
result MAD-Path sampler improves global exploration and mode-weight estimation.

Predicts next actions in soccer possessions using path signatures.

problem Predicting next actions in soccer possessions with high accuracy.
method Leveraging path signatures to encode spatio-temporal structure of recent possessions, avoiding manual feature engineering.
result Our approach outperforms transformer-based benchmarks across various loss metrics and reduces computational cost.

Active learning selects optimal measurement times for inferring continuous paths from sparse data.

problem Inferring continuous probability paths from sparse snapshots in high-fidelity domains like single-cell biology.
method Extends active experimentation to the space of measures using Linearized Optimal Transport (LOT) for probabilistic surrogate modeling.
result Empirical results show that the proposed strategy outperforms uncertainty-agnostic baselines.

Market timing is an investment technique that tries to continuously switch investment into assets forecast to have better returns. What is the likelihood of having a successful market timing strategy? With an emphasis on modeling simplicity, I calculate the feasible set of market timing portfolios using index mutual fu…

2017-12-13abs ↗pdf ↗

Quantum computing speeds up analysis of financial stochastic processes.

problem Challenging simulation and analysis of continuous time stochastic processes.
method Established a quantum framework for efficient state preparation and information extraction.
result Extraction of path-dependent and history-sensitive information from stochastic processes efficiently.