The Surprising Benefits of Base Rate Neglect in Robust Aggregation
<|reference_start|>The Surprising Benefits of Base Rate Neglect in Robust Aggregation: Robust aggregation integrates predictions from multiple experts without knowledge of the experts' information structures. Prior work assumes experts are Bayesian, providing predictions as perfect posteriors based on their signals. However, real-world experts often deviate systematically from Bayesian reasoning. Our work considers experts who tend to ignore the base rate. We find that a certain degree of base rate neglect helps with robust forecast aggregation.   Specifically, we consider a forecast aggregation problem with two experts who each predict a binary world state after observing private signals. Unlike previous work, we model experts exhibiting base rate neglect, where they incorporate the base rate information to degree $\lambda\in[0,1]$, with $\lambda=0$ indicating complete ignorance and $\lambda=1$ perfect Bayesian updating. To evaluate aggregators' performance, we adopt Arieli et al. (2018)'s worst-case regret model, which measures the maximum regret across the set of considered information structures compared to an omniscient benchmark. Our results reveal the surprising V-shape of regret as a function of $\lambda$. That is, predictions with an intermediate incorporating degree of base rate $\lambda<1$ can counter-intuitively lead to lower regret than perfect Bayesian posteriors with $\lambda=1$. We additionally propose a new aggregator with low regret robust to unknown $\lambda$. Finally, we conduct an empirical study to test the base rate neglect model and evaluate the performance of various aggregators.<|reference_end|>
@article{kong2024the,
    title={The Surprising Benefits of Base Rate Neglect in Robust Aggregation},
    author={Yuqing Kong, Shu Wang, Ying Wang},
    journal={arXiv preprint arXiv:2406.13490},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.13490},
    primaryClass={cs.LG cs.GT}
}