Optimal Lower Bounds for Online Multicalibration

arXiv:2601.05245v2 Announce Type: replace Abstract: We prove tight lower bounds for online multicalibration, establishing an information-theoretic separation from marginal calibration. In the general setting where group functions can depend on both context and the learner's predictions, we prove an Omega(T^{2/3}) lower bound on expected multicalibration error using just three disjoint binary groups. This matches the upper bounds of Noarov et al. (2025) up to logarithmic factors and exceeds the O(T^{2/3-arepsilon}) upper bound for marginal calibration (Dagan et al., 2025), thereby separating the two problems. We then turn to lower bounds for the more difficult case of group functions that may depend on context but not on the learner's predictions. In this case, we establish an widetilde{Omega}(T^{2/3}) lower bound for online multicalibration via an O(log^3 T)-sized group family constructed from an orthonormal basis, again matching upper bounds up to logarithmic factors.

Related

• Identifying Information from Observations with Uncertainty and Novelty
• Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
• Swap Regret Minimization Through Response-Based Approachability
• Partially Lazy Gradient Descent for Smoothed Online Learning

Source: arXiv cs.LG | 2026-04-27