IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v47y2025i1d10.1007_s00291-024-00771-1.html
   My bibliography  Save this article

Recurrent double-conditional factor model

Author

Listed:
  • Christian Fieberg

    (HSB Hochschule Bremen - City University of Applied Sciences)

  • Gerrit Liedtke

    (University of Bremen)

  • Thorsten Poddig

    (University of Bremen)

Abstract

In economic applications, the behavior of objects (e.g., individuals, firms, or households) is often modeled as a function of microeconomic and/or macroeconomic conditions. While macroeconomic conditions are common to all objects and change only over time, microeconomic conditions are object-specific and thus vary both among objects and through time. The simultaneous modeling of microeconomic and macroeconomic conditions has proven to be extremely difficult for these applications due to the mismatch of dimensions, potential interactions, and the high number of parameters to estimate. By marrying recurrent neural networks with conditional factor models, we propose a new white-box machine learning method, the recurrent double-conditional factor model (RDCFM), which allows for the modeling of the simultaneous and combined influence of micro- and macroeconomic conditions while being parsimoniously parameterized. Due to the low degree of parameterization, the RDCFM generalizes well and estimation remains feasible even if the time-series and the cross-section are large. We demonstrate the suitability of our method using an application from the financial economics literature.

Suggested Citation

  • Christian Fieberg & Gerrit Liedtke & Thorsten Poddig, 2025. "Recurrent double-conditional factor model," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(1), pages 205-254, March.
  • Handle: RePEc:spr:orspec:v:47:y:2025:i:1:d:10.1007_s00291-024-00771-1
    DOI: 10.1007/s00291-024-00771-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-024-00771-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00291-024-00771-1?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.

    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:spr:orspec:v:47:y:2025:i:1:d:10.1007_s00291-024-00771-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.