Cover Image

Calibeating for general proper losses: A Bregman divergence approach

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fichtl, Maximilian, Guzmán, Cristóbal, Mehta, Nishant A.
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A direct proof of a unified law of robustness for Bregman divergence losses
by: Das, Santanu, et al.
Published: (2024)

Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
by: Nguyen, Quan, et al.
Published: (2024)

Symplectic Bregman divergences
by: Nielsen, Frank
Published: (2024)

Curved representational Bregman divergences and their applications
by: Nielsen, Frank
Published: (2025)

Bias-variance decompositions: the exclusive privilege of Bregman divergences
by: Heskes, Tom
Published: (2025)

Near-optimal Per-Action Regret Bounds for Sleeping Bandits
by: Nguyen, Quan, et al.
Published: (2024)

Generalising maximum mean discrepancy: kernelised functional Bregman divergences
by: Tsuchida, Russell, et al.
Published: (2026)

Bregman-Hausdorff divergence: strengthening the connections between computational geometry and machine learning
by: Pham, Tuyen, et al.
Published: (2025)

Alpha-divergence loss function for neural density ratio estimation
by: Kitazawa, Yoshiaki
Published: (2024)

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
by: Mortazavi, Ali, et al.
Published: (2024)

Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment
by: Hu, Bingshan, et al.
Published: (2021)

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
by: Nguyen, Quan, et al.
Published: (2025)

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
by: Komiyama, Junpei, et al.
Published: (2025)

Examining marginal properness in the external validation of survival models with squared and logarithmic losses
by: Sonabend, Raphael, et al.
Published: (2022)

Calibeating Made Simple
by: Chen, Yurong, et al.
Published: (2026)

Calibeating Prediction-Powered Inference
by: van der Laan, Lars, et al.
Published: (2026)

Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers
by: Aloradi, Ahmad, et al.
Published: (2026)

A Generalized Bias-Variance Decomposition for Bregman Divergences
by: Pfau, David
Published: (2025)

Bounds on Lp errors in density ratio estimation via f-divergence loss functions
by: Kitazawa, Yoshiaki
Published: (2024)

Selective classification using a robust meta-learning approach
by: Jain, Nishant, et al.
Published: (2022)

Rethinking Bregman Divergences in Kronecker-Factored Optimizers
by: Liu, Bing, et al.
Published: (2026)

Stream separation improves Bregman conditioning in transformers
by: Kerce, James Clayton
Published: (2026)

"Calibeating": Beating Forecasters at Their Own Game
by: Foster, Dean P., et al.
Published: (2022)

Bregman Douglas-Rachford Splitting Method
by: Ma, Shiqian, et al.
Published: (2025)

A note on generalization bounds for losses with finite moments
by: Rodríguez-Gálvez, Borja, et al.
Published: (2024)

Geometric Convergence Analysis of Variational Inference via Bregman Divergences
by: Bohara, Sushil, et al.
Published: (2025)

Lower Difficulty and Better Robustness: A Bregman Divergence Perspective for Adversarial Training
by: Wu, Zihui, et al.
Published: (2022)

Online Nonconvex Bilevel Optimization with Bregman Divergences
by: Bohne, Jason, et al.
Published: (2024)

Spectral Kernel Dynamics via Maximum Caliber: Fixed Points, Geodesics, and Phase Transitions
by: Das, Jnaneshwar
Published: (2026)

A Bregman firmly nonexpansive proximal operator for baryconvex optimization
by: Achab, Mastane
Published: (2024)

External Division of Two Bregman Proximity Operators for Poisson Inverse Problems
by: Haishima, Kazuki, et al.
Published: (2026)

Learning density ratios in causal inference using Bregman-Riesz regression
by: Hines, Oliver J., et al.
Published: (2025)

k-MLE, k-Bregman, k-VARs: Theory, Convergence, Computation
by: Yue, Zuogong, et al.
Published: (2024)

Regularizing cross entropy loss via minimum entropy and K-L divergence
by: Ibraheem, Abdulrahman Oladipupo
Published: (2025)

Robust Sublinear Convergence Rates for Iterative Bregman Projections
by: Peyré, Gabriel
Published: (2026)

Coreset selection for the Sinkhorn divergence and generic smooth divergences
by: Kokot, Alex, et al.
Published: (2025)

More PAC-Bayes bounds: From bounded losses, to losses with general tail behaviors, to anytime validity
by: Rodríguez-Gálvez, Borja, et al.
Published: (2023)

Minimizing robust density power-based divergences for general parametric density models
by: Okuno, Akifumi
Published: (2023)

An Accelerated Alternating Partial Bregman Algorithm for ReLU-based Matrix Decomposition
by: Wang, Qingsong, et al.
Published: (2025)

Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
by: Diakonikolas, Jelena, et al.
Published: (2024)