Study extends binary omniprediction to multiclass setting with improved sample complexity.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
New algorithm for online omniprediction with strong guarantees for continuous hypothesis classes.
Improved bounds for multicalibration and omniprediction in online and distributional settings.
Near-optimal algorithms for predicting across multiple loss functions efficiently.
New method learns SIMs with arbitrary monotone activations without strong distributional assumptions.
New algorithm reduces sample complexity for omnipredictors of SIMs.
New approach tackles decision-making under predictions that shape outcomes.
We resolve the open problem of optimal sample complexity for multicalibration and deterministic predictors.