English
Related papers

Related papers: Blocking Collapsed Gibbs Sampler for Latent Dirich…

200 papers

Generating user interpretable multi-class predictions in data rich environments with many classes and explanatory covariates is a daunting task. We introduce Diagonal Orthant Latent Dirichlet Allocation (DOLDA), a supervised topic model for…

Machine Learning · Statistics 2016-10-21 Måns Magnusson , Leif Jonsson , Mattias Villani

To solve the big topic modeling problem, we need to reduce both time and space complexities of batch latent Dirichlet allocation (LDA) algorithms. Although parallel LDA algorithms on the multi-processor architecture have low time and space…

Machine Learning · Computer Science 2013-11-19 Jian-Feng Yan , Jia Zeng , Zhi-Qiang Liu , Yang Gao

Distributed lag models (DLMs) express the cumulative and delayed dependence between pairs of time-indexed response and explanatory variables. In practical application, users of DLMs examine the estimated influence of a series of lagged…

Applications · Statistics 2018-01-23 Alastair Rushworth

Diffusion large language models (dLLMs) have emerged as a promising alternative for text generation, distinguished by their native support for parallel decoding. In practice, block inference is crucial for avoiding order misalignment in…

Computation and Language · Computer Science 2026-03-17 Lizhuo Luo , Shenggui Li , Yonggang Wen , Tianwei Zhang

Probabilistic linear discriminant analysis (PLDA) has broad application in open-set verification tasks, such as speaker verification. A key concern for PLDA is that the model is too simple (linear Gaussian) to deal with complicated data;…

Sound · Computer Science 2021-11-25 Di Wang , Lantian Li , Hongzhi Yu , Dong Wang

Supervised topic models can help clinical researchers find interpretable cooccurence patterns in count data that are relevant for diagnostics. However, standard formulations of supervised Latent Dirichlet Allocation have two problems.…

Machine Learning · Statistics 2016-12-07 Michael C. Hughes , Huseyin Melih Elibol , Thomas McCoy , Roy Perlis , Finale Doshi-Velez

We introduce efficient parallel algorithms for sampling from the Gibbs distribution and estimating the partition function of Ising models. These algorithms achieve parallel efficiency, with polylogarithmic depth and polynomial total work,…

Data Structures and Algorithms · Computer Science 2025-05-09 Xiaoyu Chen , Hongyang Liu , Yitong Yin , Xinyuan Zhang

In this technical report, we present jLDADMM---an easy-to-use Java toolkit for conventional topic models. jLDADMM is released to provide alternatives for topic modeling on normal or short texts. It provides implementations of the Latent…

Information Retrieval · Computer Science 2018-08-14 Dat Quoc Nguyen

Sampling-based algorithms are classical approaches to perform Bayesian inference in inverse problems. They provide estimators with the associated credibility intervals to quantify the uncertainty on the estimators. Although these methods…

Methodology · Statistics 2023-11-28 Pierre-Antoine Thouvenin , Audrey Repetti , Pierre Chainais

Dynamic structural equation modeling (DSEM) is widely used for analyzing intensive longitudinal data (ILD). Although many ILD have categorical (Bernoulli or binomially distributed) responses, currently available Metropolis-within-Gibbs…

Computation · Statistics 2026-04-01 Øystein Sørensen , Ethan M. McCormick

In supervised speech separation, permutation invariant training (PIT) is widely used to handle label ambiguity by selecting the best permutation to update the model. Despite its success, previous studies showed that PIT is plagued by…

Sound · Computer Science 2023-11-22 Chenyang Gao , Yue Gu , Ivan Marsic

Sparse regression based on global-local shrinkage priors are increasingly used for Bayesian modeling of modern high-dimensional data, but scaling up the Gibbs sampler for posterior inference remains a challenge. While much effort has gone…

Methodology · Statistics 2026-05-08 Andrew Chin , Xiyu Ding , Akihiko Nishimura

We study parameter inference in large-scale latent variable models. We first propose an unified treatment of online inference for latent variable models from a non-canonical exponential family, and draw explicit links between several…

Machine Learning · Computer Science 2018-02-01 Christophe Dupuy , Francis Bach

We consider the problem of sampling from constrained distributions, which has posed significant challenges to both non-asymptotic analysis and algorithmic design. We propose a unified framework, which is inspired by the classical mirror…

Machine Learning · Computer Science 2021-01-01 Ya-Ping Hsieh , Ali Kavis , Paul Rolland , Volkan Cevher

Improving the effectiveness and efficiency of large language models (LLMs) simultaneously is a critical yet challenging research goal. In this paper, we find that low-rank pre-training, normally considered as efficient methods that will…

Computation and Language · Computer Science 2024-11-05 Xingtai Lv , Ning Ding , Kaiyan Zhang , Ermo Hua , Ganqu Cui , Bowen Zhou

Cognitive modeling commonly relies on asking participants to complete a battery of varied tests in order to estimate attention, working memory, and other latent variables. In many cases, these tests result in highly variable observation…

We study a parametric family of latent variable models, namely topic models, equipped with a hierarchical structure among the topic variables. Such models may be viewed as a finite mixture of the latent Dirichlet allocation (LDA) induced…

Statistics Theory · Mathematics 2024-08-27 Sunrit Chakraborty , Rayleigh Lei , XuanLong Nguyen

Medical image segmentation requires models that preserve fine anatomical boundaries while remaining practical for clinical deployment. Transformers capture long-range dependencies but incur quadratic attention cost, whereas CNNs are…

Computer Vision and Pattern Recognition · Computer Science 2026-05-04 Hongbo Zheng , Afshin Bozorgpour , Dorit Merhof , Minjia Zhang

Masked diffusion language models (MDLMs) promise fast, non-autoregressive text generation, yet existing samplers, which pick tokens to unmask based on model confidence, ignore interactions when unmasking multiple positions in parallel and…

Computation and Language · Computer Science 2026-05-26 Omer Luxembourg , Haim Permuter , Eliya Nachmani

Balancing between computational efficiency and sample efficiency is an important goal in reinforcement learning. Temporal difference (TD) learning algorithms stochastically update the value function, with a linear time complexity in the…

Machine Learning · Computer Science 2016-11-21 Clement Gehring , Yangchen Pan , Martha White