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.
Refined analysis of Mitra's algorithm for discrete mixtures.
A new method uncovers discrete and continuous factors in gene expression data.
Paper optimizes clustering for multi-layer networks and discrete mixtures.
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…
Two EM algorithms estimate prior distributions in mixture of linear regressions.
Paper develops a consistent estimator for discrete mixture models.
Feature selection can facilitate the learning of mixtures of discrete random variables as they arise, e.g. in crowdsourcing tasks. Intuitively, not all workers are equally reliable but, if the less reliable ones could be eliminated, then learning should be more robust. By analogy with Gaussian mixture models, we seek a…
A new method for categorical variational inference using discrete normalizing flows.
Plug-and-play L-GM-AMP improves CS recovery for any i.i.d. source prior.
We study the problem of learning a distribution from samples, when the underlying distribution is a mixture of product distributions over discrete domains. This problem is motivated by several practical applications such as crowd-sourcing, recommendation systems, and learning Boolean functions. The existing solutions e…
Paper proposes an algorithm for sampling from complex mixture distributions without requiring smoothness.
Recently developed techniques have made it possible to quickly learn accurate probability density functions from data in low-dimensional continuous space. In particular, mixtures of Gaussians can be fitted to data very quickly using an accelerated EM algorithm that employs multiresolution kd-trees (Moore, 1999). In thi…
Latent Dirichlet Allocation models discrete data as a mixture of discrete distributions, using Dirichlet beliefs over the mixture weights. We study a variation of this concept, in which the documents' mixture weight beliefs are replaced with squashed Gaussian distributions. This allows documents to be associated with e…
Improved vector quantization using Gaussian mixtures for better codebook utilization.
SDE automatically recovers interpretable discrete distributions.
Method estimates mixture components without discretizing parameters.
Two approaches improve parameter learning in various mixture models.
A new method learns quantization boundaries in continuous space using tessellation.
The likelihood function of a finite mixture model is a non-convex function with multiple local maxima and commonly used iterative algorithms such as EM will converge to different solutions depending on initial conditions. In this paper we ask: is it possible to assess how far we are from the global maximum of the likel…
This paper studies convergence behavior of latent mixing measures that arise in finite and infinite mixture models, using transportation distances (i.e., Wasserstein metrics). The relationship between Wasserstein distances on the space of mixing measures and f-divergence functionals such as Hellinger and Kullback-Leibl…
DIF extends NF with stochastic discrete latent variables for better density estimation.
New method extracts hidden phases in binary mixtures using tubular tilings.
Survival MDN uses invertible functions to speed up survival analysis models.
Criterion extends identifiability for continuous mixtures of kernels.
We consider unsupervised estimation of mixtures of discrete graphical models, where the class variable corresponding to the mixture components is hidden and each mixture component over the observed variables can have a potentially different Markov graph structure and parameters. We propose a novel approach for estimati…
Estimates Gaussian mixtures from weighted samples efficiently.
This paper is a step-by-step tutorial for fitting a mixture distribution to data. It merely assumes the reader has the background of calculus and linear algebra. Other required background is briefly reviewed before explaining the main algorithm. In explaining the main algorithm, first, fitting a mixture of two distribu…
We consider the problem of inference in discrete probabilistic models, that is, distributions over subsets of a finite ground set. These encompass a range of well-known models in machine learning, such as determinantal point processes and Ising models. Locally-moving Markov chain Monte Carlo algorithms, such as the Gib…
We derive relations between theoretical properties of restricted Boltzmann machines (RBMs), popular machine learning models which form the building blocks of deep learning models, and several natural notions from discrete mathematics and convex geometry. We give implications and equivalences relating RBM-representable …
We investigate the class of -stable Poisson-Kingman random probability measures (RPMs) in the context of Bayesian nonparametric mixture modeling. This is a large class of discrete RPMs which encompasses most of the the popular discrete RPMs used in Bayesian nonparametrics, such as the Dirichlet process, Pitman-Yor p…
This paper compares different DRO formulations for pension fund management.
In many applications, a finite mixture is a natural model, but it can be difficult to choose an appropriate number of components. To circumvent this choice, investigators are increasingly turning to Dirichlet process mixtures (DPMs), and Pitman-Yor process mixtures (PYMs), more generally. While these models may be well…
Paper proposes a method to speed up discrete diffusion models by distilling many steps into few.
New method selects relevant dimensions for better prediction in mixtures.
New method for summarizing Bayesian mixture models using sliced Wasserstein distances.
Paper detects gradual changes in cluster structure using MC fusion.
Finite mixture models have been used for unsupervised learning for some time, and their use within the semi-supervised paradigm is becoming more commonplace. Clickstream data is one of the various emerging data types that demands particular attention because there is a notable paucity of statistical learning approaches…
Improved density estimation for mixed discrete-continuous data.
Paper introduces new Gromov-type distances for comparing Gaussian mixture models.
A new method detects outliers using ensembles of Dirichlet process mixtures.
Bayesian framework uses context trees for efficient time series modeling.
We assume that a high-dimensional datum, like an image, is a compositional expression of a set of properties, with a complicated non-linear relationship between the datum and its properties. This paper proposes a factorial mixture prior for capturing latent properties, thereby adding structured compositionality to deep…
Training of discrete latent variable models remains challenging because passing gradient information through discrete units is difficult. We propose a new class of smoothing transformations based on a mixture of two overlapping distributions, and show that the proposed transformation can be used for training binary lat…
GMM-HMMs improve malware classification compared to discrete HMMs.
Paper analyzes Langevin dynamics for multimodal Gaussian mixtures, controlling errors across dimensions.
Generative models with both discrete and continuous latent variables are highly motivated by the structure of many real-world data sets. They present, however, subtleties in training often manifesting in the discrete latent being under leveraged. In this paper, we show that such models are more amenable to training whe…
Flexible models cluster RNA sequencing data.
Improved sample and time complexity for identifying mixtures of product distributions.