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,742 papers · 148 categories

Trend · papers per month

182364545727 · Jun 202019922001200920172026
48 results for gradient flow systems

The article reviews how gradient flow systems on hypergraphs connect to information geometry and nonequilibrium physics.

problem Understanding the geometry of perturbed gradient flow systems on hypergraphs.
method Formulating modern nonequilibrium principles within the framework of perturbed gradient flow systems on hypergraphs.
result New concepts like moduli spaces and thermodynamical area are introduced to understand speed limits.

This work develops a particle system to approximate Fisher-Rao gradient flows in mean-field optimization.

problem Optimizing probability measures in neural network contexts.
method Constructing an interacting particle system approximating Fisher-Rao gradient flows.
result Propagation of chaos for the Fisher-Rao gradient flow in entropic mean-field optimization.

A new method for Gaussian filtering using gradient flows and Wasserstein metrics.

problem Approximating Gaussian and mixture-of-Gaussians filtering for complex systems.
method Variational approximation via gradient-flow representation on Wasserstein metric space.
result Competitive performance in posterior representation and parameter estimation for systems with multiplicative noise and multi-modal distributions.

We introduce a dynamical system which we call the AdaBoost flow. The flow is defined by a system of ODEs with control. We show that three algorithms of the AdaBoost family (i) the AdaBoost algorithm of Schapire and Freund (ii) the arc-gv algorithm of Breiman (iii) the confidence rated prediction of Schapire and Singer …

2011-10-28abs ↗pdf ↗

Estimate relaxation times in nonextensive systems using gradient flow for Tsallis entropy maximization.

problem Estimating relaxation times in financial market dynamics.
method Developing a method using EGF for maximizing Tsallis entropy.
result Longer relaxation times for nonextensive systems compared to Shannon entropy.

Toda flow explained as a porous medium equation.

problem Understanding the Toda flow through the lens of porous medium equations.
method Analyzing the geometry and dynamics of the porous medium equation and comparing it to the Toda flow.
result The Toda flow can be represented as a specific porous medium equation, revealing its gradient and Hamiltonian nature.

The paper studies a gradient system on a beta statistical manifold, proving integrability and deriving explicit expressions.

problem Investigating the geometry and integrability of a gradient system on a bivariate beta statistical manifold.
method Proving the system is Hamiltonian and admitting a Lax pair representation, deriving explicit expressions using Stirling's approximation, and identifying the Hamiltonian function.
result The gradient flow is linearizable in dual affine coordinates, and the system is completely integrable.

Proves Thom's conjecture for parabolic flows on Hilbert spaces.

problem Gradient flows on infinite-dimensional spaces and geometric flows with symmetry.
method Analytic functions, Hilbert spaces, Yang-Mills Flow, Ricci flow, critical points, Lojasiewicz inequality.
result Gradient conjecture holds for parabolic flows on Hilbert spaces, including flows with gauge symmetry.

GFM models neural network training as a dynamical system to forecast final weights.

problem Computational intensity and inefficiency in training deep neural networks.
method Gradient Flow Matching (GFM) treats training as a dynamical system with learned vector fields.
result GFM achieves forecasting accuracy competitive with Transformer-based models and significantly outperforms classical baselines.

Study on dynamic curves with elastic energy and spontaneous curvature.

problem Modeling and analyzing dynamic planar curves with elastic energy.
method Gradient flow of inclination angle, nonlocal quasilinear system, local well-posedness, global existence, convergence.
result Local well-posedness, global existence, convergence of the flow for weak regularity initial data.

REGS samples from unnormalized distributions using gradient flow and neural networks.

problem Sampling from unnormalized distributions with high accuracy and efficiency.
method REGS is a particle method that iteratively transforms samples from a reference distribution to match an unnormalized target distribution using Wasserstein gradient flow and neural networks.
result REGS outperforms state-of-the-art methods in sampling from challenging multimodal distributions and real datasets.

The paper tackles safe reinforcement learning with convex regularization.

problem Safe reinforcement learning in complex, high-dimensional settings with safety constraints.
method Doubly-regularized RL framework combining reward and parameter regularization, formulated as a convex regularized objective with parametrized policies on an infinite-dimensional statistical manifold.
result Exponential convergence guarantees under sufficient regularization, robust theoretical insights and guarantees for safe RL.

A new DDR framework learns low-dimensional data representations using dynamical systems.

problem Learning efficient low-dimensional data representations.
method DDR framework based on nonlinear dynamical systems, using linear combinations of functions and regularization.
result DDR method outperforms other methods on synthetic and real datasets.

This paper explores geometric and analytic aspects of Lojasiewicz inequalities on vector bundles.

problem Understanding growth and stability conditions for real-analytic functions over vector bundles.
method Outline theory of functionals and variational problems over vector bundles, explore applications to real-analytic functionals.
result Describes the energy functional on $S^{n-1$ as a functional over a vector bundle.

The paper studies curves in Riemannian manifolds using total variation flow.

problem Analyzing the evolution of curves in Riemannian manifolds using total variation.
method Defining and proving the existence of strong solutions to the flow equations, showing variational equality, and proving convergence.
result Strong solutions converge to a constant map in finite time for non-positive sectional curvature.

The study analyzes the evolution of Gaussian measures under a specific gradient flow.

problem Analyzing the evolution of Gaussian measures under a specific gradient flow.
method Derives ordinary differential equations governing the evolution of mean, covariance, and mass under the HK-Boltzmann gradient flow.
result Exponential convergence to equilibrium demonstrated through Polyak-Lojasiewicz-type inequalities.

Given a smooth closed manifold M, the Morse-Witten complex associated to a Morse function f and a Riemannian metric g on M consists of chain groups generated by the critical points of f and a boundary operator counting isolated flow lines of the negative gradient flow. Its homology reproduces singular homology of M. Th…

2004-11-21abs ↗pdf ↗

We consider maps between Riemannian manifolds in which the map is a stationary point of the nonlinear Hodge energy. The variational equations of this functional form a quasilinear, nondiagonal, nonuniformly elliptic system which models certain kinds of compressible flow. Conditions are found under which singular sets o…

1999-08-31abs ↗pdf ↗

New method accelerates optimization in fixed time, improving convergence rates.

problem Optimization in large-scale data-driven problems.
method Gradient-based optimization framework with fixed-time stable dynamical systems.
result Achieves convergence to the optimizer in a fixed number of iterations, independent of initialization.

The paper extends gradient flow and relaxation studies to non-flat Riemannian manifolds.

problem Understanding gradient flows and relaxation in non-flat Riemannian manifolds.
method Developed a criterion for comparing relaxation along gradient descent curves using non-metricity tensor.
result Revealed a universal asymmetry: warming up is faster than cooling down.

Improved sampling method using regularized Stein Variational Gradient Flow.

problem Improving the accuracy of sampling methods in machine learning.
method Proposed Regularized Stein Variational Gradient Flow to interpolate between SVGD and Wasserstein Gradient Flow.
result Established theoretical properties and provided preliminary numerical evidence of improved performance.

In this paper we investigate a kind of generalized Ricci flow which possesses a gradient form. We study the monotonicity of the given function under the generalized Ricci flow and prove that the related system of partial differential equations are strictly and uniformly parabolic. Based on this, we show that the genera…

2011-07-17abs ↗pdf ↗

New algorithm trains latent diffusion models using interacting particles.

problem Training latent diffusion models efficiently and accurately.
method Reformulate training as minimizing a free energy functional, then approximate with interacting particles.
result The new algorithm outperforms previous methods in experiments.

The paper analyzes rates for a modified gradient descent method using Stein variational gradients.

problem Improving the accuracy of gradient descent methods for complex target distributions.
method Derives finite-particle rates for regularized Stein variational gradient descent (R-SVGD).
result Establishes explicit non-asymptotic bounds for time-averaged empirical measures.

This paper analyzes Stein variational gradient descent for Bayesian inference.

problem Sampling or approximating high-dimensional probability distributions.
method Iterated steepest descent steps with a reproducing kernel Hilbert space norm.
result Performance gains of certain nondifferentiable kernels with adjusted tails.

We investigate a new geometric flow which consists of a coupled system of the Ricci flow on a closed manifold M with the harmonic map flow of a map phi from M to some closed target manifold N with a (possibly time-dependent) positive coupling constant alpha. This system can be interpreted as the gradient flow of an ene…

2009-12-15abs ↗pdf ↗

Establishes exponential contraction in Wasserstein distance on manifolds and flows.

problem Analyzing contraction rates in Wasserstein distance on manifolds and their evolution.
method Explicit estimates and extension to evolving manifolds under geometric flow.
result Gradient estimates with exponential contraction rate under weak curvature conditions.

Derives equations for deep learning biases and weights, showing data complexity reduction.

problem Understanding interpretability in supervised learning.
method Gradient flow equations and dynamical truncation of training data.
result Data complexity reduction at an exponential rate with training.

The paper studies geometric properties of hydrodynamical density manifolds.

problem Understanding the geometry of hydrodynamical density manifolds.
method Formulating connections, gradients, Hessians, parallel transports, and curvatures on these manifolds.
result Closed-form formulas for sectional curvatures in one-dimensional density manifolds.

Mean curvature flow is not a gradient flow on two nondegenerate metric spaces.

problem Whether mean curvature flow is a gradient flow on nondegenerate metric spaces of simple closed plane curves.
method Examined two nondegenerate metric spaces: uniformness-preserving and curvature-weighted structures.
result Mean curvature flow is not a gradient flow on either metric space.