Scalable Bayesian p-generalized probit and logistic regression

被引:0
作者
Ding, Zeyu [1 ,2 ]
Omlor, Simon [1 ,2 ]
Ickstadt, Katja [1 ,2 ]
Munteanu, Alexander [1 ]
机构
[1] TU Dortmund Univ, Fac Stat, D-44227 Dortmund, Germany
[2] Lamarr Inst Machine Learning & Artificial Intellig, D-44227 Dortmund, Germany
关键词
Generalized linear model; Bayesian regression; Coreset; Probit regression; Logistic regression; BINARY REGRESSION;
D O I
10.1007/s11634-024-00599-1
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The logit and probit link functions are arguably the two most common choices for binary regression models. Many studies have extended the choice of link functions to avoid possible misspecification and to improve the model fit to the data. We introduce the p-generalized Gaussian distribution (p-GGD) to binary regression in a Bayesian framework. The p-GGD has received considerable attention due to its flexibility in modeling the tails, while generalizing, for instance, over the standard normal distribution where p=2 or the Laplace distribution where p=1 . Here, we extend from maximum likelihood estimation (MLE) to Bayesian posterior estimation using Markov Chain Monte Carlo (MCMC) sampling for the model parameters beta and the link function parameter p. We use simulated and real-world data to verify the effect of different parameters p on the estimation results, and how logistic regression and probit regression can be incorporated into a broader framework. To make our Bayesian methods scalable in the case of large data, we also incorporate coresets to reduce the data before running the complex and time-consuming MCMC analysis. This allows us to perform very efficient calculations while retaining the original posterior parameter distributions up to little distortions both, in practice, and with theoretical guarantees.
引用
收藏
页数:35
相关论文
共 55 条
  • [1] Ahn S., 2012, P 29 INT C MACH LEAR, P1591
  • [2] BAYESIAN-ANALYSIS OF BINARY AND POLYCHOTOMOUS RESPONSE DATA
    ALBERT, JH
    CHIB, S
    [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1993, 88 (422) : 669 - 679
  • [3] The space complexity of approximating the frequency moments
    Alon, N
    Matias, Y
    Szegedy, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (01) : 137 - 147
  • [4] Convex Optimization: Algorithms and Complexity
    不详
    [J]. FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2015, 8 (3-4): : 232 - +
  • [5] [Anonymous], 2015, Behavioral risk factor surveillance system
  • [6] Bachem O., 2018, PMLR, P784
  • [7] Bardenet R, 2017, J MACH LEARN RES, V18, P1
  • [8] Bardenet R, 2014, PR MACH LEARN RES, V32
  • [9] Blackard Jock, 1998, UCI Machine Learning Repository, DOI DOI 10.24432/C50K5N
  • [10] Broderick T., 2013, ADV NEURAL INFORM PR, P1727