Skip to content
Preprint

Dirichlet Follow-the-Leader Closes the Gap in Simultaneous Multiclass U-Calibration

Aug 2026 · 0 citations · 12 references
Computer Science

TL;DR

A single, horizon-free algorithm that satisfies the optimal regret rate for every bounded proper loss and also adapt to every smooth proper loss, covering nondifferentiable losses and changes of the active simplex face.

Abstract

Can one forecaster attain the optimal regret rate for every bounded proper loss and also adapt to every smooth proper loss? Recent work answered this up to a dimension gap. Its self-concordant perturbation gives roughly $K^{5/4}\sqrt{T}$ worst-case regret and incurs an additional $\beta\sqrt{K}\log K$ for $\beta$-smooth losses. We close both gaps with a one-line forecaster. After observing class counts $c_{t-1}$, draw the next prediction from $\operatorname{Dir}(c_{t-1})$, on the face of classes seen so far. This is a fresh Bayesian bootstrap of the outcomes. The analysis rests on an exact identity: averaging any bounded proper loss under $\operatorname{Dir}(\alpha)$ equals a discrete derivative of its Dirichlet-averaged Bayes risk. The identity makes the be-the-perturbed-leader term telescope to a nonpositive Jensen gap. A one-count likelihood ratio then bounds stability by the inverse square root of that class's count. The resulting single, horizon-free algorithm satisfies $\sup_{\ell}\mathbb{E}\operatorname{Reg}_{\ell}\leq 4\sqrt{S_T T}\leq 4\sqrt{K T}$ and $\mathbb{E}\operatorname{Reg}_{\ell}\leq \frac{5}{2}\beta(1+\log T)$ for every $\beta$-smooth proper loss. Here $S_T$ is the number of observed classes. Known lower bounds show that both rates are optimal in their nontrivial regimes. The proof covers nondifferentiable losses and changes of the active simplex face.

View source

Similar papers

Optimal-Dimension U-Calibration by Bayesian Bootstrap

It is shown that the classical Bayesian bootstrap closes this gap in U-calibration, which asks one online probability fore-caster to have low regret for every bounded proper loss, including losses unknown when the forecasts are made.

Pahan Dewasurendra · 0 citations
Preprint Aug 2026

Optimistic Rates for Multiclass PAC Learning

Worst-case multiclass bounds do not become smaller when the best classifier is already nearly correct: what is missing is an optimistic rate, a guarantee whose fluctuation scales with the oracle risk itself. For a class of Natarajan dimension $d_N$ and Daniely-Shalev-Shwartz dimension $d_{DS}$, the optimal excess risk...

Xiao-Yu Li, Andi Han, Jiao-Jiao Jiang et al. · 1 citation
#data science Jul 2026

Simple-regret rates and minimax optimality of fixed-prior expected improvement in Matérn and squared-exponential RKHSs

We study expected improvement (EI) for minimizing a deterministic function $f$ in the RKHS $\mathcal H_k$ of a continuous positive-semidefinite kernel $k$ on a nonempty compact set $\mathcal X\subset\mathbb R^d$. Function values are observed exactly, and EI is computed from a fixed zero-mean Gaussian-process model with...

Emmanuel Vazquez, S. Petit · 0 citations
Preprint Aug 2026

The Optimal Discounting Parameter of the Power Prior under Predictive Log-Loss

The power prior of Ibrahim and Chen incorporates historical data into a Bayesian analysis by raising the historical likelihood to a power $a_0 \in [0, 1]$. The choice of the exponent has remained an open question. This paper gives a closed-form answer under the predictive log-loss. For a model with $d$ parameters, a hi...

Yuriy A. Reznik · 1 citation
Preprint Jul 2026

Parameter-Free Dynamic Regret for Online Convex Optimization under Heavy-Tailed Noise

HT-PAder is proposed, a parameter-free algorithm combining restarted AdaGrad experts over a geometric pool of block lengths with a pathwise meta-algorithm, which requires no moment conditions on meta-losses and provides the first parameter-free minimax universal dynamic regret guarantee.

Vaneet Aggarwal · 0 citations
Preprint Aug 2026

Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions

This work studies how many samples are necessary and sufficient to learn an $\varepsilon$-optimal robust policy under the average-reward criterion and achieves these rates using reduction-based plug-in procedures that select the reduction---nominal or robust---and its discount factor.

Yue-Peng Yang, Yuxin Chen, Yuejie Chi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.