The growing need to analyze large collections of documents has led to great
developments in topic modeling. Since documents are frequently associated with
other related variables, such as labels or ratings, much interest has been
placed on supervised topic models. However, the nature of most annotation
tasks, prone to ambiguity and noise, often with high volumes of documents, deem
learning under a single-annotator assumption unrealistic or unpractical for
most real-world applications. In this article, we propose two supervised topic
models, one for classification and another for regression problems, which
account for the heterogeneity and biases among different annotators that are
encountered in practice when learning from crowds. We develop an efficient
stochastic variational inference algorithm that is able to scale to very large
datasets, and we empirically demonstrate the advantages of the proposed model
over state-of-the-art approaches.

本文提出了两种基于监督学习的主题模型，分别用于分类和回归，能够考虑到实践中在不同的标注者之间遇到的多样性和偏见。同时，我们还开发了一种有效的随机变分推断算法，能够适应非常大的数据集，并在实验中证明了该模型相对于现有技术的优越性。

基于众包的监督主题模型用于分类与回归学习

Learning Supervised Topic Models for Classification and Regression from  Crowds

Max-margin learning is a powerful approach to building classifiers and
structured output predictors. Recent work on max-margin supervised topic models
has successfully integrated it with Bayesian topic models to discover
discriminative latent semantic structures and make accurate predictions for
unseen testing data. However, the resulting learning problems are usually hard
to solve because of the non-smoothness of the margin loss. Existing approaches
to building max-margin supervised topic models rely on an iterative procedure
to solve multiple latent SVM subproblems with additional mean-field assumptions
on the desired posterior distributions. This paper presents an alternative
approach by defining a new max-margin loss. Namely, we present Gibbs max-margin
supervised topic models, a latent variable Gibbs classifier to discover hidden
topic representations for various tasks, including classification, regression
and multi-task learning. Gibbs max-margin supervised topic models minimize an
expected margin loss, which is an upper bound of the existing margin loss
derived from an expected prediction rule. By introducing augmented variables
and integrating out the Dirichlet variables analytically by conjugacy, we
develop simple Gibbs sampling algorithms with no restricting assumptions and no
need to solve SVM subproblems. Furthermore, each step of the
"augment-and-collapse" Gibbs sampling algorithms has an analytical conditional
distribution, from which samples can be easily drawn. Experimental results
demonstrate significant improvements on time efficiency. The classification
performance is also significantly improved over competitors on binary,
multi-class and multi-label classification tasks.

本文提出了 Gibbs max-margin 监督主题模型的新型损失函数，通过引入增广变量和解析地消除 Dirichlet 变量，从而开发了简单的 Gibbs 抽样算法以解决多个潜在 SVM 子问题，且无需限制假设和解决 SVM 子问题，从而在许多分类任务中实现了时间效率和分类性能的显着提高。

具有数据增强的 Gibbs 最大裕度主题模型

Gibbs Max-margin Topic Models with Data Augmentation

Supervised topic models with a logistic likelihood have two issues that
potentially limit their practical use: 1) response variables are usually
over-weighted by document word counts; and 2) existing variational inference
methods make strict mean-field assumptions. We address these issues by: 1)
introducing a regularization constant to better balance the two parts based on
an optimization formulation of Bayesian inference; and 2) developing a simple
Gibbs sampling algorithm by introducing auxiliary Polya-Gamma variables and
collapsing out Dirichlet variables. Our augment-and-collapse sampling algorithm
has analytical forms of each conditional distribution without making any
restricting assumptions and can be easily parallelized. Empirical results
demonstrate significant improvements on prediction performance and time
efficiency.

本文介绍使用正则化常量和 Gibbs 采样算法的辅助泊松 - 伽马变量，增强 PF 主题模型的性能。实证结果表明，该算法可以显著提高预测性能和时间效率