activity
20172024
most citedNear-Optimal Explainable -Means for All Dimensions

6 citations · 33 across the 18 of their papers we have counts for

collaborators
Showing cs.LGShow all

17 papers · 1 filter

cs.LG2024

Multigroup Robustness

Lunjia Hu, Charlotte Peale, Judy Hanwen Shen

To address the shortcomings of real-world datasets, robust learning algorithms have been designed to overcome arbitrary and indiscriminate data corruption. However, practical proce…

cs.LG2024

Calibration Error for Decision Making

Lunjia Hu, Yifan Wu

Calibration allows predictions to be reliably interpreted as probabilities by decision makers. We propose a decision-theoretic calibration error, the Calibration Decision Loss (CDL…

cs.LG2024

Testing Calibration in Nearly-Linear Time

Lunjia Hu, Arun Jambulapati, Kevin Tian +1

In the recent literature on machine learning and decision making, calibration has emerged as a desirable and widely-studied statistical property of the outputs of binary prediction…

cs.LG2024

On Computationally Efficient Multi-Class Calibration

Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum

Consider a multi-class labelling problem, where the labels can take values in , and a predictor predicts a distribution over the labels. In this work, we study the following f…

cs.LG2023

Simple, Scalable and Effective Clustering via One-Dimensional Projections

Moses Charikar, Monika Henzinger, Lunjia Hu +2

Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and -means+…

cs.LG2023★ 3 cited

When Does Optimizing a Proper Loss Yield Calibration?

Jarosław Błasiok, Parikshit Gopalan, Lunjia Hu +1

Optimizing proper loss functions is popularly believed to yield predictors with good calibration properties; the intuition being that for such losses, the global optimum is to pred…