Cover Image

Truthfulness of Calibration Measures

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Haghtalab, Nika, Qiao, Mingda, Yang, Kunhe, Zhao, Eric
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

Sample-Adaptivity Tradeoff in On-Demand Sampling
by: Haghtalab, Nika, et al.
Published: (2025)

Leakage-Robust Bayesian Persuasion
by: Haghtalab, Nika, et al.
Published: (2024)

Platforms for Efficient and Incentive-Aware Collaboration
by: Haghtalab, Nika, et al.
Published: (2024)

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

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

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

Collaborative Learning with Different Labeling Functions
by: Deng, Yuyang, et al.
Published: (2024)

Online Prediction with Limited Selectivity
by: Liu, Licheng, et al.
Published: (2025)

Limitations of Membership Queries in Testable Learning
by: Lange, Jane, et al.
Published: (2025)

Smooth Nash Equilibria: Algorithms and Complexity
by: Daskalakis, Constantinos, et al.
Published: (2023)

Learning in Stackelberg Games with Non-myopic Agents
by: Haghtalab, Nika, et al.
Published: (2022)

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

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

Calibration Error for Decision Making
by: Hu, Lunjia, et al.
Published: (2024)

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

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

Optimal $k$-Secretary with Logarithmic Memory
by: Qiao, Mingda, et al.
Published: (2025)

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

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

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

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

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

Spectral Guarantees for Adversarial Streaming PCA
by: Price, Eric, et al.
Published: (2024)

A Competitive Algorithm for Agnostic Active Learning
by: Price, Eric, et al.
Published: (2023)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
by: Gao, Jie, et al.
Published: (2025)

Fair Secretaries with Unfair Predictions
by: Balkanski, Eric, et al.
Published: (2024)

Learning Low Degree Hypergraphs
by: Balkanski, Eric, et al.
Published: (2022)

Energy-Efficient Scheduling with Predictions
by: Balkanski, Eric, et al.
Published: (2024)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
by: Alman, Josh, et al.
Published: (2025)

Query-decision Regression between Shortest Path and Minimum Steiner Tree
by: Tong, Guangmo, et al.
Published: (2024)

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
by: Ye, Zichun, et al.
Published: (2025)

Fast and Efficient Matching Algorithm with Deadline Instances
by: Song, Zhao, et al.
Published: (2023)

On Socially Fair Low-Rank Approximation and Column Subset Selection
by: Song, Zhao, et al.
Published: (2024)

Towards Optimal Robustness in Learning-Augmented Paging
by: Chen, Peng, 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)

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

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
by: Gu, Yuzhou, et al.
Published: (2024)

A Faster $k$-means++ Algorithm
by: Liang, Jiehao, et al.
Published: (2022)

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
by: Chen, Peng, et al.
Published: (2025)