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

295886115 · Jun 202019922001200920172026
48 results for JKO Scheme

Extends JKO scheme for iterative algorithms with unknown parameters.

problem Computational and statistical analysis of iterative algorithms with unknown parameters.
method Develops statistical methods to estimate unknown parameters and adapts JKO scheme.
result Establishes asymptotic theory for the statistical JKO scheme.

New method learns population dynamics from snapshots using JKO scheme and inverse optimization.

problem Recovering underlying process governing particle evolution from discrete time samples.
method Combines JKO scheme with inverse optimization techniques for end-to-end adversarial training.
result Improved performance over prior JKO-based methods with theoretical guarantees.

JKO scheme adds deceleration in rapidly changing metric curvature directions.

problem Understanding the implicit bias of the JKO scheme in Wasserstein gradient flow.
method Characterized the implicit bias of the JKO scheme at second order in η, modifying the energy functional.
result JKO scheme adds deceleration in directions where metric curvature of J is rapidly changing.

JKO-iFlow uses neural ODEs to improve generative models with reduced memory and training complexity.

problem Efficiently training deep generative models in high dimensions with reduced memory and training complexity.
method JKO scheme inspired neural ODE flow network with adaptive time reparameterization.
result JKO-iFlow achieves competitive performance compared to existing models at reduced computational and memory cost.

This paper proposes a new method to solve functional minimization problems in probability distributions using sliced-Wasserstein gradient flows.

problem Solving functional minimization problems in high-dimensional probability distributions is computationally challenging.
method The paper introduces a new approach using sliced-Wasserstein gradient flows to approximate the Jordan-Kinderlehrer-Otto (JKO) scheme, parameterizing densities with generative models.
result The proposed method is more flexible and computationally tractable compared to existing methods like JKO-ICNN.

Optimizes functionals on probability space using ICNNs.

problem Optimizing functionals on the space of probabilities with high-dimensional convex functions.
method Proposes an approach using input-convex neural networks (ICNNs) to approximate the JKO scheme.
result Demonstrates feasibility and validity in approximating solutions of PDEs and molecular discovery.

Flow-based models generate data with improved theoretical guarantees.

problem Theoretical analysis of flow-based generative models.
method Proximal gradient descent in Wasserstein space for JKO flow model.
result KL guarantee of data generation by JKO flow model is O(ε2)O(\varepsilon^2).

Proposes a method combining CNFs and rejection-resampling for sampling from unnormalized densities.

problem Sampling from unnormalized probability densities, especially multimodal ones.
method Combines continuous normalizing flows with rejection-resampling steps based on importance weights.
result The method improves sampling accuracy and performance compared to state-of-the-art methods.

Study inverse problems with measure samples, improving estimator calibration and recovery.

problem Inverse problems with unknown potentials observed through measure samples.
method Introduced convex empirical objectives and sharpened Fenchel--Young losses for finite-dimensional potential classes.
result High-probability parameter recovery bounds for inverse entropic unbalanced optimal transport and inverse JKO learning.

A new method for learning gradient flows from population dynamics.

problem Reconstructing population dynamics from limited data.
method Residual approach to enforce continuity equations, combining with data-fitting divergence.
result Demonstrated state-of-the-art performance across trajectory inference benchmarks.

Paper solves DRO for continuous distributions with iterative algorithms.

problem Distributionally robust optimization with continuous worst-case distributions.
method Iterative algorithm for global convergence, leveraging Brenier's theorem and JKO scheme.
result Achieves global convergence under mild assumptions for minimax problems.

New discretization scheme for Wasserstein gradient flows using Schrödinger bridges.

problem Computing Wasserstein gradient flows efficiently and without score functions.
method Iterated Schrödinger bridge approximation with particle-based Sinkhorn algorithm.
result The scheme converges to Wasserstein gradient flows for certain flows, including heat flow.

Framework uses optimal transport for neural architecture search.

problem Optimizing neural architectures in deep learning.
method Semi-discrete optimization using optimal transport.
result Gradient flow and minimizing movement scheme converge to reaction-diffusion equations.

New gradient flows for non-negative and probability measures combining optimal transport and interaction forces.

problem Optimizing non-negative and probability measures using interaction forces and optimal transport.
method Interaction-Force Transport (IFT) gradient flows and their spherical variant, developed via infimal convolution of Wasserstein and spherical MMD tensors, with a particle-based optimization algorithm.
result The spherical IFT gradient flow provides global exponential convergence guarantees for both MMD and KL energy.

We solve continuous-time reinforcement learning using distributional Hamilton-Jacobi-Bellman equations.

problem Predicting the distribution of returns in continuous-time, stochastic environments.
method We derive a distributional Hamilton-Jacobi-Bellman equation for Itô diffusions and Feller-Dynkin processes, and propose an algorithm based on a JKO scheme.
result We propose an online control algorithm that can be used to approximately solve the distributional HJB equation.

The paper develops a new probabilistic framework for denoising diffusion models using free entropy and stochastic analysis.

problem Developing a mathematical framework for denoising diffusion models in noncommutative settings.
method Formulating diffusion and reverse processes governed by operator-valued stochastic dynamics, using tools from free stochastic analysis.
result Establishing an information-geometric link between entropy production, transport, and deconvolution.

FRAME (Filters, Random fields, And Maximum Entropy) is an energy-based descriptive model that synthesizes visual realism by capturing mutual patterns from structural input signals. The maximum likelihood estimation (MLE) is applied by default, yet conventionally causes the unstable training energy that wrecks the gener…

2018-12-04abs ↗pdf ↗

Graph Energy Matching improves generation quality for molecular graphs.

problem Discrete energy-based models struggle with efficient and high-quality sampling for graph generation.
method Inspired by transport-map optimization, Graph Energy Matching learns a permutation-invariant potential energy to guide sampling.
result GEM matches or surpasses discrete diffusion baselines on molecular graph benchmarks.

A new method for computing image curvature efficiently and accurately.

problem Low performance, low accuracy, and requirement of second order differentiability in conventional computation schemes.
method Proposes a novel discrete computation scheme for weighted Gaussian curvature.
result More accurate, computationally more efficient, and does not require second order differentiability.

Study evaluates UK CDC schemes, finding intergenerational cross-subsidies in flat-accrual schemes and dynamic-accrual schemes can reduce but not eliminate them.

problem Intergenerational cross-subsidies in UK CDC schemes, particularly in flat-accrual schemes.
method Comparison of flat-accrual and dynamic-accrual CDC schemes, analysis of performance and level of cross-subsidies.
result Dynamic-accrual schemes can reduce but not eliminate intergenerational cross-subsidies, while flat-accrual schemes often have significant cross-subsidies.

AES scheme improves Bermudan and American option pricing for Heston models.

problem Pricing Bermudan and American options under Heston models efficiently.
method AES scheme using non-central chi-square distribution for variance process.
result AES achieves higher accuracy and computational efficiency for Bermudan options.

Efficient simulation scheme for rough Heston model reduces computational cost.

problem Accurate and efficient simulation of the rough Heston model for option pricing.
method Weak simulation scheme based on Markovian approximations of the rough Heston process.
result The new scheme exhibits second order weak convergence with linear computational cost.

Study finds risk management significantly improves pension scheme efficiency in Kenya.

problem Improving efficiency of pension schemes in Kenya.
method Panel data analysis of 128 pension schemes from 2015-2021.
result Risk management significantly mediates the relationship between corporate governance and pension scheme efficiency.

In this paper, we propose an acceleration scheme for online memory-limited PCA methods. Our scheme converges to the first k>1k>1 eigenvectors in a single data pass. We provide empirical convergence results of our scheme based on the spiked covariance model. Our scheme does not require any predefined parameters such as t…

2018-07-17abs ↗pdf ↗

In the present paper, we introduce a numerical scheme for the price of a barrier option when the price of the underlying follows a diffusion process. The numerical scheme is based on an extension of a static hedging formula of barrier options. For getting the static hedging formula, the underlying process needs to have…

2012-06-13abs ↗pdf ↗

The paper analyzes convergence of Riemannian SA schemes for stochastic optimization.

problem Stochastic optimization problems on Riemannian manifolds.
method Analyzes convergence of Riemannian stochastic approximation schemes using exponential map or retraction functions.
result Shows Riemannian SA schemes find an O(b+logn/n){\mathcal{O}}(b_\infty + \log n / \sqrt{n})-stationary point within O(n){\mathcal{O}}(n) iterations.

We introduce (binary) Darboux transformation for general differential equation of the second order in two independent variables. We present a discrete version of the transformation for a 6-point difference scheme. The scheme is appropriate to solving a hyperbolic type initial-boundary value problem. We discuss several …

2006-06-08abs ↗pdf ↗

We present a new high-order compact scheme for the multi-dimensional Black-Scholes model with application to European Put options on a basket of two underlying assets. The scheme is second-order accurate in time and fourth-order accurate in space. Numerical examples confirm that a standard second-order finite differenc…

2015-05-28abs ↗pdf ↗