The paper proves polynomial mixing time upper bounds for three data augmentation algorithms (ProbitDA, LogitDA, LassoDA) with explicit dependence on design matrix, prior, n, and d.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast Mixing of Data Augmentation Algorithms: Bayesian Probit, Logit, and Lasso Regression
The paper proves polynomial mixing time upper bounds for three data augmentation algorithms (ProbitDA, LogitDA, LassoDA) with explicit dependence on design matrix, prior, n, and d.