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

Trend · papers per month

3757511,1261,501 · Jun 202019922001200920172026
48 results for discrete flow models

Paper proposes a new generative model for discrete distributions using flows on submanifolds.

problem Discretization issues and complex statistical dependencies in discrete data.
method Continuous normalizing flows on factorizing discrete measures, geodesic flow matching.
result Efficient training and broad applicability demonstrated through experiments.

While normalizing flows have led to significant advances in modeling high-dimensional continuous distributions, their applicability to discrete distributions remains unknown. In this paper, we show that flows can in fact be extended to discrete events---and under a simple change-of-variables formula not requiring log-d…

2019-05-24abs ↗pdf ↗

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.

DFMs enable flow-based models for multimodal discrete and continuous data.

problem Combining discrete and continuous data for generative models.
method Discrete Flow Models (DFMs) using Continuous Time Markov Chains.
result DFMs achieve state-of-the-art co-design performance for protein structure and sequence generation.

IDF++ improves integer discrete flows for lossless compression.

problem Theoretical limitations of integer discrete flows for lossless compression.
method Investigated and improved integer discrete flows, addressing gradient bias and architecture modifications.
result Different architecture modifications improve integer discrete flows for lossless compression.

PixelCNN models can achieve state-of-the-art results on CIFAR-10 with exact likelihood computation.

problem Dequantization gap in modeling discrete data like images.
method Introducing subset flows to allow exact computation of likelihoods for discrete data.
result PixelCNN models trained with exact likelihood computation achieve state-of-the-art results on CIFAR-10.

New method reduces discrete flow transitions, improving perplexity estimation.

problem Stochasticity in discrete paths makes rectification strategies ineffective.
method Dynamic-optimal-transport-like minimization objective with minibatch strategies.
result 32 times reduction in transitions for same perplexity.

Normalizing flows are a powerful class of generative models for continuous random variables, showing both strong model flexibility and the potential for non-autoregressive generation. These benefits are also desired when modeling discrete random variables such as text, but directly applying normalizing flows to discret…

2019-01-29abs ↗pdf ↗

Corrected samplers reduce discretization error in discrete flow models without additional computational cost.

problem Discretization error in samplers for discrete flow models.
method Established non-asymptotic error bounds for samplers, proposed time-corrected and location-corrected samplers.
result Location-corrected sampler has lower complexity and better generation quality.

We introduce the discrete Einstein metrics as critical points of discrete energy on triangulated 3-manifolds, and study them by discrete curvature flow of second (fourth) order. We also study the convergence of the discrete curvature flow. Discrete curvature flow of second order is an analogue of smooth Ricci flow.

2013-12-03abs ↗pdf ↗

Develops a new method for learning discrete distributions without embedding them in a continuous space.

problem Challenges in learning discrete distributions using current methodologies.
method Introduces a MAD invertible map and a mixed variational flow (MAD Mix) for discrete distributions.
result MAD Mix produces more reliable approximations than continuous-embedding flows.

Flow based models such as Real NVP are an extremely powerful approach to density estimation. However, existing flow based models are restricted to transforming continuous densities over a continuous input space into similarly continuous distributions over continuous latent variables. This makes them poorly suited for m…

2019-03-18abs ↗pdf ↗

Study of Ricci flow on discrete surfaces of revolution with constant Gaussian curvature.

problem Understanding Ricci flow on discrete surfaces of revolution.
method Explicit parametrizations and Ricci flow analysis for discrete surfaces of revolution.
result Discrete surfaces of revolution approach constant Gaussian curvature under Ricci flow.

Branching Flows generates sequences of varying lengths using binary trees.

problem Generating sequences of unknown lengths or fixed elements.
method A generative modeling framework that evolves states over binary trees, controlling sequence length.
result Branching Flows can generate sequences of varying lengths and mix different types of state spaces.

Lossless compression methods shorten the expected representation size of data without loss of information, using a statistical model. Flow-based models are attractive in this setting because they admit exact likelihood optimization, which is equivalent to minimizing the expected number of bits per message. However, con…

2019-05-17abs ↗pdf ↗

Generative model for joint discrete distributions using randomized assignment flows.

problem Efficiently representing and sampling from complex joint distributions of discrete variables.
method Randomized assignment flows on the statistical submanifold of factorizing distributions.
result Our model can efficiently represent and sample from any target distribution and assess likelihood of unseen data points.

The paper studies deformation of discrete conformal structures on surfaces using combinatorial curvature flows.

problem Finding piecewise constant curvature metrics on surfaces with prescribed combinatorial curvatures.
method Combinatorial curvature flows, including Ricci flow and Calabi flow, are applied to deform Glickenstein's discrete conformal structures.
result The solution of the combinatorial Ricci flow can be uniquely extended and converges exponentially fast for any initial value under certain conditions.

A new method for categorical variational inference using discrete normalizing flows.

problem Challenges in optimizing variational approximations for discrete latent variables.
method Differentiable reparameterization using a mixture of discrete normalizing flows.
result Improves optimization of evidence lower bound and reduces sensitivity to hyperparameters.

Fractional combinatorial flow improves surface conformal structures.

problem Improving discrete conformal structures on surfaces.
method Introducing a fractional combinatorial Calabi flow for discrete conformal structures on surfaces.
result Longtime existence and global convergence of the fractional combinatorial Calabi flow for various surface types.

Exact guidance for discrete data improves posterior sampling efficiency.

problem Inefficient guidance for discrete data in posterior sampling.
method Derive exact transition rate for desired distribution given learned discrete flow matching model.
result Significantly improved efficiency with single forward pass per sampling step.

Study on deforming discrete conformal structures on surfaces with boundaries.

problem Deforming discrete conformal structures on surfaces with boundaries.
method Introduce combinatorial Ricci flow and combinatorial Calabi flow, establish longtime existence and global convergence of solutions.
result Effective algorithms for finding discrete hyperbolic metrics on surfaces with totally geodesic boundaries of prescribed lengths.

The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and solving the Yamabe problem.

problem Discrete conformal structures on polyhedral surfaces and their rigidity.
method Parameterized combinatorial curvature, combinatorial α-Ricci flow, and flow extension through singularities.
result Existence and convergence of combinatorial α-Ricci flow for solving the Yamabe problem.

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.

The paper establishes a discrete uniformization theorem for surfaces with piecewise hyperbolic metrics.

problem Finding decorated piecewise hyperbolic metrics with prescribed combinatorial curvature.
method Introduced combinatorial α-Ricci flow with surgery to handle potential singularities and prove longtime existence and convergence.
result Existence of decorated piecewise hyperbolic metrics with prescribed combinatorial α-curvature.

The paper studies stability of discretized Anosov flows.

problem Global stability of discretized Anosov flows.
method Defined and proved equivalence with previous definitions, showed properties through C1C^1 openness and closedness, and established integrability and uniqueness of invariant foliations.
result Discretized Anosov flows are globally stable.

DDEQs extend DEQs to discrete measure inputs using Wasserstein gradient flows.

problem Applying DEQs to discrete measure inputs like sets or point clouds.
method Wasserstein gradient flows for finding fixed points of discrete measures under permutation-invariance.
result DDEQs can compete with state-of-the-art models in tasks like point cloud classification and completion.

DIF extends NF with stochastic discrete latent variables for better density estimation.

problem Improving density estimation with discontinuities and fine details.
method Discretely indexed flows as an extension of Normalizing Flows with stochastic latent variables.
result DIF inherit good computational behavior of NF and can capture distributions with discontinuities.

New discrete conformal structures on surfaces with boundary, proving global rigidity and constructing hyperbolic metrics.

problem Creating new discrete conformal structures on surfaces with boundary.
method Introducing new discrete conformal structures, proving global rigidity using variational principles, and introducing combinatorial curvature flows.
result Global rigidity of new discrete conformal structures and effective algorithms for constructing hyperbolic metrics.

Bäcklund transformations for smooth and ``space discrete'' Hashimoto surfaces are discussed and a geometric interpretation is given. It is shown that the complex curvature of a discrete space curve evolves with the discrete nonlinear Schrödinger equation (NLSE) of Ablowitz and Ladik, when the curve evolves with the Has…

2000-07-25abs ↗pdf ↗

In this paper, we study the discrete Morse flow for the Ricci flow on football, which is the 2-sphere with removed north and south poles and with the metric g0g_0 of constant scalar curvature, and and for Porous media equation on a bounded regular domain in the plane. We show that with a suitable assumption about $g(0)…

2012-03-10abs ↗pdf ↗

The paper studies the consistency of mean curvature flow via volumetric varifolds.

problem Consistency of mean curvature flow.
method Discretization using volumetric varifolds and derivation of Brakke approximate equality.
result Derivation of a Brakke approximate equality involving varifold masses and approximate mean curvatures.

The paper develops algorithms for finding metrics with prescribed combinatorial curvature on polyhedral surfaces.

problem Finding metrics with prescribed combinatorial curvature on polyhedral surfaces.
method Discrete uniformization theorem, combinatorial α-Yamabe flow, combinatorial α-Calabi flow, edge flipping surgery.
result Longtime existence and convergence of combinatorial α-Yamabe flow and combinatorial α-Calabi flow with surgery.

Sharp Lipschitz bounds for flow-matching and diffusion models with optimal sampling rates.

problem Establishing optimal Lipschitz regularity for flow-matching and diffusion models.
method Sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores.
result Achieves optimal sampling rate of d/N\sqrt{d}/N for Euler-type samplers in dimension dd.

In this paper we investigate flows on discrete curves in $\C^2$, $\CP^1$, and $\C$. A novel interpretation of the one dimensional Toda lattice hierarchy and reductions thereof as flows on discrete curves will be given.

2002-08-23abs ↗pdf ↗

Forward-Euler fails for simulating Wasserstein gradient flows with KL divergence.

problem Simulating Wasserstein gradient flows with forward-Euler discretization fails for KL divergence.
method Forward-Euler discretization for Wasserstein gradient flows with KL divergence.
result Forward-Euler discretization can be incorrect for Wasserstein gradient flows with KL divergence.

Ricci-Filtration enhances retrieval-augmented generation rerankers for query-answer tasks by using discrete Ricci flow on graphs.

problem Improving retrieval-augmented generation rerankers for query-answer tasks.
method Discrete Ricci flow on graphs to evaluate structural importance of chunks.
result Ricci-Filtration outperforms baseline methods in accuracy, precision, recall, and F1 scores.