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

72145217289 · Jun 202019922001200920172026
48 results for Probability flow

The study examines how shallow neural nets converge to training samples or manifold points during diffusion.

problem Understanding when and how shallow neural nets converge to training samples or manifold points during diffusion.
method Analysis of shallow ReLU neural network denoisers trained with minimal 2\ell^2 norm, comparing score flow and diffusion flow.
result Probability flow converges to training points, sums of training points, or manifold points, depending on the diffusion time scheduler.

Gradient flows on distributions of distributions for machine learning tasks.

problem Designing gradient flows for datasets of probability distributions.
method Representing classes as conditional distributions, modeling datasets as mixture distributions, using Wasserstein over Wasserstein (WoW) distance and gradients.
result Demonstrated gradient flows for dataset transfer and distillation tasks.

The paper improves the probability flow ODE sampler for faster sampling of natural images.

problem Improving the convergence rate of the probability flow ODE sampler.
method Adapting the probability flow ODE sampler to exploit intrinsic low-dimensional structures in natural image data.
result Achieves a dimension-free convergence rate of O(k/T)O(k/T) in total variation distance, improving upon existing results.

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.

Paper analyzes convergence of ODE samplers in Wasserstein distances.

problem Limited theoretical understanding of convergence properties of probability flow ODEs.
method Convergence analysis for general probability flow ODEs in 2-Wasserstein distance.
result First non-asymptotic convergence analysis for probability flow ODE samplers.

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.

NOFIS uses normalizing flows to estimate rare event probabilities more efficiently.

problem Accurate estimation of rare event probabilities using conventional methods is inefficient and resource-intensive.
method NOFIS learns a sequence of proposal distributions by minimizing KL divergence losses and estimates rare event probability using importance sampling.
result NOFIS outperforms baseline approaches in estimating rare event probabilities across 10 distinct test cases.

Bi-Lipschitz flows approximate a wide range of distributions.

problem Characterizing the expressivity of bi-Lipschitz normalizing flows.
method Linking score regularity to transport map bi-Lipschitzness via probability flow ODE.
result Gaussian pullbacks induced by bi-Lipschitz variance-preserving transport maps are L1L^1-dense among all probability densities.

This paper studies gradient flows for sampling using various metrics and their affine invariance.

problem Sampling from probability distributions with unknown normalizations.
method Gradient flows in the space of probability measures, focusing on Kullback-Leibler divergence and affine invariance of metrics.
result Gradient flows of Kullback-Leibler divergence do not depend on the normalization constant, and affine invariance is achieved for certain metrics.

A new method for sampling from complex distributions using Langevin samplers.

problem Sampling from unnormalized Boltzmann densities.
method Probability flow ODE derived from linear stochastic interpolants, employing Langevin samplers.
result Efficient simulation of the flow with non-asymptotic convergence rate.

New error bounds for flow matching methods using deterministic sampling.

problem Improving the accuracy of flow matching methods for generating probability distributions.
method Derived error bounds for flow matching methods under deterministic sampling conditions.
result Presented error bounds for flow matching methods using L2L^2 loss and regularity conditions.

Flow-based models use ODEs to generate complex data distributions.

problem Generating high-dimensional data with complex probability distributions.
method Flow-based models use invertible mappings governed by ODEs to capture these distributions.
result Flow-based models provide exact likelihood estimation and efficient sampling.

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 extend rectified flow to infinite-dimensional Hilbert space.

problem Extending rectified flow to infinite-dimensional spaces.
method Established a rigorous functional formulation using the superposition principle for continuity equations.
result Demonstrated superior performance compared to existing models.

This paper explores gradient flows for sampling distributions without normalization constants.

problem Sampling from distributions with unknown normalization constants.
method Gradient flows in the space of probability measures, focusing on Kullback-Leibler divergence, Fisher-Rao metric, and affine invariance.
result Gradient flows derived from Kullback-Leibler divergence do not depend on the normalization constant.

It is known that the probability is not a conserved quantity in the stock market, given the fact that it corresponds to an open system. In this paper we analyze the flow of probability in this system by expressing the ideal Black-Scholes equation in the Hamiltonian form. We then analyze how the non-conservation of prob…

2019-12-20abs ↗pdf ↗

Invertible flow-based generative models are an effective method for learning to generate samples, while allowing for tractable likelihood computation and inference. However, the invertibility requirement restricts models to have the same latent dimensionality as the inputs. This imposes significant architectural, memor…

2020-02-20abs ↗pdf ↗

MPF method improves parameter estimation in probabilistic models.

problem Difficulty in fitting probabilistic models due to intractable partition function.
method Minimum Probability Flow (MPF) method for parameter estimation.
result MPF outperforms existing techniques in convergence time and accuracy.

The paper proposes a new method to approximate Wasserstein-Fisher-Rao flows using Monte Carlo techniques.

problem Sampling from probability distributions and minimizing Kullback-Leibler divergence.
method Sequential Monte Carlo approximations of Wasserstein-Fisher-Rao gradient flows.
result The proposed method outperforms other Monte Carlo algorithms in certain conditions.

Normalizing flows provide a general mechanism for defining expressive probability distributions, only requiring the specification of a (usually simple) base distribution and a series of bijective transformations. There has been much recent work on normalizing flows, ranging from improving their expressive power to expa…

2019-12-05abs ↗pdf ↗

This paper presents a methodology and numerical algorithms for constructing accelerated gradient flows on the space of probability distributions. In particular, we extend the recent variational formulation of accelerated gradient methods in (wibisono, et. al. 2016) from vector valued variables to probability distributi…

2019-01-10abs ↗pdf ↗

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.

TTF improves performance of normalizing flows for heavy-tailed distributions.

problem Improving performance of normalizing flows for heavy-tailed distributions.
method Uses a Gaussian base distribution and a final transformation layer to produce heavy tails.
result Experimental results show TTF outperforms current methods, especially in high-dimensional or heavy-tailed scenarios.

We construct a Wasserstein gradient flow of the maximum mean discrepancy (MMD) and study its convergence properties. The MMD is an integral probability metric defined for a reproducing kernel Hilbert space (RKHS), and serves as a metric on probability measures for a sufficiently rich RKHS. We obtain conditions for conv…

2019-06-11abs ↗pdf ↗

RegFlow models future states with flexible probability distributions.

problem Predicting future states under complex, non-deterministic scenarios.
method Hypernetwork architecture and continuous normalizing flow model.
result RegFlow achieves state-of-the-art results on benchmark datasets.

Symbolic dynamics for flows in high dimensions, extending previous work.

problem Coding flows with positive speed in high dimensions.
method Construct symbolic dynamics for flows with positive speed in any dimension.
result Extended symbolic dynamics to flows in high dimensions, including homoclinic classes.

The idea is considered that a quantum wormhole in a spacetime foam can be described as a Ricci flow. In this interpretation the Ricci flow is a statistical system and every metric in the Ricci flow is a microscopical state. The probability density of the microscopical state is connected with a Perelman's functional of …

2008-09-05abs ↗pdf ↗

The paper analyzes fill probabilities in limit order books with varying price levels.

problem Determining the likelihood of limit orders being executed in a limit order book.
method Developed a state-dependent stochastic framework to model limit order book dynamics.
result Derived semi-analytical expressions for fill probabilities and mid-price changes.

New framework transforms labeled datasets for various machine learning tasks.

problem Lack of principled methods to transform labeled datasets.
method Wasserstein gradient flows in probability space for optimization of data-generating distributions.
result Framework can impose constraints, adapt for transfer learning, or re-purpose models.

Equivariant flows generate symmetric distributions for complex systems.

problem Generating symmetric distributions for complex systems with exact likelihood.
method Equivariant normalizing flows that preserve symmetries.
result Equivariant flows generate symmetric distributions that are invariant to symmetries in physical systems.

A new method for normalizing flows using stochastic interpolants simplifies likelihood estimation and improves efficiency.

problem Efficient and scalable likelihood estimation for complex probability distributions.
method Inference of velocity field from time-dependent density interpolating between base and target densities.
result Simplified quadratic loss for velocity estimation, leading to faster and more efficient training.

New bounds for generative models under weaker assumptions.

problem Establishing convergence guarantees for generative models under weak assumptions.
method Non-asymptotic 2-Wasserstein distance bounds for probability flow ODEs under weak log-concavity and Lipschitz continuity.
result Concrete convergence rates for generative models, including non-log-concave distributions.

New theory improves diffusion model convergence for generating data.

problem Improving convergence of diffusion models for data generation.
method Developed a non-asymptotic convergence theory for probability flow ODEs.
result Proves d/εd/\varepsilon iterations suffice for approximating target distributions.