{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:51:35Z","timestamp":1791323495286,"version":"4.3.1"},"reference-count":91,"publisher":"Institute of Mathematical Statistics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Statist."],"published-print":{"date-parts":[[2026,8,1]]},"abstract":"<jats:p>We propose using a modified conductance-based method to study the mixing time of an important class of two-block Gibbs samplers, the data augmentation (DA) algorithm. Using this method, we prove the first non-asymptotic polynomial upper bounds on mixing times of three important DA algorithms: DA algorithms for Bayesian Probit regression (ProbitDA) and Bayesian Logit regression (LogitDA), and Bayesian Lasso Regression (LassoDA). Concretely, for ProbitDA and LogitDA, we demonstrate a tight bound that explicitly depends on the design matrix and prior covariance matrix. Under the assumption that data are independently generated from either a sub-Gaussian or log-concave distribution and properly scaled, the bound implies that with \u03b7-warm start, parameter dimension d, and sample size n, with high probability over data, the two algorithms require O(nlog( log\u03b7 \u03f5)) steps to obtain samples with at most \u03f5 error in TV, KL or \u03c72 distance. Meanwhile, we show that under minimal data assumptions, LassoDA requires O(d2(dlogd+nlogn)2log(\u03b7 \u03f5)) steps to achieve \u03f5-accuracy in TV distance. The results are generally applicable to settings with large n and large d, including settings with highly imbalanced response data in Probit and Logit regression. We compare them with the best known guarantees of Langevin Monte Carlo and Metropolis Adjusted Langevin Algorithm. We evaluate our theoretical results using numerical examples, and discuss the mixing times of the three algorithms under feasible initialization.<\/jats:p>","DOI":"10.1214\/26-aos2641","type":"journal-article","created":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T08:19:56Z","timestamp":1787041196000},"page":"2083-2109","source":"Crossref","is-referenced-by-count":0,"title":["Fast mixing of data augmentation algorithms: Bayesian probit, logit and lasso regression"],"prefix":"10.1214","volume":"54","author":[{"given":"Holden","family":"Lee","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kexin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"108","reference":[{"key":"75","doi-asserted-by":"crossref","unstructured":"<small>Rosenthal, J. S.<\/small> (1995). Minorization conditions and convergence rates for Markov chain Monte Carlo. <i>J. Amer. Statist. Assoc.<\/i> <b>90<\/b> 558\u2013566.","DOI":"10.1080\/01621459.1995.10476548"},{"key":"3","doi-asserted-by":"crossref","unstructured":"<small>Albert, J. H.<\/small> and <small>Chib, S.<\/small> (1993). Bayesian analysis of binary and polychotomous response data. <i>J. Amer. Statist. Assoc.<\/i> <b>88<\/b> 669\u2013679.","DOI":"10.1080\/01621459.1993.10476321"},{"key":"15","unstructured":"<small>Chen, Y.<\/small>, <small>Dwivedi, R.<\/small>, <small>Wainwright, M. J.<\/small> and <small>Yu, B.<\/small> (2020). Fast mixing of metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients. <i>J. Mach. Learn. Res.<\/i> <b>21<\/b> Paper No. 92."},{"key":"35","doi-asserted-by":"publisher","unstructured":"<small>Holley, R.<\/small> and <small>Stroock, D.<\/small> (1987). Logarithmic Sobolev inequalities and stochastic Ising models. <i>J. Stat. Phys.<\/i> <b>46<\/b> 1159\u20131194.","DOI":"10.1007\/BF01011161"},{"key":"38","doi-asserted-by":"publisher","unstructured":"<small>JOHNDROW, J. E.<\/small>, <small>SMITH, A.<\/small>, <small>PILLAI, N.<\/small> and <small>DUNSON, D. B.<\/small> (2019). MCMC for imbalanced categorical data. <i>J. Amer. Statist. Assoc.<\/i> <b>114<\/b> 1394\u20131403.","DOI":"10.1080\/01621459.2018.1505626"},{"key":"70","doi-asserted-by":"publisher","unstructured":"<small>QIN, Q.<\/small> and <small>HOBERT, J. P.<\/small> (2021). On the limitations of single-step drift and minorization in Markov chain convergence analysis. <i>Ann. Appl. Probab.<\/i> <b>31<\/b> 1633\u20131659.","DOI":"10.1214\/20-AAP1628"},{"key":"74","doi-asserted-by":"publisher","unstructured":"<small>ROBERTS, G. O.<\/small> and <small>ROSENTHAL, J. S.<\/small> (2001). Markov chains and de-initializing processes. <i>Scand. J. Stat.<\/i> <b>28<\/b> 489\u2013504.","DOI":"10.1111\/1467-9469.00250"},{"key":"76","doi-asserted-by":"publisher","unstructured":"<small>ROY, V.<\/small> and <small>HOBERT, J. P.<\/small> (2007). Convergence rates and asymptotic standard errors for Markov chain Monte Carlo algorithms for Bayesian probit regression. <i>J. R. Stat. Soc. Ser. B. Stat. Methodol.<\/i> <b>69<\/b> 607\u2013623.","DOI":"10.1111\/j.1467-9868.2007.00602.x"},{"key":"9","doi-asserted-by":"publisher","unstructured":"<small>BOBKOV, S. G.<\/small> (1999). Isoperimetric and analytic inequalities for log-concave probability measures. <i>Ann. Probab.<\/i> <b>27<\/b> 1903\u20131921.","DOI":"10.1214\/aop\/1022874820"},{"key":"56","doi-asserted-by":"publisher","unstructured":"<small>LOV\u00c1SZ, L.<\/small> and <small>VEMPALA, S.<\/small> (2007). The geometry of logconcave functions and sampling algorithms. <i>Random Structures Algorithms<\/i> <b>30<\/b> 307\u2013358.","DOI":"10.1002\/rsa.20135"},{"key":"62","doi-asserted-by":"publisher","unstructured":"<small>MILMAN, E.<\/small> and <small>SODIN, S.<\/small> (2008). An isoperimetric inequality for uniformly log-concave measures and uniformly convex bodies. <i>J. Funct. Anal.<\/i> <b>254<\/b> 1235\u20131268.","DOI":"10.1016\/j.jfa.2007.12.002"},{"key":"12","doi-asserted-by":"publisher","unstructured":"<small>CATTIAUX, P.<\/small> and <small>GUILLIN, A.<\/small> (2020). On the Poincar\u00e9 constant of log-concave measures. In <i>Geometric Aspects of Functional Analysis. Vol. I<\/i>. <i>Lecture Notes in Math.<\/i> <b>2256<\/b> 171\u2013217. Springer, Cham.","DOI":"10.1007\/978-3-030-36020-7_9"},{"key":"91","doi-asserted-by":"publisher","unstructured":"<small>ZHANG, Z.<\/small>, <small>SINHA, S.<\/small>, <small>MAITI, T.<\/small> and <small>SHIPP, E.<\/small> (2018). Bayesian variable selection in the accelerated failure time model with an application to the surveillance, epidemiology, and end results breast cancer data. <i>Stat. Methods Med. Res.<\/i> <b>27<\/b> 971\u2013990.","DOI":"10.1177\/0962280215626947"},{"key":"29","doi-asserted-by":"publisher","unstructured":"<small>FR\u00dcHWIRTH-SCHNATTER, S.<\/small> and <small>FR\u00dcHWIRTH, R.<\/small> (2007). Auxiliary mixture sampling with applications to logistic models. <i>Comput. Statist. Data Anal.<\/i> <b>51<\/b> 3509\u20133528.","DOI":"10.1016\/j.csda.2006.10.006"},{"key":"2","doi-asserted-by":"publisher","unstructured":"<small>ADAMCZAK, R.<\/small>, <small>LITVAK, A. E.<\/small>, <small>PAJOR, A.<\/small> and <small>TOMCZAK-JAEGERMANN, N.<\/small> (2011). Sharp bounds on the rate of convergence of the empirical covariance matrix. <i>C. R. Math. Acad. Sci. Paris<\/i> <b>349<\/b> 195\u2013200.","DOI":"10.1016\/j.crma.2010.12.014"},{"key":"37","doi-asserted-by":"publisher","unstructured":"<small>JERRUM, M.<\/small> and <small>SINCLAIR, A.<\/small> (1989). Approximating the permanent. <i>SIAM J. Comput.<\/i> <b>18<\/b> 1149\u20131178.","DOI":"10.1137\/0218077"},{"key":"17","doi-asserted-by":"publisher","unstructured":"<small>CHOI, H. M.<\/small> and <small>HOBERT, J. P.<\/small> (2013). The Polya-gamma Gibbs sampler for Bayesian logistic regression is uniformly ergodic. <i>Electron. J. Stat.<\/i> <b>7<\/b> 2054\u20132064.","DOI":"10.1214\/13-EJS837"},{"key":"44","doi-asserted-by":"publisher","unstructured":"<small>KHARE, K.<\/small> and <small>HOBERT, J. P.<\/small> (2013). Geometric ergodicity of the Bayesian lasso. <i>Electron. J. Stat.<\/i> <b>7<\/b> 2150\u20132163.","DOI":"10.1214\/13-EJS841"},{"key":"55","doi-asserted-by":"publisher","unstructured":"<small>LOV\u00c1SZ, L.<\/small> and <small>VEMPALA, S.<\/small> (2004). Hit-and-run from a corner. In <i>Proceedings of the<\/i> 36<i>th Annual ACM Symposium on Theory of Computing<\/i> 310\u2013314. ACM, New York.","DOI":"10.1145\/1007352.1007403"},{"key":"69","doi-asserted-by":"publisher","unstructured":"<small>QIN, Q.<\/small> and <small>HOBERT, J. P.<\/small> (2019). Convergence complexity analysis of Albert and Chib\u2019s algorithm for Bayesian probit regression. <i>Ann. Statist.<\/i> <b>47<\/b> 2320\u20132347.","DOI":"10.1214\/18-AOS1749"},{"key":"33","doi-asserted-by":"publisher","unstructured":"<small>HANS, C.<\/small> (2009). Bayesian lasso regression. <i>Biometrika<\/i> <b>96<\/b> 835\u2013845.","DOI":"10.1093\/biomet\/asp047"},{"key":"79","doi-asserted-by":"publisher","unstructured":"<small>Simpson, D.<\/small>, <small>Rue, H.<\/small>, <small>Riebler, A.<\/small>, <small>Martins, T. G.<\/small> and <small>S\u00d8rbye, S. H.<\/small> (2017). Penalising model component complexity: A principled, practical approach to constructing priors. <i>Statist. Sci.<\/i> <b>32<\/b> 1\u201328.","DOI":"10.1214\/16-STS576"},{"key":"51","doi-asserted-by":"publisher","unstructured":"<small>Liu, J. S.<\/small>, <small>Wong, W. H.<\/small> and <small>Kong, A.<\/small> (1994). Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes. <i>Biometrika<\/i> <b>81<\/b> 27\u201340.","DOI":"10.1093\/biomet\/81.1.27"},{"key":"28","doi-asserted-by":"publisher","unstructured":"<small>ELDAN, R.<\/small> (2013). Thin shell implies spectral gap up to polylog via a stochastic localization scheme. <i>Geom. Funct. Anal.<\/i> <b>23<\/b> 532\u2013569.","DOI":"10.1007\/s00039-013-0214-y"},{"key":"36","doi-asserted-by":"publisher","unstructured":"<small>HOLMES, C. C.<\/small> and <small>HELD, L.<\/small> (2006). Bayesian auxiliary variable models for binary and multinomial regression. <i>Bayesian Anal.<\/i> <b>1<\/b> 145\u2013168.","DOI":"10.1214\/06-BA105"},{"key":"50","doi-asserted-by":"publisher","unstructured":"<small>Levin, D. A.<\/small> and <small>Peres, Y.<\/small> (2017). <i>Markov Chains and Mixing Times<\/i>. Amer. Math. Soc., Providence, RI.","DOI":"10.1090\/mbk\/107"},{"key":"1","doi-asserted-by":"publisher","unstructured":"<small>Adamczak, R.<\/small>, <small>Litvak, A. E.<\/small>, <small>Pajor, A.<\/small> and <small>Tomczak-Jaegermann, N.<\/small> (2010). Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles. <i>J. Amer. Math. Soc.<\/i> <b>23<\/b> 535\u2013561.","DOI":"10.1090\/S0894-0347-09-00650-X"},{"key":"27","doi-asserted-by":"publisher","unstructured":"<small>Dyer, M.<\/small>, <small>Frieze, A.<\/small> and <small>Kannan, R.<\/small> (1991). A random polynomial-time algorithm for approximating the volume of convex bodies. <i>J. Assoc. Comput. Mach.<\/i> <b>38<\/b> 1\u201317.","DOI":"10.1145\/102782.102783"},{"key":"67","doi-asserted-by":"publisher","unstructured":"<small>Park, T.<\/small> and <small>Casella, G.<\/small> (2008). The Bayesian lasso. <i>J. Amer. Statist. Assoc.<\/i> <b>103<\/b> 681\u2013686.","DOI":"10.1198\/016214508000000337"},{"key":"34","doi-asserted-by":"crossref","unstructured":"<small>Hobert, J. P.<\/small> (2011). The data augmentation algorithm: Theory and methodology. In <i>Handbook of Markov Chain Monte Carlo<\/i>. <i>Chapman &amp; Hall\/CRC Handb. Mod. Stat. Methods<\/i> 253\u2013293. CRC Press, Boca Raton, FL.","DOI":"10.1201\/b10905-11"},{"key":"39","doi-asserted-by":"publisher","unstructured":"<small>Jones, G. L.<\/small> and <small>Hobert, J. P.<\/small> (2001). Honest exploration of intractable probability distributions via Markov chain Monte Carlo. <i>Statist. Sci.<\/i> <b>16<\/b> 312\u2013334.","DOI":"10.1214\/ss\/1015346317"},{"key":"87","doi-asserted-by":"publisher","unstructured":"<small>Vershynin, R.<\/small> (2018). <i>High-Dimensional Probability<\/i>: <i>An Introduction with Applications in Data Science<\/i>. <i>Cambridge Series in Statistical and Probabilistic Mathematics<\/i> <b>47<\/b>. Cambridge Univ. Press, Cambridge.","DOI":"10.1017\/9781108231596"},{"key":"68","doi-asserted-by":"publisher","unstructured":"<small>Polson, N. G.<\/small>, <small>Scott, J. G.<\/small> and <small>Windle, J.<\/small> (2013). Bayesian inference for logistic models using P\u00f3lya-Gamma latent variables. <i>J. Amer. Statist. Assoc.<\/i> <b>108<\/b> 1339\u20131349.","DOI":"10.1080\/01621459.2013.829001"},{"key":"83","doi-asserted-by":"crossref","unstructured":"<small>Tanner, M. A.<\/small> and <small>Wong, W. H.<\/small> (1987). The calculation of posterior distributions by data augmentation. <i>J. Amer. Statist. Assoc.<\/i> <b>82<\/b> 528\u2013550.","DOI":"10.1080\/01621459.1987.10478458"},{"key":"26","unstructured":"<small>DWIVEDI, R.<\/small>, <small>CHEN, Y.<\/small>, <small>WAINWRIGHT, M. J.<\/small> and <small>YU, B.<\/small> (2019). Log-concave sampling: Metropolis\u2013Hastings algorithms are fast. <i>J. Mach. Learn. Res.<\/i> <b>20<\/b> Paper No. 183."},{"key":"58","doi-asserted-by":"publisher","unstructured":"<small>MANGOUBI, O.<\/small> and <small>SMITH, A.<\/small> (2021). Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: Continuous dynamics. <i>Ann. Appl. Probab.<\/i> <b>31<\/b> 2019\u20132045.","DOI":"10.1214\/20-aap1640"},{"key":"61","doi-asserted-by":"publisher","unstructured":"<small>MILMAN, E.<\/small> (2012). Properties of isoperimetric, functional and transport-entropy inequalities via concentration. <i>Probab. Theory Related Fields<\/i> <b>152<\/b> 475\u2013507.","DOI":"10.1007\/s00440-010-0328-1"},{"key":"53","doi-asserted-by":"publisher","unstructured":"<small>LOV\u00c1SZ, L.<\/small> and <small>SIMONOVITS, M.<\/small> (1993). Random walks in a convex body and an improved volume algorithm. <i>Random Structures Algorithms<\/i> <b>4<\/b> 359\u2013412.","DOI":"10.1002\/rsa.3240040402"},{"key":"71","doi-asserted-by":"publisher","unstructured":"<small>QIN, Q.<\/small> and <small>HOBERT, J. P.<\/small> (2022). Wasserstein-based methods for convergence complexity analysis of MCMC with applications. <i>Ann. Appl. Probab.<\/i> <b>32<\/b> 124\u2013166.","DOI":"10.1214\/21-aap1673"},{"key":"72","unstructured":"<small>RAJARATNAM, B.<\/small> and <small>SPARKS, D.<\/small> (2015). MCMC-based inference in the era of big data: A fundamental analysis of the convergence complexity of high-dimensional chains. arXiv preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1508.00947\">1508.00947<\/a>."},{"key":"25","doi-asserted-by":"publisher","unstructured":"<small>DVORZAK, M.<\/small> and <small>WAGNER, H.<\/small> (2016). Sparse Bayesian modelling of underreported count data. <i>Stat. Model.<\/i> <b>16<\/b> 24\u201346.","DOI":"10.1177\/1471082X15588398"},{"key":"10","doi-asserted-by":"publisher","unstructured":"<small>BOBKOV, S. G.<\/small> and <small>HOUDR\u00c9, C.<\/small> (1997). Isoperimetric constants for product probability measures. <i>Ann. Probab.<\/i> <b>25<\/b> 184\u2013205.","DOI":"10.1214\/aop\/1024404284"},{"key":"23","doi-asserted-by":"crossref","unstructured":"<small>DIEBOLT, J.<\/small> and <small>ROBERT, C. P.<\/small> (1994). Estimation of finite mixture distributions through Bayesian sampling. <i>J. Roy. Statist. Soc. Ser. B, Methodol.<\/i> <b>56<\/b> 363\u2013375.","DOI":"10.1111\/j.2517-6161.1994.tb01985.x"},{"key":"84","doi-asserted-by":"crossref","unstructured":"<small>TIBSHIRANI, R.<\/small> (1996). Regression shrinkage and selection via the lasso. <i>J. Roy. Statist. Soc. Ser. B, Methodol.<\/i> <b>58<\/b> 267\u2013288.","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"52","doi-asserted-by":"publisher","unstructured":"<small>LOV\u00c1SZ, L.<\/small> (1999). Hit-and-run mixes fast. <i>Math. Program.<\/i> <b>86<\/b> 443\u2013461.","DOI":"10.1007\/s101070050099"},{"key":"24","doi-asserted-by":"publisher","unstructured":"<small>DURANTE, D.<\/small> and <small>DUNSON, D. B.<\/small> (2018). Bayesian inference and testing of group differences in brain networks. <i>Bayesian Anal.<\/i> <b>13<\/b> 29\u201358.","DOI":"10.1214\/16-BA1030"},{"key":"4","doi-asserted-by":"publisher","unstructured":"<small>ALONSO-GUTI\u00c9RREZ, D.<\/small> and <small>BASTERO, J.<\/small> (2015). <i>Approaching the Kannan-Lov\u00e1sz-Simonovits and Variance Conjectures<\/i>. <i>Lecture Notes in Math.<\/i> <b>2131<\/b>. Springer, Cham.","DOI":"10.1007\/978-3-319-13263-1"},{"key":"5","doi-asserted-by":"crossref","unstructured":"<small>ANDREWS, D. F.<\/small> and <small>MALLOWS, C. L.<\/small> (1974). Scale mixtures of normal distributions. <i>J. Roy. Statist. Soc. Ser. B, Methodol.<\/i> <b>36<\/b> 99\u2013102.","DOI":"10.1111\/j.2517-6161.1974.tb00989.x"},{"key":"6","unstructured":"<small>ASCOLANI, F.<\/small>, <small>LAVENANT, H.<\/small> and <small>ZANELLA, G.<\/small> (2024). Entropy contraction of the Gibbs sampler under log-concavity. arXiv Preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2410.00858\">2410.00858<\/a>."},{"key":"7","unstructured":"<small>BARTHE, F.<\/small> and <small>KLARTAG, B.<\/small> (2020). Spectral gaps, symmetries and log-concave perturbations. <i>Bull. Hellenic Math. Soc.<\/i> <b>64<\/b> 1\u201331."},{"key":"8","doi-asserted-by":"publisher","unstructured":"<small>BARTHE, F.<\/small> and <small>MILMAN, E.<\/small> (2013). Transference principles for log-Sobolev and spectral-gap with applications to conservative spin systems. <i>Comm. Math. Phys.<\/i> <b>323<\/b> 575\u2013625.","DOI":"10.1007\/s00220-013-1782-2"},{"key":"14","unstructured":"<small>CHEN, Y.<\/small>, <small>DWIVEDI, R.<\/small>, <small>WAINWRIGHT, M. J.<\/small> and <small>YU, B.<\/small> (2018). Fast MCMC sampling algorithms on polytopes. <i>J. Mach. Learn. Res.<\/i> <b>19<\/b> Paper No. 55."},{"key":"16","unstructured":"<small>CHEWI, S.<\/small> (2023). Log-concave sampling. Book Draft Available at <a href=\"https:\/\/chewisinho.github.io\">https:\/\/chewisinho.github.io<\/a>."},{"key":"18","doi-asserted-by":"crossref","unstructured":"<small>COHEN, A.<\/small> and <small>EINAV, L.<\/small> (2007). Estimating risk preferences from deductible choice. <i>Amer. Econ. Rev.<\/i> <b>97<\/b> 745\u2013788.","DOI":"10.1257\/aer.97.3.745"},{"key":"19","doi-asserted-by":"publisher","unstructured":"<small>COURTADE, T. A.<\/small> (2020). Bounds on the Poincar\u00e9 constant for convolution measures. <i>Ann. Inst. Henri Poincar\u00e9 Probab. Stat.<\/i> <b>56<\/b> 566\u2013579.","DOI":"10.1214\/19-AIHP973"},{"key":"20","doi-asserted-by":"publisher","unstructured":"<small>COUSINS, B.<\/small> and <small>VEMPALA, S.<\/small> (2014). A cubic algorithm for computing Gaussian volume. In <i>Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms<\/i> 1215\u20131228. ACM, New York.","DOI":"10.1137\/1.9781611973402.90"},{"key":"21","unstructured":"<small>DAI, Y.<\/small>, <small>GAO, Y.<\/small>, <small>HUANG, J.<\/small>, <small>JIAO, Y.<\/small>, <small>KANG, L.<\/small> and <small>LIU, J.<\/small> (2023). Lipschitz Transport Maps via the Follmer Flow. arXiv Preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2309.03490\">2309.03490<\/a>."},{"key":"22","unstructured":"<small>DALALYAN, A.<\/small> (2017). Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent. In <i>Conference on Learning Theory<\/i> 678\u2013689. PMLR."},{"key":"30","doi-asserted-by":"publisher","unstructured":"<small>FUGLSTAD, G.-A.<\/small>, <small>HEM, I. G.<\/small>, <small>KNIGHT, A.<\/small>, <small>RUE, H.<\/small> and <small>RIEBLER, A.<\/small> (2020). Intuitive joint priors for variance parameters. <i>Bayesian Anal.<\/i> <b>15<\/b> 1109\u20131137.","DOI":"10.1214\/19-BA1185"},{"key":"31","unstructured":"<small>GRANT, E. H. C.<\/small>, <small>MILLER, D. A.<\/small>, <small>SCHMIDT, B. R.<\/small>, <small>ADAMS, M. J.<\/small>, <small>AMBURGEY, S. M.<\/small>, <small>CHAMBERT, T.<\/small>, <small>CRUICKSHANK, S. S.<\/small>, <small>FISHER, R. N.<\/small>, <small>GREEN, D. M.<\/small> et al. (2016). Quantitative evidence for the effects of multiple drivers on continental-scale amphibian declines. <i>Sci. Rep.<\/i> <b>6<\/b> 25625."},{"key":"32","doi-asserted-by":"publisher","unstructured":"<small>GRIFFIN, J. E.<\/small>, <small>MATECHOU, E.<\/small>, <small>BUXTON, A. S.<\/small>, <small>BORMPOUDAKIS, D.<\/small> and <small>GRIFFITHS, R. A.<\/small> (2020). Modelling environmental DNA data; Bayesian variable selection accounting for false positive and false negative errors. <i>J. R. Stat. Soc<\/i>., <i>Ser. C, Appl. Stat.<\/i> <b>69<\/b> 377\u2013392.","DOI":"10.1111\/rssc.12390"},{"key":"40","doi-asserted-by":"crossref","unstructured":"<small>JOSEPH, L.<\/small>, <small>GYORKOS, T. W.<\/small> and <small>COUPAL, L.<\/small> (1995). Bayesian estimation of disease prevalence and the parameters of diagnostic tests in the absence of a gold standard. <i>Amer. J. Epidemiol.<\/i> <b>141<\/b> 263\u2013272.","DOI":"10.1093\/oxfordjournals.aje.a117428"},{"key":"41","doi-asserted-by":"crossref","unstructured":"<small>JUSTINIANO, A.<\/small> and <small>PRIMICERI, G. E.<\/small> (2008). The time-varying volatility of macroeconomic fluctuations. <i>Amer. Econ. Rev.<\/i> <b>98<\/b> 604\u2013641.","DOI":"10.1257\/aer.98.3.604"},{"key":"43","doi-asserted-by":"publisher","unstructured":"<small>KANNAN, R.<\/small>, <small>LOV\u00c1SZ, L.<\/small> and <small>SIMONOVITS, M.<\/small> (1997). Random walks and an <math xmlns=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\" id=\"eq_4\"><msup><mrow><mi mathvariant=\"italic\">O<\/mi><\/mrow><mrow><mo>\u2217<\/mo><\/mrow><\/msup><mo fence=\"true\" stretchy=\"false\">(<\/mo><msup><mrow><mi mathvariant=\"italic\">n<\/mi><\/mrow><mrow><mn>5<\/mn><\/mrow><\/msup><mo fence=\"true\" stretchy=\"false\">)<\/mo><\/math> volume algorithm for convex bodies. <i>Random Structures Algorithms<\/i> <b>11<\/b> 1\u201350.","DOI":"10.1002\/(SICI)1098-2418(199708)11:1<1::AID-RSA1>3.0.CO;2-X"},{"key":"46","doi-asserted-by":"publisher","unstructured":"<small>KLARTAG, B.<\/small> (2023). Logarithmic bounds for isoperimetry and slices of convex sets. <i>Ars Inven. Anal.<\/i> Paper No. 4.","DOI":"10.15781\/jsjy-0b06"},{"key":"47","unstructured":"<small>KOLESNIKOV, A. V.<\/small> (2011). Mass transportation and contractions. arXiv Preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1103.1479\">1103.1479<\/a>."},{"key":"48","doi-asserted-by":"crossref","unstructured":"<small>LEE, H.<\/small> and <small>ZHANG, K.<\/small> (2026). Supplement to \u201cFast mixing of data augmentation algorithms: Bayesian probit, logit and lasso regression.\u201d <a href=\"https:\/\/doi.org\/10.1214\/26-AOS2641SUPPA\">https:\/\/doi.org\/10.1214\/26-AOS2641SUPPA<\/a>, <a href=\"https:\/\/doi.org\/10.1214\/26-AOS2641SUPPB\">https:\/\/doi.org\/10.1214\/26-AOS2641SUPPB<\/a>","DOI":"10.1214\/26-AOS2641SUPPB"},{"key":"49","doi-asserted-by":"publisher","unstructured":"<small>LEE, Y. T.<\/small> and <small>VEMPALA, S. S.<\/small> (2017). Eldan\u2019s stochastic localization and the KLS hyperplane conjecture: An improved lower bound for expansion. In 58<i>th Annual IEEE Symposium on Foundations of Computer Science\u2014FOCS<\/i> 2017 998\u20131007. IEEE Computer Soc., Los Alamitos, CA.","DOI":"10.1109\/FOCS.2017.96"},{"key":"54","unstructured":"<small>LOV\u00c1SZ, L.<\/small> and <small>VEMPALA, S.<\/small> (2004). Hit-and-run is fast and fun. Available at <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/02\/tr-2003-05.pdf\">https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/02\/tr-2003-05.pdf<\/a>."},{"key":"57","doi-asserted-by":"publisher","unstructured":"<small>MALLICK, H.<\/small> and <small>YI, N.<\/small> (2014). A new Bayesian lasso. <i>Stat. Interface<\/i> <b>7<\/b> 571\u2013582.","DOI":"10.4310\/SII.2014.v7.n4.a12"},{"key":"59","doi-asserted-by":"publisher","unstructured":"<small>MIKULINCER, D.<\/small> and <small>SHENFELD, Y.<\/small> (2024). The Brownian transport map. <i>Probab. Theory Related Fields<\/i> <b>190<\/b> 379\u2013444.","DOI":"10.1007\/s00440-024-01286-0"},{"key":"63","doi-asserted-by":"publisher","unstructured":"<small>MONTANARI, A.<\/small> and <small>WU, Y.<\/small> (2026). Provably efficient posterior sampling for sparse linear regression via measure decomposition. <i>J. Amer. Statist. Assoc.<\/i> <b>121<\/b> 636\u2013654.","DOI":"10.1080\/01621459.2025.2537461"},{"key":"64","unstructured":"<small>MOU, W.<\/small>, <small>HO, N.<\/small>, <small>WAINWRIGHT, M. J.<\/small>, <small>BARTLETT, P. L.<\/small> and <small>JORDAN, M. I.<\/small> (2019). Sampling for Bayesian mixture models: Mcmc with polynomial-time mixing. arXiv Preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1912.05153\">1912.05153<\/a>."},{"key":"65","doi-asserted-by":"publisher","unstructured":"<small>NARAYANAN, H.<\/small> (2016). Randomized interior point methods for sampling and optimization. <i>Ann. Appl. Probab.<\/i> <b>26<\/b> 597\u2013641.","DOI":"10.1214\/15-AAP1104"},{"key":"66","doi-asserted-by":"crossref","unstructured":"<small>NGUYEN, H. H.<\/small>, <small>NGO, V. M.<\/small> and <small>TRAN, A. N. T.<\/small> (2021). Financial performances, entrepreneurial factors and coping strategy to survive in the COVID-19 pandemic: Case of Vietnam. <i>Res. Int. Bus. Finance<\/i> <b>56<\/b> 101380.","DOI":"10.1016\/j.ribaf.2021.101380"},{"key":"73","unstructured":"<small>RAJARATNAM, B.<\/small>, <small>SPARKS, D.<\/small>, <small>KHARE, K.<\/small> and <small>ZHANG, L.<\/small> (2015). Scalable Bayesian shrinkage and uncertainty quantification for high-dimensional regression. arXiv preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1509.03697\">1509.03697<\/a>."},{"key":"77","unstructured":"<small>ROY, V.<\/small>, <small>KHARE, K.<\/small> and <small>HOBERT, J. P.<\/small> (2024). The data augmentation algorithm. arXiv preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2406.10464\">2406.10464<\/a>."},{"key":"78","doi-asserted-by":"publisher","unstructured":"<small>SAMPFORD, M. R.<\/small> (1953). Some inequalities on Mill\u2019s ratio and related functions. <i>Ann. Math. Stat.<\/i> <b>24<\/b> 130\u2013132.","DOI":"10.1214\/aoms\/1177729093"},{"key":"80","doi-asserted-by":"publisher","unstructured":"<small>SINCLAIR, A.<\/small> and <small>JERRUM, M.<\/small> (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. <i>Inform. Comput.<\/i> <b>82<\/b> 93\u2013133.","DOI":"10.1016\/0890-5401(89)90067-9"},{"key":"81","doi-asserted-by":"publisher","unstructured":"<small>TALAGRAND, M.<\/small> (1991). A new isoperimetric inequality and the concentration of measure phenomenon. In <i>Geometric Aspects of Functional Analysis<\/i> (1989<i>\u2013<\/i>90). <i>Lecture Notes in Math.<\/i> <b>1469<\/b> 94\u2013124. Springer, Berlin.","DOI":"10.1007\/BFb0089217"},{"key":"85","doi-asserted-by":"publisher","unstructured":"<small>VAN DYK, D. A.<\/small> and <small>MENG, X.-L.<\/small> (2001). The art of data augmentation. <i>J. Comput. Graph. Statist.<\/i> <b>10<\/b> 1\u2013111.","DOI":"10.1198\/10618600152418584"},{"key":"86","unstructured":"<small>VEMPALA, S.<\/small> and <small>WIBISONO, A.<\/small> (2019). Rapid convergence of the unadjusted Langevin algorithm: Isoperimetry suffices. <i>Adv. Neural Inf. Process. Syst.<\/i> <b>32<\/b>."},{"key":"88","unstructured":"<small>WIBISONO, A.<\/small> (2019). Proximal Langevin algorithm: Rapid convergence under isoperimetry. arXiv Preprint. Available at arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1911.01469\">1911.01469<\/a>."},{"key":"89","unstructured":"<small>XUN, G.<\/small>, <small>LI, Y.<\/small>, <small>ZHAO, W. X.<\/small>, <small>GAO, J.<\/small> and <small>ZHANG, A.<\/small> (2017). A correlated topic model using word embeddings. In <i>IJCAI<\/i> <b>17<\/b> 4207\u20134213."},{"key":"90","doi-asserted-by":"publisher","unstructured":"<small>ZENS, G.<\/small>, <small>FR\u00dcHWIRTH-SCHNATTER, S.<\/small> and <small>WAGNER, H.<\/small> (2024). Ultimate P\u00f3lya gamma samplers\u2014efficient MCMC for possibly imbalanced binary and categorical data. <i>J. Amer. Statist. Assoc.<\/i> <b>119<\/b> 2548\u20132559.","DOI":"10.1080\/01621459.2023.2259030"},{"key":"11","doi-asserted-by":"publisher","unstructured":"<small>CAFFARELLI, L. A.<\/small> (2000). Monotonicity properties of optimal transportation and the FKG and related inequalities. <i>Comm. Math. Phys.<\/i> <b>214<\/b> 547\u2013563.","DOI":"10.1007\/s002200000257"},{"key":"42","doi-asserted-by":"publisher","unstructured":"<small>KANNAN, R.<\/small>, <small>LOV\u00c1SZ, L.<\/small> and <small>SIMONOVITS, M.<\/small> (1995). Isoperimetric problems for convex bodies and a localization lemma. <i>Discrete Comput. Geom.<\/i> <b>13<\/b> 541\u2013559.","DOI":"10.1007\/BF02574061"},{"key":"60","doi-asserted-by":"publisher","unstructured":"<small>MILMAN, E.<\/small> (2010). Isoperimetric and concentration inequalities: Equivalence under curvature lower bound. <i>Duke Math. J.<\/i> <b>154<\/b> 207\u2013239.","DOI":"10.1215\/00127094-2010-038"},{"key":"45","doi-asserted-by":"publisher","unstructured":"<small>KIM, Y.-H.<\/small> and <small>MILMAN, E.<\/small> (2012). A generalization of Caffarelli\u2019s contraction theorem via (reverse) heat flow. <i>Math. Ann.<\/i> <b>354<\/b> 827\u2013862.","DOI":"10.1007\/s00208-011-0749-x"},{"key":"82","doi-asserted-by":"publisher","unstructured":"<small>TALAGRAND, M.<\/small> (1996). Transportation cost for Gaussian and other product measures. <i>Geom. Funct. Anal.<\/i> <b>6<\/b> 587\u2013600.","DOI":"10.1007\/BF02249265"},{"key":"13","doi-asserted-by":"publisher","unstructured":"<small>CATTIAUX, P.<\/small> and <small>GUILLIN, A.<\/small> (2022). Functional inequalities for perturbed measures with applications to log-concave measures and to some Bayesian problems. <i>Bernoulli<\/i> <b>28<\/b> 2294\u20132321.","DOI":"10.3150\/21-bej1419"}],"container-title":["The Annals of Statistics"],"original-title":[],"deposited":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:12:26Z","timestamp":1791321146000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/annals-of-statistics\/volume-54\/issue-4\/Fast-mixing-of-data-augmentation-algorithms--Bayesian-probit-logit\/10.1214\/26-AOS2641.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,1]]},"references-count":91,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,8,1]]}},"URL":"https:\/\/doi.org\/10.1214\/26-aos2641","relation":{},"ISSN":["0090-5364","2168-8966"],"issn-type":[{"value":"0090-5364","type":"print"},{"value":"2168-8966","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,1]]}}}