Cover Image

Calibration Error for Decision Making

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hu, Lunjia, Wu, Yifan
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Truthful Calibration Errors for Multi-Class Prediction
by: Lu, Yuxuan, et al.
Published: (2025)

A Perfectly Truthful Calibration Measure
by: Hartline, Jason, et al.
Published: (2025)

Smooth Calibration and Decision Making
by: Hartline, Jason, et al.
Published: (2025)

Near-optimal Swap Regret Minimization for Convex Losses
by: Hu, Lunjia, et al.
Published: (2026)

Testing Calibration in Nearly-Linear Time
by: Hu, Lunjia, et al.
Published: (2024)

Efficient Calibration for Decision Making
by: Gopalan, Parikshit, et al.
Published: (2025)

Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction
by: Hu, Lunjia, et al.
Published: (2026)

On Computationally Efficient Multi-Class Calibration
by: Gopalan, Parikshit, et al.
Published: (2024)

Omnipredicting Single-Index Models with Multi-Index Models
by: Hu, Lunjia, et al.
Published: (2024)

Sample-efficient Multiclass Calibration under $\ell_{p}$ Error
by: Bairaktari, Konstantina, et al.
Published: (2025)

Truthfulness of Calibration Measures
by: Haghtalab, Nika, et al.
Published: (2024)

The Importance of Being Smoothly Calibrated
by: Gopalan, Parikshit, et al.
Published: (2026)

On the Distance from Calibration in Sequential Prediction
by: Qiao, Mingda, et al.
Published: (2024)

Computational and Statistical Hardness of Calibration Distance
by: Qiao, Mingda
Published: (2026)

Algorithms with Calibrated Machine Learning Predictions
by: Shen, Judy Hanwen, et al.
Published: (2025)

Robust Learning with Optimal Error
by: Blanc, Guy
Published: (2026)

Breaking the $T^{2/3}$ Barrier for Sequential Calibration
by: Dagan, Yuval, et al.
Published: (2024)

An Elementary Predictor Obtaining $2\sqrt{T}+1$ Distance to Calibration
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

Precedence-Constrained Decision Trees and Coverings
by: Szyfelbein, Michał, et al.
Published: (2026)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
by: Li, Yi, et al.
Published: (2024)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2025)

A Simple Approximation Algorithm for Optimal Decision Tree
by: Zhuo, Zhengjia, et al.
Published: (2025)

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
by: Gahlawat, Harmender, et al.
Published: (2025)

Fast online node labeling with graph subsampling
by: Huang, Yushen, et al.
Published: (2025)

Improved Regret in Stochastic Decision-Theoretic Online Learning under Differential Privacy
by: Wu, Ruihan, et al.
Published: (2025)

Connectivity Oracles for Predictable Vertex Failures
by: Hu, Bingbing, et al.
Published: (2023)

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
by: Song, Shihong, et al.
Published: (2024)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
by: Cheng, Kangke, et al.
Published: (2026)

Training Overparametrized Neural Networks in Sublinear Time
by: Deng, Yichuan, et al.
Published: (2022)

The Cost of Parallelizing Boosting
by: Lyu, Xin, et al.
Published: (2024)

Interpreting the Curse of Dimensionality from Distance Concentration and Manifold Effect
by: Peng, Dehua, et al.
Published: (2023)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
by: Hu, Hang, et al.
Published: (2022)

A Framework for Searching in Graphs in the Presence of Errors
by: Dereniowski, Dariusz, et al.
Published: (2018)

Optimal Clustering with Dependent Costs in Bayesian Networks
by: Wu, Paul Pao-Yen, et al.
Published: (2023)

Superconstant Inapproximability of Decision Tree Learning
by: Koch, Caleb, et al.
Published: (2024)

Arithmetical Binary Decision Tree Traversals
by: Zhang, Jinxiong
Published: (2022)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
by: John, Philips George, et al.
Published: (2024)

Improved Approximations for Hard Graph Problems using Predictions
by: Aamand, Anders, et al.
Published: (2025)

Learning-Augmented Frequent Directions
by: Aamand, Anders, et al.
Published: (2025)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
by: Balasubramanian, Rishab, et al.
Published: (2023)