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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Flow Language Models

Language Rectified Flow improves diffusion language generation by simplifying complex steps.

problem Complexity in diffusion language models limits their implementation in NLP applications.
method Reformulates probabilistic flow models to learn neural ODE models for efficient domain transfer.
result Consistently outperforms baselines on fine-grained control tasks and text editing.

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 ↗

FlowLLM uses LLMs and flow matching to efficiently generate novel materials.

problem Challenging material discovery due to vast chemical space.
method Combines LLMs and Riemannian flow matching to design novel crystalline materials.
result Significantly increases generation rate of stable materials and unique crystals.

Unified framework reduces NFEs for inverse problems.

problem High computational costs and degraded reconstruction quality in existing LDM-based inverse solvers.
method Consistency Regularised Gradient Flows for posterior sampling and prompt optimization.
result Significantly reduced computational cost with state-of-the-art performance.

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.

A new sampler for FLMs improves token-level decoding controls.

problem Sampling from FLMs using standard methods collapses marginals and produces invalid sequences.
method Samples clean one-hot endpoints from FLM token marginals and uses Ornstein-Uhlenbeck bridges conditioned on these endpoints.
result The method preserves token-wise posterior-predictive marginals and improves quality-diversity tradeoff.

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 ↗

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 ↗

We recast the Calabi flow in DeGiorgi's language of minimizing movements. We establish the long time existence of minimizing movements for K-energy with arbitrary initial condition. Furthermore we establish some a priori regularity of these solutions, and that sufficiently regular minimizing movements are smooth soluti…

2012-08-13abs ↗pdf ↗

We propose a new statistical model suitable for machine learning of systems with long distance correlations such as natural languages. The model is based on directed acyclic graph decorated by multi-linear tensor maps in the vertices and vector spaces in the edges, called tensor network. Such tensor networks have been …

2017-10-27abs ↗pdf ↗

We introduce and demonstrate a new approach to inference in expressive probabilistic programming languages based on particle Markov chain Monte Carlo. Our approach is simple to implement and easy to parallelize. It applies to Turing-complete probabilistic programming languages and supports accurate inference in models …

2015-07-03abs ↗pdf ↗

In this paper, we show the uniqueness of Schrödinger flow from a general complete Riemannian manifold to a complete Kähler manifold with bounded geometry. While following the ideas of McGahagan[16], we present a more intrinsic proof by using the distance functions and gauge language.

2017-11-07abs ↗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.

Flow-based models use ODEs to generate complex data distributions.

problem Generating high-dimensional data with complex probability distributions.
method Flow-based models use invertible mappings governed by ODEs to capture these distributions.
result Flow-based models provide exact likelihood estimation and efficient sampling.

A method for eliciting expert beliefs using preferential questions and normalizing flows.

problem Eliciting high-dimensional probability distributions from noisy judgments.
method Normalizing flows based on preferential questions with a novel functional prior.
result The method allows for the inference of arbitrarily flexible densities from preferential judgments.

In dimension n=3n=3, there is a complete theory of weak solutions of Ricci flow - the singular Ricci flows introduced by Kleiner and Lott - which are unique across singularities, as was proved by Bamler and Kleiner. We show that uniqueness should not be expected to hold for Ricci flow weak solutions in dimensions $n\geq…

2019-09-17abs ↗pdf ↗

The goal of program synthesis is to automatically generate programs in a particular language from corresponding specifications, e.g. input-output behavior. Many current approaches achieve impressive results after training on randomly generated I/O examples in limited domain-specific languages (DSLs), as with string tra…

2019-12-27abs ↗pdf ↗

Paper proposes a faster, higher-quality RL method for text-to-image models.

problem Improving image quality and prompt alignment in RL post-training of text-to-image models.
method Online RL variant that reduces variance by sampling paired trajectories and optimizing flow velocity.
result Method converges faster and yields higher output quality and prompt alignment.

We prove that the Kontsevich tetrahedral flow P˙=Qa:b(P)\dot{\mathcal{P}} = \mathcal{Q}_{a:b} (\mathcal{P}), the right-hand side of which is a linear combination of two differential monomials of degree four in a bi-vector P\mathcal{P} on an affine real Poisson manifold NnN^n, does infinitesimally preserve the space of Poisson…

2016-08-04abs ↗pdf ↗

Physics-informed model reduces RBC simulation costs.

problem Computational infeasibility of direct numerical simulations for turbulent systems.
method Combines CNN and recurrent architecture, penalized with PDEs, uses conformal prediction.
result Significant reduction in computational cost for long-term simulations.

Generative model predicts financial market order flow with high accuracy.

problem Creating realistic order flow models for financial markets.
method Token-level autoregressive generative model using deep state space layers.
result Model generates high-quality order flow data with low perplexity.

Generative models are reinterpreted in statistical terms, enabling better understanding and inference.

problem Insufficient interpretability of generative models in statistical terms.
method Flow matching and orthogonalization/cross-fitting in double/debiased machine learning.
result Generative models can be used to estimate nuisance components while maintaining inferential validity.

Predict stock price movements using financial data and news articles with LLMs.

problem Predicting stock price movements using financial data and news articles.
method Combining financial data and news articles, employing pre-trained LLMs, and using retrieval augmentation techniques.
result Predicted stock price movements with a weighted F1-score of 58.5% and 59.1%.

New ASR system handles multiple languages without needing language-specific encoding.

problem Joint training of data-rich and data-scarce languages in a single model.
method Transforms all languages to a single writing system through transliteration, separating modeling and rendering.
result Language-agnostic multilingual ASR system reduces WER up to 10% over language-dependent models.

As deep neural networks become more adept at traditional tasks, many of the most exciting new challenges concern multimodality---observations that combine diverse types, such as image and text. In this paper, we introduce a family of multimodal deep generative models derived from variational bounds on the evidence (dat…

2019-12-11abs ↗pdf ↗

In this work we present a modification in the conventional flow of information through a LSTM network, which we consider well suited for RNNs in general. The modification leads to a iterative scheme where the computations performed by the LSTM cell are repeated over a constant input and cell state values, while updatin…

2018-07-11abs ↗pdf ↗

The paper applies math and physics to language models, introducing entropy and geometric concepts.

problem Understanding and improving language models to approximate intelligent language.
method Formal definitions, functional analysis, topology, thermodynamics, and set theory.
result Entropy function reveals key obstacles for LLMs and offers insights into language models.