IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v53y2024i23p8359-8375.html
   My bibliography  Save this article

Refinements on the exact method to solve the numerical difficulties in fitting the log binomial regression model for estimating relative risk

Author

Listed:
  • Chao Zhu
  • David W. Hosmer
  • Jim Stankovich
  • Karen Wills
  • Leigh Blizzard

Abstract

Fitting a log binomial regression model using standard software can result in numerical difficulties because its functional form does not restrict the estimated probabilities to values not exceeding unity. The common approaches to resolve the issue are to introduce a constraint to limit the results of each iteration. However, if the ML solution lies on the boundary of the allowable parameter space, some fitted probabilities are equal to unity (named as boundary vector). The common approaches have trouble dealing with those boundary vectors and can only reach somewhere before the ML solution. Previously a remedy has been proposed, but without the details necessary to implement it. Here we provide these details, including formulae for estimating the covariances essential to implement the method, an explanation of inter-dependency between coefficient estimates, and a proof that the method can be implemented in general. Code written for R implements choice of fitting algorithms, finding appropriate starting values, identifying the covariate vector(s) with a fitted probability of unity, and strategies for covariate ordering to handle the issues caused by the common values in two distinct boundary vectors. The model-fitting results are compared with two alternative methods by simulation and example data.

Suggested Citation

  • Chao Zhu & David W. Hosmer & Jim Stankovich & Karen Wills & Leigh Blizzard, 2024. "Refinements on the exact method to solve the numerical difficulties in fitting the log binomial regression model for estimating relative risk," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(23), pages 8359-8375, December.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:23:p:8359-8375
    DOI: 10.1080/03610926.2023.2284674
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2023.2284674
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2023.2284674?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:53:y:2024:i:23:p:8359-8375. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.