Pith. sign in

REVIEW 1 cited by

Peer Expectation in Robust Forecast Aggregation: The Possibility/Impossibility

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.06062 v1 pith:FJCPZEM4 submitted 2024-02-08 cs.GT math.STstat.TH

Peer Expectation in Robust Forecast Aggregation: The Possibility/Impossibility

classification cs.GT math.STstat.TH
keywords expectationsettingaggregationforecasthigheradditionaladditionallyforecaster
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recently a growing literature study a new forecast aggregation setting where each forecaster is additionally asked ``what's your expectation for the average of other forecasters' forecasts?''. However, most theoretic results in this setting focus on the scenarios where the additional second-order information helps optimally aggregate the forecasts. Here we adopt an adversarial approach and follow the robust forecast aggregation framework proposed by Arielia, Babichenkoa, and Smorodinsky 2018. We delicately analyze the possibility/impossibility of the new setting when there are two forecasters that either are refinement-ordered or receive conditionally independent and identically distributed (c.i.i.d.) signals. We also extend the setting to a higher level of expectation setting where we can additionally ask ``what's your expectation for the other forecaster's expectation for ...''. The results show that in the above settings, the additional second-order information can significantly improve the aggregation accuracy, and the higher the order, the higher the improvement.

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. Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles

    cs.LG 2026-07 conditional novelty 7.0

    An OCO algorithm with only O(√T) static regret, pluggable as a preconditioner selector, recovers the classical O(1/√T) stationarity rate on smooth stochastic nonconvex problems and the O(T^{-2/7}) rate on nonsmooth ones.