arXiv Machine Learning

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.

arXiv Machine Learning
Oct 16

Quantile-Guided Diffusion for Probabilistic Time-Series Forecasting

The paper introduces Quantile-Guided Diffusion for Probabilistic Time-Series Forecasting, showing that integrating predicted quantiles as distributional controls can guide a pretrained diffusion forecaster. The authors find that applying residual control throughout the denoising network yields the most consistent improvements, leading to the Control-TS model that learns a quantile-control pathway while keeping the backbone frozen. Across eight benchmarks, Control-TS improves the backbone’s CRPS, competes with state‑of‑the‑art models, and retains gains in capacity‑matched comparisons, with further analyses on quantile granularity, predictor choice, and forecast quality. The study also presents the Conditional Linear Predictive Score (CLPS) to evaluate downstream forecasting utility of generated futures.

By Shadi Omari, Bashar Khoury, Assaf Schuster
arXiv Machine Learning
Aug 18

Convolution Smoothed Quantile Regression for XGBoost

arXiv:2608. 15290v1 Announce Type: cross Abstract: The increasing availability of large and complex datasets across many scientific disciplines has led to widespread adoption of machine learning (ML) for prediction.

By Mandy Yao (University of Toronto), Meredith Franklin (University of Toronto)
arXiv Machine Learning
Sep 4

Occupancy-based Quantile Risk Control

Occupancy-based Quantile Risk Control (OQRC) is a new method that extends conformal risk control to quantile-based risk measures. It partitions the loss space using ordered calibration losses, estimates the distribution of test losses in each bin, and upper-bounds the risk by the maximum loss per bin. The approach guarantees finite-sample validity, achieving tight risk control bounds that converge at a rate of σ(n^{-1/2}) and reducing the risk gap by up to 78.64% in experiments.

By Zihao Shi, Huajun Xi, Bingyi Jing, Hongxin Wei
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