arXiv Machine Learning

Towards Calibrated Probabilistic Forecasts for Events of Interest via Outcome-Conditional Recalibration

arXiv Machine Learning
Oct 16

Online Quantile Omniprediction for Proper Losses

The paper introduces online, sample‑efficient algorithms that generate forecasts expressed as sets of quantiles over arbitrary probability levels. These forecasts are simultaneously accurate across all proper losses that meet mild regularity conditions, enabling dynamic, multi‑metric prediction in both binary and multiclass settings. The authors illustrate the method by combining expert quantile forecasts of COVID‑19 hospitalizations to provide richer risk information for decision makers.

By Hyunsuk Kim, Isaac Gibbs, Michael W. Mahoney, Ryan J. Tibshirani
arXiv Statistics ML
Sep 16

Statistical Inference for Score Decompositions

arXiv:2603.04275v2 Announce Type: replace-cross Abstract: We introduce inference methods for score decompositions, which partition scoring functions for predictive assessment into three interpretable...

By Timo Dimitriadis, Marius Puke
arXiv Machine Learning
Oct 2

Proper Scoring Rule-based Diffusion for Probabilistic Weather Forecasting

The paper introduces a new diffusion-based approach for probabilistic weather forecasting that incorporates auxiliary conditional denoising tasks. By predicting future states from both clean and corrupted contexts, the model reduces ambiguity and learns conditional distributions across noise levels using a proper scoring rule. Experiments demonstrate improved one‑step forecasting, especially at longer horizons, and better calibration in high‑dimensional global weather scenarios.

By Joonhyeong Park, Giung Nam, Hyungi Lee, Kyunghyun Cho, Byoungwoo Park, Juho Lee
arXiv AI
Sep 2

LEAP: Likelihood Elicitation and Aggregation for LLM-based Probabilistic Forecasting

LEAP (Likelihood Elicitation and Aggregation for Probabilistic forecasting) is a new approach that reorganizes how evidence is used in LLM-based forecasting systems. Instead of a monolithic prediction that aggregates all evidence at once, LEAP examines each evidence item separately, elicits likelihood parameters, and combines them with an explicit prior to produce a posterior distribution. The method supports continuous, single-choice, and multi-choice forecasts and has been shown to improve prediction and calibration metrics across models on a benchmark covering forecasting, information-seeking, and browsing tasks.

By Yufei Chen, Yiran Zhao, Xiaogang Xu, Qipeng Xie, Jiafei Wu, Zhe Liu