Minimum Volume Topic Modeling
원문 초록
We propose a new topic modeling procedure that takes advantage of the fact that the Latent Dirichlet Allocation (LDA) log likelihood function is asymptotically equivalent to the logarithm of the volume of the topic simplex. This allows topic modeling to be reformulated as finding the probability simplex that minimizes its volume and encloses the documents that are represented as distributions over words. A convex relaxation of the minimum volume topic model optimization is proposed, and it is shown that the relaxed problem has the same global minimum as the original problem under the separability assumption and the sufficiently scattered assumption introduced by Arora et al. (2013) and Huang et al. (2016). A locally convergent alternating direction method of multipliers (ADMM) approach is introduced for solving the relaxed minimum volume problem. Numerical experiments illustrate the benefits of our approach in terms of computation time and topic recovery performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
OpenDPDv2: A Unified Learning and Optimization Framework for Neural Network Digital Predistortion
FedRef: Communication-Efficient Bayesian Fine Tuning with Reference Model
G$^{2}$D: Boosting Multimodal Learning with Gradient-Guided Distillation
From Tiny Machine Learning to Tiny Deep Learning: A Survey
BotTrans: A Multi-Source Graph Domain Adaptation Approach for Social Bot Detection
GFRIEND: Generative Few-shot Reward Inference through EfficieNt DPO
토론
이 논문과 연결된 포럼 글이 아직 없습니다.