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

3657301,0951,460 · Jun 202019922001200920172026
48 results for discrete 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.

This work analyzes discrete diffusion models using stochastic integrals, providing error bounds and insights.

problem Error analysis for discrete diffusion models remains less understood.
method Proposes a comprehensive framework based on Lévy-type stochastic integrals.
result Obtains the first error bound for the ττ-leaping scheme in KL divergence.

Faster sampling in discrete diffusion models with predetermined transition time.

problem Efficiency in sampling discrete diffusion models.
method Discrete Non-Markov Diffusion Models (DNDM) with predetermined transition time.
result Significantly reduces the number of function evaluations for faster sampling.

Masking diffusion outperforms other discrete diffusion models by incorporating jump times into the model.

problem Improving the performance of discrete diffusion models.
method Conditioning on the jump schedule of discrete Markov processes.
result Schedule-conditioned discrete diffusion (SCUD) models outperform classical and masking diffusion models.

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 ↗

New discrete models for constant mean curvature surfaces and tori.

problem Creating discrete models for constant mean curvature surfaces and tori.
method Integrable theory of discrete polarised curves and Darboux transforms.
result Closed-form discrete parametrisations of discrete isothermic cylinders, discrete constant mean curvature cylinders, and discrete isothermic tori.

Paper introduces DMPMs for efficient discrete data generation with sharp convergence bounds.

problem Efficient generation of discrete data with theoretical guarantees.
method Discrete Markov Probabilistic Models (DMPMs) operating in bit space with time-reversal process.
result Sharp convergence bounds established under minimal assumptions, competitive performance in discrete data generation.

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.

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.

Probabilistic models with discrete latent variables naturally capture datasets composed of discrete classes. However, they are difficult to train efficiently, since backpropagation through discrete variables is generally not possible. We present a novel method to train a class of probabilistic models with discrete late…

2016-09-07abs ↗pdf ↗

Discrete diffusion models improve data generation for discrete data like language and graphs.

problem Adapting diffusion models to discrete state spaces for better data generation.
method Formulated as CTMCs, used uniformization of continuous Markov chains for sampling.
result Derive guarantees for sampling from any distribution on a hypercube, aligning with state-of-the-art achievements.

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.

New framework for discrete-state diffusion models reduces sample complexity.

problem Lack of theoretical understanding and sample complexity analysis for discrete-state diffusion models.
method Developed a principled theoretical framework, decomposing score estimation error.
result Established sample complexity bound of O~(ε2)\widetilde{\mathcal{O}}(ε^{-2}).

Study approximates financial market with discrete-time models.

problem Approximating continuous-time financial market models with discrete-time.
method Constructs discrete-time market models with Markov switching and proves convergence.
result Discrete-time models converge to continuous-time Black-Scholes model with Markov switching.

This paper analyzes discrete diffusion models, deriving convergence bounds for their generated samples.

problem Theoretical guarantees for discrete-state diffusion models remain under-explored.
method Continuous Time Markov Chain (CTMC) framework and discrete-time sampling algorithm.
result Convergence bounds for KL divergence and TV distance are derived, showing linear dependence on dimension.

Unified framework for discrete diffusion modeling with flexible noising processes.

problem Efficient modeling of large discrete state spaces with arbitrary corruption dynamics.
method Generalized Discrete Diffusion from Snapshots (GDDS) framework that supports uniformization for fast noising and snapshot-based ELBO for reverse process.
result GDDS outperforms existing discrete diffusion methods in training efficiency and generation quality.

Paper analyzes symbolic-dynamics inspired Markov modeling for time-series data.

problem Capturing temporal patterns in sequential data for statistical learning.
method Two-step process: discretization of continuous attributes and estimation of temporal memory.
result Effective Markov modeling depends on accurate discretization and memory estimation.

Framework for training-free guidance in discrete diffusion models for molecular generation.

problem No equivalent training-free guidance methods for discrete diffusion models.
method Framework using guidance functions for discrete data.
result Demonstrated utility on molecular graph generation tasks.

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.

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.

New method boosts performance of diffusion models on discrete data like natural language.

problem Performance of diffusion models on discrete data like natural language is poor.
method Proposes score entropy, a novel loss that extends score matching to discrete spaces.
result Significantly boosts performance on language modeling tasks.

We present a mixed multinomial logit (MNL) model, which leverages the truncated stick-breaking process representation of the Dirichlet process as a flexible nonparametric mixing distribution. The proposed model is a Dirichlet process mixture model and accommodates discrete representations of heterogeneity, like a laten…

2018-01-19abs ↗pdf ↗

The present chapter gives an overview on results for discrete knot energies. These discrete energies are designed to make swift numerical computations and thus open the field to computational methods. Additionally, they provide an independent, geometrically pleasing and consistent discrete model that behaves similarly …

2016-03-08abs ↗pdf ↗

FLDD improves discrete diffusion models by learning a non-Markovian noising process.

problem Efficiency and quality of discrete diffusion models in few-step generation.
method Introduces a learnable non-Markovian forward (noising) process to match the target distribution.
result FLDD produces higher quality samples in fewer steps compared to conventional discrete diffusion models.

Gradient-based MCMC for discrete spaces improves sampling performance.

problem Sampling in discrete spaces using traditional methods is challenging.
method Introduced new discrete Metropolis-Hastings samplers inspired by MALA, with a novel preconditioning technique.
result Demonstrated strong empirical performance across various challenging sampling problems.

VADD enhances discrete diffusion models by capturing inter-dimensional correlations, improving sample quality.

problem Limited modeling of inter-dimensional dependencies in MDMs degrades performance with few denoising steps.
method Introduces an auxiliary recognition model for latent variable modeling, enabling stable training via variational lower bounds maximization and amortized inference.
result VADD consistently outperforms MDM baselines in sample quality with few denoising steps.

The local induction equation, or the binormal flow on space curves is a well-known model of deformation of space curves as it describes the dynamics of vortex filaments, and the complex curvature is governed by the nonlinear Schrödinger equation. In this paper, we present its discrete analogue, namely, a model of defor…

2017-08-05abs ↗pdf ↗

Continuous time framework for discrete data denoising models.

problem Efficient training and sampling for discrete data denoising models.
method Formulated as Continuous Time Markov Chains (CTMCs), efficient training using continuous time ELBO, high-dimensional CTMC simulation, novel theoretical error bound.
result Continuous time treatment enables novel theoretical error bound between generated and true data distributions.