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

2665327971,063 · Jun 202019922001200920172026
48 results for generative flows

We define solitons for the generalized Ricci flow on an exact Courant algebroid, building on the definitions of M. Garcia-Fernandez and J. Streets. We then define a family of flows for left-invariant Dorfman brackets on an exact Courant algebroid over a simply connected nilpotent Lie group, generalizing the bracket flo…

2020-02-04abs ↗pdf ↗

Constructs approximate mean curvature flows for general varifolds.

problem Mean curvature flow for general initial data.
method Approximation of mean curvature flows using varifolds and iterated push-forwards.
result Approximate mean curvature flow converges to a spacetime Brakke flow under certain conditions.

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.

Variational inference relies on flexible approximate posterior distributions. Normalizing flows provide a general recipe to construct flexible variational posteriors. We introduce Sylvester normalizing flows, which can be seen as a generalization of planar flows. Sylvester normalizing flows remove the well-known single…

2018-03-15abs ↗pdf ↗

Paper introduces new flows to find circle packings with specific curvature.

problem Finding circle packings with prescribed total geodesic curvatures.
method Introduces combinatorial Calabi flow, fractional combinatorial Calabi flow, and combinatorial p-th Calabi flow.
result Establishes conditions for the longtime behaviors of these flows.

Fractal Flow enhances normalizing flows with interpretable latent space and hierarchical modeling.

problem High-dimensional density estimation and generative modeling challenges.
method Integrates topic modeling (LDA) and fractal strategy into normalizing flows.
result Achieves latent clustering, controllable generation, and superior estimation accuracy.

New linear flows using exponential of linear transformations improve generative models.

problem Improving generative models in machine learning.
method Developed convolution exponentials and generalized Sylvester Flows using the exponential of linear transformations.
result Convolution exponentials and Convolutional Sylvester Flows outperform other models in log-likelihood.

Study on Gaussian interpolation flows for generative modeling.

problem Theoretical properties and regularizing effect of Gaussian denoising in continuous normalizing flows.
method Unified framework of Gaussian interpolation flow, Lipschitz regularity, existence and uniqueness of flow, stability analysis.
result Established theoretical properties of Gaussian interpolation flows, including Lipschitz continuity and existence of flow.

Improved stock price prediction model using generalized order flow imbalance.

problem Improving stock price prediction models using new order flow imbalance indicators.
method Proposed a generalized order flow imbalance construction method and applied it to CSI 500 stocks.
result Generalized Stationarized Order Flow Imbalance (log-GOFI) shows significant improvement in explaining stock price changes.

Paper proposes CoopFlow, a two-flow generator for energy-based models.

problem Training energy-based models with Langevin flow and normalizing flow.
method CoopFlow trains an energy-based model using a normalizing flow initialization and a short-run Langevin flow revision.
result CoopFlow converges to a moment matching estimator and synthesizes realistic images.

EGFs use ergodicity to simplify generative flows for easier training and imitation learning.

problem Challenges in training generative flows, especially in continuous settings and for imitation learning.
method EGFs leverage ergodicity to build simple flows with universality guarantees and tractable FM loss. They introduce a KL-weakFM loss for IL training without a separate reward model.
result EGFs simplify generative flow training and enable effective imitation learning.

The computational cost associated with simulating fluid flows can make it infeasible to run many simulations across multiple flow conditions. Building upon concepts from generative modeling, we introduce a new method for learning neural network models capable of performing efficient parameterized simulations of fluid f…

2019-12-14abs ↗pdf ↗

Incorporates matrix exponential into generative flows for improved performance.

problem Improving generative flow models for better density estimation.
method Integrates matrix exponential into generative flows, proposing new layers and modifying network architecture.
result The proposed model achieves great performance on density estimation.

A new method learns latent space normalizing flow for approximate inference in generator models.

problem Approximate inference in generator models with complex posterior distributions.
method Jointly learns latent space normalizing flow and generator model using MCMC-based maximum likelihood.
result The short-run Langevin flow approximates the posterior and aligns with the normalizing flow prior.

Guided Flows enhance sample quality in conditional image generation and text-to-speech.

problem Improving sample quality in conditional generative models.
method Integrating classifier-free guidance into Flow Matching (FM) models for Continuous Normalizing Flows (CNFs).
result Guided Flows significantly improve sample quality in conditional image generation and text-to-speech synthesis.

Unified framework for continuous-state discrete flow matching models.

problem Discrete generative modeling with continuous probabilities.
method Introducing αα-Flow, a family of CS-DFM models based on information geometry.
result Optimal flow matching loss for αα-flow minimizes generalized kinetic energy.

The paper studies a flow of Legendre curves, generalizing the inverse curvature flow of regular curves.

problem Analyzing the inverse curvature flow of Legendre curves.
method Investigates the unique existence, monotonicity, and asymptotic behavior of the flow.
result The flow asymptotically converges to a self-similar solution, categorized by initial curve.

Normalizing flows fail to detect OOD data due to learning local pixel correlations.

problem Detecting out-of-distribution data in machine learning systems.
method Investigated why normalizing flows fail to distinguish between in- and out-of-distribution data, and modified flow architecture to improve OOD detection.
result Modifying flow architecture can improve OOD detection by biasing the flow towards learning semantic structure of the target data.

Statistical generative models for molecular graphs attract attention from many researchers from the fields of bio- and chemo-informatics. Among these models, invertible flow-based approaches are not fully explored yet. In this paper, we propose a powerful invertible flow for molecular graphs, called graph residual flow…

2019-09-30abs ↗pdf ↗

We interpret the physical BB-field renormalization group flow in the language of Courant algebroids, clarifying the sense in which this flow is the natural "Ricci flow" for generalized geometry. Next we show that the BB-field renormalization group flow preserves T-duality in a natural sense. As corollaries we obtain …

2013-10-18abs ↗pdf ↗

Paper proposes energy objective for training normalizing flows without determinants.

problem Challenges in training normalizing flows due to Jacobian determinants.
method Introduces energy objective based on proper scoring rules, determinant-free.
result Energy objective supports novel model families and competitive performance.

A normalizing flow models a complex probability density as an invertible transformation of a simple density. The invertibility means that we can evaluate densities and generate samples from a flow. In practice, autoregressive flow-based models are slow to invert, making either density estimation or sample generation sl…

2019-06-05abs ↗pdf ↗

We show that on a smooth Hermitian minimal model of general type the Chern-Ricci flow converges to a closed positive current on M. Moreover, the flow converges smoothly to a Kahler-Einstein metric on compact sets away from the null locus of K_M. This generalizes work of Tsuji and Tian-Zhang to Hermitian manifolds, prov…

2013-06-29abs ↗pdf ↗