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.

169,051 papers · 148 categories

Trend · papers per month

67134201268 · Jun 202019922001200920182026
48 results for flow transformations

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.

In this paper we consider the local X-ray transform for general flows. We extend the results on the local and global invertibility of the geodesic ray transform proved by Uhlmann and Vasy \cite{UV} to the X-ray transform for a general flow. The key improvement is that our argument for the ellipticity of the conjugated …

2013-04-25abs ↗pdf ↗

This paper analyzes convergence of large-scale Transformers with weight decay.

problem Understanding optimization guarantees in large-scale Transformer training.
method Construct mean-field limit, show gradient flow convergence to PDE, demonstrate global minimum consistency.
result Gradient flow reaches global minimum in large-scale Transformers with small weight decay.

Generalizes Hasimoto transformation to arbitrary flows on space curves.

problem Modeling and analyzing wave motions on space curves.
method Develops a mapping between curve evolution and scalar equations, transforming general vector fields in the Frenet frame.
result Binormal flows are generally length preserving but bending energy is fragile.

The paper provides convergence guarantees for ODE-based generative models using transformers.

problem Theoretical guarantees for ODE-based generative models.
method A pre-trained autoencoder maps inputs to a latent space, and a transformer predicts the velocity field.
result The distribution of samples generated via estimated ODE flow converges to the target distribution in Wasserstein-2 distance.

Paper transforms a complex equation into simpler forms for analysis.

problem Analyzing a fourth-order dispersive flow equation on Kähler manifolds.
method Developed the generalized Hasimoto transformation to simplify the equation.
result Explicit expressions derived for three examples of compact Kähler manifolds.

Woodbury transformations improve deep generative models with efficient invertibility and determinant calculation.

problem Efficiently invertible and determinant-calculable functions for deep generative models.
method Introducing Woodbury transformations that leverage matrix identities for efficient invertibility and determinant calculation.
result Woodbury transformations enable high-dimensional interactions, efficient sampling, and likelihood evaluation, outperforming other flow architectures.

A new method for discrete data normalizing flows using latent transformations.

problem Challenges in parameterizing bijective transformations for discrete data.
method Predict a distribution over latent transformations to make the marginal likelihood differentiable.
result Discrete-data normalizing flows can be trained using gradient-based learning with unbiased score function estimation.

Normalizing flows are shown to be equivalent to Bayesian networks, revealing new insights.

problem Understanding the limitations and capabilities of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models and analyzing their structure.
result Normalizing flows can be reduced to Bayesian networks, revealing new insights into their structure and capabilities.

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.

Gaussianization flows transform any random vector into a Gaussian, enabling efficient computation and sample generation.

problem Transforming any random vector into a Gaussian for efficient computation and sample generation.
method Iterative Gaussianization and normalizing flow model.
result Gaussianization flows are universal approximators and achieve better performance on tabular datasets.

Researchers study injectivity of magnetic and thermostatic nonabelian ray transforms on compact surfaces.

problem Injectivity of magnetic and thermostatic nonabelian ray transforms on compact surfaces.
method Loop group factorization method for nontrapping λλ-geodesic flows and the general linear group of invertible complex matrices.
result General injectivity question of the nonabelian ray transform for simple magnetic flows is settled.

The paper constructs Darboux transforms for a specific hierarchy and its related flows.

problem Constructing and analyzing Darboux transforms for the B^n(1)\hat B_n^{(1)}-hierarchy.
method Using loop group factorization, the authors construct Darboux transforms and provide Permutability and scaling formulas.
result Explicit soliton solutions are constructed and provided for specific flows.

In prior work the authors introduced a parabolic flow for pluriclosed metrics, referred to as pluriclosed flow. We also demonstrated that this flow, after certain gauge transformations, gives a class of solutions to the renormalization group flow of the nonlinear sigma model with B-field. Using these transformations, w…

2011-09-02abs ↗pdf ↗

We study two kinds of transformation groups of a compact locally conformally Kahler (l.c.K.) manifold. First we study compact l.c.K. manifolds with parallel Lee form by means of the existence of a holomorphic l.c.K. flow. Next, we introduce the Lee-Cauchy-Riemann (LCR) transformations as a class of diffeomorphisms pres…

2001-05-05abs ↗pdf ↗

In this paper we study the problem of deriving further Sobolev inequalities from a given Sobolev inequality. We use several different methods, including Bessel potentials and Riesz transforms. We apply the results to the Ricci flow to extend the author's results on the W1,2W^{1,2} Sobolev inequality along the Ricci flow …

2007-09-04abs ↗pdf ↗

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.

The paper explores geometric aspects of Miura transformations in integrable systems.

problem Relating different integrable equations and classifying bi-Hamiltonian structures.
method Construction of generalized Miura transformations under algebraic and geometric settings.
result Miura transformations relate integrable curve flows in different geometries and induce moving frame transitions.

Researchers relax the CVF's smoothness requirement to create more flexible flow models.

problem Challenges in constructing flexible density models due to the CVF's smoothness requirement.
method Introduce L\mathcal{L}-diffeomorphisms as generalized transformations that may violate smoothness on zero Lebesgue-measure sets.
result The relaxation allows for the use of non-smooth activation functions like ReLU in residual flows.

A new method improves generative models by learning lower-dimensional representations.

problem Normalizing flows cannot learn lower-dimensional representations of data.
method Noisy injective flows (NIF) that map latent space to a learnable manifold in high-dimensional data space using injective transformations and an additive noise model.
result Simple application of NIF to existing flow architectures significantly improves sample quality and yields separable data embeddings.

The framework of normalizing flows provides a general strategy for flexible variational inference of posteriors over latent variables. We propose a new type of normalizing flow, inverse autoregressive flow (IAF), that, in contrast to earlier published flows, scales well to high-dimensional latent spaces. The proposed f…

2016-06-15abs ↗pdf ↗

Assume (M,g,Ω) is a closed, oriented Riemannian surface equipped with an Anosov magnetic flow. We establish certain results on the surjectivity of the adjoint of the magnetic ray transform, and use these to prove the injectivity of the magnetic ray transform on sums of tensors of degree at most two. In the final sectio…

2012-08-29abs ↗pdf ↗

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.

Kernelised flows improve density estimation and generation with fewer parameters.

problem Limited expressiveness of flow-based models due to invertibility constraints.
method Integrates kernels into normalising flows to enhance expressiveness and efficiency.
result Kernelised flows outperform neural network-based flows in parameter efficiency and low-data scenarios.

Graphical normalizing flows use Bayesian networks to improve normalizing flows' interpretability and performance.

problem Improving the interpretability and performance of normalizing flows.
method Revisiting normalizing flows as probabilistic graphical models, proposing graphical normalizing flows with either prescribed or learnable graph structures.
result Graphical conditioners lead to competitive white box density estimators.

Transformers can implement reinforcement learning algorithms from data without updates.

problem Training reinforcement learning algorithms from data without parameter updates.
method Design a teacher-mimicking training procedure for transformers to implement policy-improvement methods.
result Gradient flow converges to an optimal parameter manifold corresponding to the desired RL update.

Neural networks' feature geometry evolves like discrete Ricci flow.

problem Understanding neural feature representations and their geometric transformations.
method Approximating input manifold with geometric graphs and analyzing their evolution during training.
result Neural feature geometry evolves like discrete Ricci flow, with nonlinear activations playing a crucial role.

New Hermite approximations accelerate convergence with adaptive coordinate transformations.

problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.

This paper uses linear rational splines for invertible modeling, offering a simpler inverse and similar costs.

problem Creating expressive invertible models with tractable Jacobian determinants.
method Replacing affine transformations with linear rational splines in coupling layers.
result Linear rational splines offer a simpler inverse and similar costs for inference and generation.

HFNO enhances interpretability of turbulent flows through parallel wavenumber bin processing.

problem Opaque inner workings of Fourier Neural Operators (FNOs) hinder physical interpretability.
method Introduces HFNO, a novel FNO-based architecture that processes wavenumber bins in parallel, enhancing interpretability.
result HFNO decomposes turbulent flows across various scales, enabling increased interpretability and multiscale modeling.

Gradient Boosted Normalizing Flows improve flexibility of NFs without increasing complexity.

problem Improving flexibility of normalizing flows without increasing complexity.
method Gradient Boosting applied to normalizing flows to create a mixture model structure.
result GBNFs outperform non-boosted NFs and produce better results with simpler components.