We solve an optimal consumption problem with habit formation constraints.
problem Maximizing utility with habit formation constraints.
method Formulated and solved a deterministic optimal consumption problem.
result Optimal consumption policies derived explicitly.
Investigates price dynamics of two assets with and without bubbles, deriving conditions for equilibrium prices.
problem Understanding price dynamics and bubbles in multi-asset markets.
method Derives sufficient and necessary conditions for average equilibrium price dynamics in a two-asset model.
result Assets with positive average dividends display hump-shaped bubbles, while those with constant fundamental values show misvaluation effects.
Unified model for financial derivatives pricing with stochastic interest rates.
problem Pricing and hedging financial derivatives with stochastic interest rates.
method Volterra Stein-Stein model with correlated Gaussian Volterra processes.
result Explicit formulas for bond and cap/floor pricing, and characteristic function for log-forward index.
The paper develops methods to price and hedge options in path-dependent stock models.
problem Pricing and hedging options under complex stock models.
method Develops a path-dependent PDE for option pricing and differentiability of path-dependent SDE solutions.
result Provides formulas for option Greeks and differentiability of path-dependent SDE solutions.
Extend classical theory of affine processes to path-dependent setting
problem Path-dependent affine processes
method Introduce path-dependent coefficients and provide analytic formulas for their Fourier--Laplace transform
result Define path-dependent affine processes through their exponential-affine Fourier--Laplace transform and establish a characterization theorem
Simpler method derived for path geometries on surfaces, characterizing projective path geometries.
problem Characterizing projective path geometries on surfaces.
method Solving the equivalence problem of sub-Riemannian geometry of signature (1,1) on a contact 3-manifold.
result Characterization of projective path geometries in terms of their chains.
Recently, path norm was proposed as a new capacity measure for neural networks with Rectified Linear Unit (ReLU) activation function, which takes the rescaling-invariant property of ReLU into account. It has been shown that the generalization error bound in terms of the path norm explains the empirical generalization b…
We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the interaction of an agent with a network---a driver on the transporta…
Proposes a novel path generation and evaluation method for video games.
problem Generating and evaluating realistic navigation paths for video games.
method Combines nonparametric model-free transformations and copula models.
result Demonstrates precise and interpretable generation of diverse navigation paths.
Introduces q-paths for generalizing geometric annealing paths in machine learning.
problem Limited applicability of existing path methods in machine learning.
method Develops a family of paths derived from a generalized mean, including geometric and arithmetic mixtures.
result Empirical gains in Bayesian inference and generative model evaluation.
This paper improves tail dependence analysis by introducing a path-based approach.
problem The classical tail dependence coefficient fails to capture non-exchangeable features of tail dependence.
method The paper introduces a path-based maximal tail dependence approach to capture the most pronounced feature of dependence over all possible paths.
result The paper proves the existence and provides an explicit characterization of the path-based maximal TDC, improving analytical and computational tractability.
This paper considers possible price paths of a financial security in an idealized market. Its main result is that the variation index of typical price paths is at most 2, in this sense, typical price paths are not rougher than typical paths of Brownian motion. We do not make any stochastic assumptions and only assume t…
One-shot path planning for multiple agents using neural networks.
problem Efficiently generating optimal or near-optimal paths for multiple agents in robotics.
method Utilizes fully convolutional neural networks for one-shot multi-agent path planning.
result Demonstrates successful generation of optimal or near-optimal paths in over 85% of cases for multi-path planning.
Foundation for robust finance using rough path theory.
problem Mathematical models of financial markets under Knightian uncertainty.
method Introducing Property (RIE) for càdlàg paths, proving existence of rough integrals, verifying admissibility of trading strategies.
result Existence and stability of rough path integrals for non-gradient integrands.
Paper proposes method for generating paths of stochastic volatility CGMY process for option pricing.
problem Generating accurate sample paths for stochastic volatility models for option pricing.
method Monte-Carlo method for European and American options, least square regression for calibration.
result Calibrated model parameters to S\&P 100 index options market using path-dependent options.
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.
Transports along path in fibre bundles are axiomatically introduced. Their general functional form and some their simple properties are investigated. The relationships of the transports along paths and lifting of paths are studied.
A positive path in the linear symplectic group $\Sp(2n)$ is a smooth path which is everywhere tangent to the positive cone. These paths are generated by negative definite (time-dependent) quadratic Hamiltonian functions on Euclidean space. A special case are autonomous positive paths, which are generated by time-indepe…
A new method predicts future paths using a Monte-Carlo approach.
problem Predicting future financial paths given historical data.
method Path Shadowing Monte-Carlo method using maximum entropy model.
result Yields state-of-the-art predictions for future volatility and option smiles.
The study proves unique path lifting properties and their implications on quotient spaces and covering maps.
problem Understanding unique path lifting properties and their implications on quotient spaces and covering maps.
method The study uses group actions on R-trees and path lifting properties to prove the main results. result Every map of manifolds with the unique path lifting property is a covering map.
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.
Develops a numerical scheme for solving path-dependent FBSDEs and PDEs.
problem Solving path-dependent FBSDEs and PDEs numerically.
method Picard iteration method for FBSDEs, concentration inequality for estimator, supervised learning with neural networks for PDEs.
result Proves convergence and rate of convergence for the Picard iteration method.
Study of motion constraints and path-following on 3D space.
problem Path-following with non-holonomic constraints on R3. method Exploration of geometric structure and construction of guiding vector fields.
result General principles for constructing guiding vector fields for path-following.
Global invariant for path structures and differential equations defined on torus.
problem Global invariant for path structures and differential equations.
method Computed as a secondary invariant from a Cartan connection on a canonical bundle.
result Formula for global invariant of second order differential equations on torus.
This paper describes and evaluates the use of Generative Adversarial Networks (GANs) for path planning in support of smart mobility applications such as indoor and outdoor navigation applications, individualized wayfinding for people with disabilities (e.g., vision impairments, physical disabilities, etc.), path planni…
End-to-end KBQA system learns from multiple reasoning paths without labeled paths.
problem Lack of labeled reasoning paths limits KBQA system performance.
method End-to-end KBQA system using multiple reasoning paths.
result Demonstrates strong performance on various KBQA datasets.
We extend path analysis by showing that, for a singly-connected path diagram, the partial covariance of two random variables factorizes over the nodes and edges in the path between the variables. This result allows us to determine the contribution of each node and edge to the partial covariance. It also allows us to sh…
In a rigorous construction of the path integral for supersymmetric quantum mechanics on a Riemann manifold, based on Bär and Pfäffle's use of piecewise geodesic paths, the kernel of the time evolution operator is the heat kernel for the Laplacian on forms. The path integral is approximated by the integral of a form on …
New algorithmic view of ℓ2 regularization using ODEs and path-following methods.
problem Optimizing convex loss functions with ℓ2 regularization.
method Established an equivalence between ℓ2-regularized solution paths and ODEs, proposing path-following algorithms based on homotopy methods and numerical ODE solvers.
result The solution path can be viewed as a hybrid of gradient descent and Newton method, providing novel schemes to choose grid points and reducing computational cost.
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…
Given two points on a soup can or conical cup with lid, we find and classify all paths of minimal length connecting them. When the number of minimal paths is finite, there are at most four on a can and three on a cup. At worst, minimal paths are piece-wise smooth with three components, each of which is a classical geod…
Proposes a new method to learn entire solution paths without discretization.
problem Optimizing a family of problems indexed by hyperparameters.
method Parameterizes the solution path with basis functions and solves a single stochastic optimization problem.
result Uniform error of learned path converges linearly to a constant related to basis expressiveness.
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.
We study pathwise invariances of centred random fields that can be controlled through the covariance. A result involving composition operators is obtained in second-order settings, and we show that various path properties including additivity boil down to invariances of the covariance kernel. These results are extended…
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.
A 3D space of hyperbolic manifolds is connected but not path-connected.
problem Proving connectivity and non-path-connectedness of framed hyperbolic 3-manifolds.
method Two proofs using density theorems for Kleinian groups, constructing dense sets of framings, and discussing paths.
result The space of framed infinite volume hyperbolic 3-manifolds is not path-connected.
In this paper we use a time-evolving graph which consists of a sequence of graph snapshots over time to model many real-world networks. We study the path classification problem in a time-evolving graph, which has many applications in real-world scenarios, for example, predicting path failure in a telecommunication netw…
Dupire's functional Itô calculus provides an alternative approach to the classical Malliavin calculus for the computation of sensitivities, also called Greeks, of path-dependent derivatives prices. In this paper, we introduce a measure of path-dependence of functionals within the functional Itô calculus framework. Name…
Let M be a Riemannian manifold and PM be the space of all smooth paths on M. We describe geodesics on path space PM. Normal neighbourhood structure on PM has been discussed. We identify paths on M under "back-track" equivalence. Under this identification we show that if M …
The (parallel) linear transports along paths in vector bundles are axiomatically described. Their general form and certain properties are found. It is shown that these transports are locally (i.e. along every fixed path) always Euclidean ones in a senses that there exist frames in which their matrices are unit. The inv…
Paper develops approximation and statistical theory for signature-based path regression.
problem Understanding how fast signatures approximate continuous path functionals.
method Develops \(L^2\) approximation rate for smooth functionals of Itô diffusions and establishes consistency of statistical learning procedures.
result Signature-based methods improve prediction over handcrafted features in various real-data applications.
Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
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.
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…
New lattice path method for statistical inference of persistent diagrams.
problem Statistical inference on persistent diagrams.
method Lattice path representation and combinatorial enumerations.
result Topological changes observed in spike proteins of COVID-19 virus.
Deep network solves maze path planning without training.
problem Efficient path planning in large mazes with obstacles.
method Max pooling layers without training.
result Solves mazes with over half a billion nodes in short time.
The abstract discusses a new causal structure on manifolds using paths and points.
problem Constructing a causal structure on manifolds using paths and points.
method Constructing a four-manifold from pairs of points and paths, and a seven-dimensional manifold from pairs of points and conics.
result The causal structure corresponds to a conformal structure only when the underlying surface is a real projective plane.
The regularization path of the Lasso can be shown to be piecewise linear, making it possible to "follow" and explicitly compute the entire path. We analyze in this paper this popular strategy, and prove that its worst case complexity is exponential in the number of variables. We then oppose this pessimistic result to a…