TL;DR
This paper introduces a maximum entropy approach as an alternative to traditional likelihood equation solutions, simplifying the problem and providing comparable results, especially in challenging cases like logistic regression with data separation.
Contribution
It proposes a novel maximum entropy method for solving likelihood equations, re-parameterizing score functions and demonstrating effectiveness through empirical and simulation studies.
Findings
Maximum entropy approach effectively solves likelihood equations.
Method performs well in logistic regression with data separation.
Results are comparable to Firth's bias correction method.
Abstract
In this article we provide initial findings regarding the problem of solving likelihood equations by means of a maximum entropy approach. Unlike standard procedures that require equating at zero the score function of the maximum-likelihood problem, we propose an alternative strategy where the score is instead used as external informative constraint to the maximization of the convex Shannon's entropy function. The problem involves the re-parameterization of the score parameters as expected values of discrete probability distributions where probabilities need to be estimated. This leads to a simpler situation where parameters are searched in smaller (hyper) simplex space. We assessed our proposal by means of empirical case studies and a simulation study, this latter involving the most critical case of logistic regression under data separation. The results suggested that the maximum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
