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

67134201268 · May 202619922001200920172026
48 results for curve diffusion flows

We prove a blow-up criterion in terms of an L2L_2-bound of the curvature for solutions to the curve diffusion flow if the maximal time of existence is finite. In our setting, we consider an evolving family of curves driven by curve diffusion flow, which has free boundary points supported on a line. The evolving curve h…

2018-10-16abs ↗pdf ↗

Study on curve diffusion flows with scale-critical curvature term.

problem Analyzing stability of curve diffusion flows with scale-critical curvature.
method Introduced and studied a one-parameter family of curve diffusion flows with a scale-critical cubic curvature term. Analyzed dynamical stability of homothetic circles using variational methods.
result Established that any small perturbation of an ωω-fold circle monotonically approaches the unit ωω-circle after rescaling, translation, and reparametrisation.

We show that any initial closed curve suitably close to a circle flows under length-constrained curve diffusion to a round circle in infinite time with exponential convergence. We provide an estimate on the total length of time for which such curves are not strictly convex. We further show that there are no closed tran…

2019-01-22abs ↗pdf ↗

In this paper we consider the steepest descent H1H^{-1}-gradient flow of the length functional for immersed plane curves, known as the curve diffusion flow. It is known that under this flow there exist both initially immersed curves which develop at least one singularity in finite time and initially embedded curves whi…

2012-01-18abs ↗pdf ↗

New method shortens and straightens curves, proving convergence and well-posedness.

problem Shortening and straightening of curves.
method Conceptual shift in curve shortening to tangent aligning, variational study of geometric flows.
result Proves convergence to a straight line and global well-posedness for various geometric flows.

We show short-time existence for curves driven by curve diffusion flow with a prescribed contact angle α(0,π)α\in (0, π): The evolving curve has free boundary points, which are supported on a line and it satisfies a no-flux condition. The initial data are suitable curves of class W2γW_2^γ with γ(32,2]γ\in (\tfrac{3}{2}, 2]. For …

2018-10-02abs ↗pdf ↗

We study the curve diffusion flow for closed curves immersed in the Minkowski plane M\mathcal{M}, which is equivalent to the Euclidean plane endowed with a closed, symmetric, convex curve called an indicatrix that scales the length of a vector in M\mathcal{M} depending on its length. The indiactrix $\partial\mathcal{…

2017-06-07abs ↗pdf ↗

Study Chen's flow of curves in two settings: closed circles and lines, identifying geometric conditions for global behavior.

problem Understanding the global behavior of Chen's flow of curves in two settings.
method Investigated two settings: closed immersed ω-circles and immersed lines with a cocompactness condition. Analyzed geometric conditions and curvature effects.
result Identified conditions ensuring the flow shrinks every initial curve to a point, including a rescaling method.

We introduce variational approximations for curve evolutions in two-dimensional Riemannian manifolds that are conformally flat, i.e.\ conformally equivalent to the Euclidean space. Examples include the hyperbolic plane, the hyperbolic disk, the elliptic plane as well as any conformal parameterization of a two-dimension…

2018-09-06abs ↗pdf ↗

Generative model improved using Liouville PDE-based sliced-Wasserstein flow.

problem Improving generative models for fair regression.
method Transformed sliced-Wasserstein flow into Liouville PDE-based formalism, handling density estimation with normalizing flows of neural ODE.
result Outperforms in convergence and fairness with reduced variance.

The mean curvature flow describes the parabolic deformation of embedded branes in Riemannian geometry driven by their extrinsic mean curvature vector, which is typically associated to surface tension forces. It is the gradient flow of the area functional, and, as such, it is naturally identified with the boundary renor…

2007-04-30abs ↗pdf ↗

This work interprets diffusion score matching using normalizing flows for better model training and evaluations.

problem Limitations of diffusion score matching when dealing with certain types of distributions.
method The approach involves interpreting the diffusion matrix using normalizing flows to provide better interpretation and usage of diffusion score matching.
result Diffusion score matching is equivalent to the original score matching evaluated in the transformed space defined by the normalizing flow.

Surface diffusion and mean curvature flows converge to stable critical sets in flat tori.

problem Stability of surface diffusion and mean curvature flows in flat tori.
method Existence and convergence of flows starting close to stable critical sets, proven for all times.
result Flows converge exponentially fast to stable critical sets in flat tori.

The paper studies stochastic optimization on matrices and its limits as dimensions grow.

problem Optimizing functions on large symmetric matrices using stochastic gradient descent.
method Deterministic limits of random curves on matrices, using graphons and stochastic differential equations.
result The limit is a gradient flow on graphons, extending classical McKean-Vlasov limits.

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.

RG-VFM extends VFM to curved manifolds for better material and protein design.

problem Designing materials and proteins on curved manifolds.
method Riemannian Gaussian Variational Flow Matching (RG-VFM) for generative modeling on manifolds.
result RG-VFM more effectively captures manifold structure and improves performance.

The paper shows that energy futures yield curves have an affine geometry.

problem Estimating dynamic behavior of yield curves from data while avoiding arbitrage.
method Finite dimensional models for yield curves, diffusion coefficients, and compatibility conditions.
result The compatibility of yield curves with diffusion coefficients forces an affine geometry.

Efficiently solves inverse problems with diffusion and flow models in just a few steps.

problem Solving inverse problems like super-resolution, inpainting, or deblurring using diffusion or flow models.
method Conditional Conjugate Integrators framework that projects inverse problem dynamics into a more amenable space for sampling.
result Generates high-quality samples in as few as 5 conditional sampling steps, outperforming competing methods.

GLASS Flows improves flow and diffusion model performance by optimizing sampling efficiency.

problem Efficiency bottleneck in sampling Markov transitions for flow and diffusion models.
method Introduces GLASS Flows, a new sampling paradigm that simulates a 'flow matching model within a flow matching model' to sample Markov transitions efficiently.
result Eliminates the trade-off between stochastic evolution and efficiency in large-scale text-to-image models.

We perform a geometric study of the equilibrium locus of the flow that models the diffusion process over a circular network of cells. We prove that when considering the set of all possible values of the parameters, the equilibrium locus is a smooth manifold with corners, while for a given value of the parameters, it is…

2015-09-25abs ↗pdf ↗

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.

We present a novel approximate inference method for diffusion processes, based on the Wasserstein gradient flow formulation of the diffusion. In this formulation, the time-dependent density of the diffusion is derived as the limit of implicit Euler steps that follow the gradients of a particular free energy functional.…

2018-06-12abs ↗pdf ↗

Neural Flow Diffusion Models improve diffusion models by learning flexible forward processes.

problem Fixed forward processes in diffusion models complicate reverse processes and increase inference costs.
method Introduces NFDM, a framework supporting flexible forward processes and a novel parameterization technique.
result Demonstrates strong performance in likelihood estimation and learning generative dynamics.

We introduce cylindrical projections to simulate infinite-dimensional occupation flows of diffusions.

problem Computational intractability of infinite-dimensional occupation flows of diffusions.
method Introduce cylindrical projections to approximate the occupation flow via a finite-dimensional system.
result Strong convergence of cylindrical projections to the initial process with derived rates.

The paper justifies time-dependent loss reweighting schemes for flow matching and diffusion models.

problem Theoretical justification for time-dependent loss reweighting schemes in flow matching and diffusion models.
method Clarifies that the loss can depend on both time and state, and shows theoretical justification for time-dependent loss weighting schemes.
result Time-dependent loss weighting schemes are theoretically justified for Generator Matching and Edit Flows.

Improved NPE with conditional diffusions and summary networks.

problem Approximating complex posterior distributions efficiently and accurately.
method Conditional diffusions coupled with high-capacity summary networks.
result Conditional diffusions offer improved stability, accuracy, and faster training times.

New diffusion models capture heavy-tailed distributions better.

problem Diffusion models struggle with rare or extreme events in heavy-tailed distributions.
method Repurposed diffusion framework using multivariate Student-t distributions, tailored perturbation kernel, and γγ-divergence.
result Our models generate rare and extreme events more effectively than standard diffusion models.

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.

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.