IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v72y2024i4p1368-1387.html
   My bibliography  Save this article

Comparing Sequential Forecasters

Author

Listed:
  • Yo Joong Choe

    (Data Science Institute, University of Chicago, Chicago, Illinois 60637)

  • Aaditya Ramdas

    (Department of Statistics and Data Science, Machine Learning Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

Abstract

Consider two forecasters, each making a single prediction for a sequence of events over time. We ask a relatively basic question: how might we compare these forecasters, either online or post hoc, avoiding unverifiable assumptions on how the forecasts and outcomes were generated? In this paper, we present a rigorous answer to this question by designing novel sequential inference procedures for estimating the time-varying difference in forecast scores. To do this, we employ confidence sequences (CS), which are sequences of confidence intervals that can be continuously monitored and are valid at arbitrary data-dependent stopping times (“anytime-valid”). The widths of our CSs are adaptive to the underlying variance of the score differences. Underlying their construction is a game-theoretic statistical framework in which we further identify e-processes and p-processes for sequentially testing a weak null hypothesis—whether one forecaster outperforms another on average (rather than always). Our methods do not make distributional assumptions on the forecasts or outcomes; our main theorems apply to any bounded scores, and we later provide alternative methods for unbounded scores. We empirically validate our approaches by comparing real-world baseball and weather forecasters.

Suggested Citation

  • Yo Joong Choe & Aaditya Ramdas, 2024. "Comparing Sequential Forecasters," Operations Research, INFORMS, vol. 72(4), pages 1368-1387, July.
  • Handle: RePEc:inm:oropre:v:72:y:2024:i:4:p:1368-1387
    DOI: 10.1287/opre.2021.0792
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2021.0792
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2021.0792?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
    ---><---

    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:inm:oropre:v:72:y:2024:i:4:p:1368-1387. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.