pith. sign in

arxiv: 2202.08734 · v1 · pith:3LZK6NN3new · submitted 2022-02-17 · 📊 stat.ME

Conjugate priors and bias reduction for logistic regression models

classification 📊 stat.ME
keywords likelihoodlogisticregressionalwaysappealingapproachbiasconjugate
0
0 comments X
read the original abstract

Logistic regression models for binomial responses are routinely used in statistical practice. However, the maximum likelihood estimate may not exist due to data separability. We address this issue by considering a conjugate prior penalty which always produces finite estimates. Such a specification has a clear Bayesian interpretation and enjoys several invariance properties, making it an appealing prior choice. We show that the proposed method leads to an accurate approximation of the reduced-bias approach of Firth (1993), resulting in estimators with smaller asymptotic bias than the maximum-likelihood and whose existence is always guaranteed. Moreover, the considered penalized likelihood can be expressed as a genuine likelihood, in which the original data are replaced with a collection of pseudo-counts. Hence, our approach may leverage well established and scalable algorithms for logistic regression. We compare our estimator with alternative reduced-bias methods, vastly improving their computational performance and achieving appealing inferential results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Regularization in Paired Comparison Models via Pseudo-Games and Phantom Players

    stat.ME 2026-06 unverdicted novelty 5.0

    Introduces pseudo-game and phantom-player data augmentations to regularize paired comparison models, yielding finite estimates and transparent penalties comparable to ridge regularization.