Optimizes diffusion processes for target distributions.
problem Efficiently generating target distributions from point masses.
method Stochastic interpolant framework with conditional expectation drift.
result Optimal diffusion coefficient minimizes path-space KL divergence.
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.
Optimal transport with path constraints for distributions of different masses.
problem Comparing distributions with different total masses under path constraints.
method Introduces a model for unbalanced optimal transport with path constraints, proving existence of solutions.
result Existence of solutions to path constrained unbalanced optimal transport for various constraints.
This paper bridges variational inference and Wasserstein gradient flows.
problem Combining variational inference and Wasserstein gradient flows for more efficient approximations.
method Recasting Bures-Wasserstein gradient flow as a Euclidean gradient flow and using path-derivative gradient estimator.
result A new gradient estimator for f-divergences that can be implemented using machine learning libraries. Extends tracking guarantees for time-varying variational inequalities.
problem Tracking solutions of time-varying variational inequalities.
method Extends existing results to sublinear solution paths and periodic problems.
result Discrete dynamical systems of periodic time-varying VI can exhibit chaotic behavior or converge to the solution.
Using Vovk's outer measure, which corresponds to a minimal superhedging price, the existence of quadratic variation is shown for "typical price paths" in the space of càdlàg functions possessing a mild restriction on the jumps directed downwards. In particular, this result includes the existence of quadratic variation …
A new method for optimization in diffeological spaces using linearizations.
problem Optimization in spaces with low regularity.
method Generalizing linearization to diffeological spaces and constructing smooth paths.
result Achieving weak convergence to minima or critical values in diffeological spaces.
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.
New control theory for self-path-dependent problems solves unique constraints.
problem Optimal control with self-path-dependent constraints in stochastic systems.
method Introduces new HJB equations for variational inequalities with historical maximum controls.
result Value functions are viscosity solutions to HJB equations under Lipschitz conditions.
Unified approach to stochastic control, filtering, and stopping using rough paths.
problem Addressing gaps in classical problems of stochastic control, filtering, and stopping.
method Combining rough path theory with controlled rough paths to provide a pathwise deterministic framework.
result Established rigorous connection between candidate solutions and Hamilton-Jacobi-Bellman equation.
New method approximates diffusion process posteriors using moment functions.
problem Approximating posteriors of stochastic differential equations.
method Constructs variational process as controlled prior, approximates posterior with moment functions, uses natural gradient descent.
result Richer variational approximations for state-dependent diffusion terms.
This article addresses the problem of approximating the price of options on discrete and continuous arithmetic average of the underlying, i.e. discretely and continuously monitored Asian options, in local volatility models. A path-integral-type expression for option prices is obtained using a Brownian bridge representa…
We consider the variational complex on infinite jet space and the complex of variational derivatives for Lagrangians of multidimensional paths and study relations between them. The discussion of the variational (bi)complex is set up in terms of a flat connection in the jet bundle. We extend it to supercase using a part…
New method infers population dynamics from snapshots using path space optimization.
problem Recover dynamics of a population from its temporal marginals.
method Grid-free algorithm using Schrödinger bridges coupled via noisy gradient descent in mean-field limit.
result Global convergence to min-entropy estimator with end-to-end theoretical guarantees.
New path-gradient estimator for continuous normalizing flows.
problem Limitation of simple Gaussian variational distributions in complex applications.
method Proposed a path-gradient estimator for continuous normalizing flows.
result Empirical evidence of superior performance of the new estimator.
Unified deep learning framework solves various optimal transport problems.
problem Solving variational problems in optimal transport with computational challenges.
method Unified deep learning framework leveraging dual formulation of Lagrangians.
result Outperforms previous approaches in single-cell trajectory inference.
The paper simplifies conditions for optimal paths on manifolds avoiding obstacles.
problem Finding optimal paths on manifolds avoiding obstacles.
method Study of sufficient conditions for optimality on Riemannian manifolds and Lie groups.
result New conditions for optimality are provided in terms of matrix invertibility.
PA reinterpreted as SB problem, unifying thermodynamics and optimal transport.
problem Optimizing discrete-time paths between probability distributions.
method Schrödinger Bridge theory, solving variational problems.
result PA's reweighting step derived from Schrödinger system.
The paper studies metrics that match prescribed geodesics and introduces a variational problem.
problem Finding Riemannian metrics whose geodesics match given paths.
method Introduces a functional E on Riemannian metrics and computes its variational equations.
result Existence of conformally critical metrics in certain cases.
New relation on paths is not transitive.
problem Extending tree-like property to non-Lipschitz paths.
method Analyzing a fractal construction in the plane.
result The resulting relation is not an equivalence relation.
The paper shows that almost every path structure is not variational.
problem Determining if a path structure is variational.
method Generalized Douglas's result to higher dimensions and analyzed path geometries with infinitesimal symmetries.
result Almost every path structure is not variational.
Neural networks' optimization dynamics are confined to a single basin despite connected basins in the loss landscape.
problem Neural networks' optimization dynamics are confined to a single basin despite connected basins in the loss landscape.
method Identifying entropic barriers arising from the interplay between curvature variations along low-loss paths and noise in optimization dynamics.
result Curvature-induced entropic forces bias noisy dynamics back toward the endpoints, explaining the confinement and connectivity of solutions.
Framework uses optimal transport to quantify model risk in stochastic path laws.
problem Model risk in stochastic path laws.
method Signature-induced optimal transport framework.
result Explicit robust bounds and budget-aware sparse surrogate method.
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 work focuses on dynamic regret of online convex optimization that compares the performance of online learning to a clairvoyant who knows the sequence of loss functions in advance and hence selects the minimizer of the loss function at each step. By assuming that the clairvoyant moves slowly (i.e., the minimizers c…
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…
We prove that an analog of the exterior differential acts on the space of arbitrary Lagrangians of multidimensional paths on any manifold or supermanifold, thus making this space into a cochain complex. An analog of the Stokes' formula holds. The construction and the proofs are purely geometrical, in terms of the varia…
This paper studies the risk-adjusted optimal timing to liquidate an option at the prevailing market price. In addition to maximizing the expected discounted return from option sale, we incorporate a path-dependent risk penalty based on shortfall or quadratic variation of the option price up to the liquidation time. We …
We consider variation of energy of the light-like particle in Riemann space-time, find lagrangian, canonical momenta and forces. Equations of the critical curve are obtained by the nonzero energy integral variation in accordance with principles of the calculus of variations in mechanics. This method is shown to not lea…
CMCD sampler connects transport and variational inference for efficient sampling.
problem Efficient sampling and generative modeling in Bayesian computation.
method Developed a principled framework using divergences on path space, CMCD sampler with adaptive dynamics.
result CMCD sampler outperforms competing approaches across various experiments.
Variational inference is a powerful approach for approximate posterior inference. However, it is sensitive to initialization and can be subject to poor local optima. In this paper, we develop proximity variational inference (PVI). PVI is a new method for optimizing the variational objective that constrains subsequent i…
Paper optimizes approximating high-dimensional diffusions by independent coordinates.
problem Optimizing approximations of high-dimensional diffusions by independent coordinates.
method Introduces independent projection as optimal for two criteria.
result Independent projection is optimal for two criteria related to entropy and convergence.
Stochastic normalizing flows use SDEs for efficient training and sampling.
problem Efficient maximum likelihood estimation and variational inference.
method Continuous normalizing flows extended with stochastic differential equations (SDEs) and rough path theory.
result Stochastic normalizing flows enable efficient training and sampling from complex distributions.
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.
We prove that the model-free typical (in the sense of Vovk) càdlàg price paths with mildly restricted downward jumps possess quadratic variation which does not depend on the specific sequence of partitions as long as these partitions are obtained from stopping times such that the oscillations of a path on the consecuti…
Recurrent neural networks like long short-term memory (LSTM) are important architectures for sequential prediction tasks. LSTMs (and RNNs in general) model sequences along the forward time direction. Bidirectional LSTMs (Bi-LSTMs) on the other hand model sequences along both forward and backward directions and are gene…
This paper optimizes paths for generative models using kinetic energy.
problem Improving generative model performance and sample quality.
method Investigating and optimizing Gaussian probability paths with kinetic energy.
result Kinetic optimal Gaussian paths simplify particle trajectories and improve model performance.
Improves BED scalability for implicit models.
problem Designing experiments for implicit models with intractable data distributions.
method Hybrid gradient approach combining variational MI estimator, ES, and SGA.
result Significantly improves scalability of BED for implicit 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.
New algorithms minimize dynamic regret in non-stationary online learning.
problem Universal dynamic regret minimization under exp-concave and smooth losses.
method Strongly Adaptive algorithms with a path variational based on second order differences of the comparator sequence.
result Achieve a dynamic regret of ildeO(d2n1/5Cn2/5∨d2), optimal modulo dependencies. In this paper we consider two generalizations of the Skyrme model. One is a variational problem for maps from a compact three-manifold to a compact Lie group. The other is a variational problem for flat connections. We describe the path components of the configuration spaces of smooth fields for each of the variational…
Given a smooth manifold M and a totally nonholonomic distribution Δ⊂TM of rank d, we study the effect of singular curves on the topology of the space of horizontal paths joining two points on M. Singular curves are critical points of the endpoint map F:γ↦γ(1) defined on the space Ω of horizonta…
Deep RL optimizes processing paths to desired material structures.
problem Optimizing processing paths to achieve desired material properties.
method Deep reinforcement learning guided by structure representations and reward signals.
result Algorithm learns to find optimal paths to target structures in material space.
It is well known that neural networks with rectified linear units (ReLU) activation functions are positively scale-invariant. Conventional algorithms like stochastic gradient descent optimize the neural networks in the vector space of weights, which is, however, not positively scale-invariant. This mismatch may lead to…
Paper introduces a new outer measure for continuous price paths with instant enforcement.
problem Defining a new outer measure for continuous price paths with instant enforcement.
method Introducing an outer measure on the space [0,+∞)imesΩ that assigns zero value to instantly blockable sets. result Proves BDG inequalities and an Itô-type integral for the modified measure.
New methods use machine learning to simulate rare transitions in molecular systems.
problem Simulating rare transitions between metastable states in molecular dynamics.
method Generative models and reinforcement learning for importance sampling.
result Efficiently generated transition paths linking metastable states.
Novel signature approach for pricing and hedging path-dependent options with market frictions.
problem Pricing and hedging path-dependent options with market frictions.
method Signature approach, mean-quadratic variation criterion, non-standard infinite-dimensional Riccati equations, time-augmented signature, non-Markovian stochastic control problem.
result Effective hedging strategies in frictional markets with low-truncated signature approximations.
We compute a sharp small-time estimate for the price of a basket call under a bi-variate SABR model with both β parameters equal to 1 and three correlation parameters, which extends the work of Bayer,Friz&Laurence [BFL14] for the multivariate Black-Scholes flat vol model. The result follows from the heat kernel on …