Pith. sign in

REVIEW 2 cited by

Tilted Empirical Risk Minimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.01162 v2 pith:WXF23UTG submitted 2020-07-02 cs.LG cs.ITmath.ITstat.ML

classification cs.LGcs.ITmath.ITstat.ML
keywords termoutliersempiricalfairnessminimizationriskapplicationsenable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Empirical risk minimization (ERM) is typically designed to perform well on the average loss, which can result in estimators that are sensitive to outliers, generalize poorly, or treat subgroups unfairly. While many methods aim to address these problems individually, in this work, we explore them through a unified framework -- tilted empirical risk minimization (TERM). In particular, we show that it is possible to flexibly tune the impact of individual losses through a straightforward extension to ERM using a hyperparameter called the tilt. We provide several interpretations of the resulting framework: We show that TERM can increase or decrease the influence of outliers, respectively, to enable fairness or robustness; has variance-reduction properties that can benefit generalization; and can be viewed as a smooth approximation to a superquantile method. We develop batch and stochastic first-order optimization methods for solving TERM, and show that the problem can be efficiently solved relative to common alternatives. Finally, we demonstrate that TERM can be used for a multitude of applications, such as enforcing fairness between subgroups, mitigating the effect of outliers, and handling class imbalance. TERM is not only competitive with existing solutions tailored to these individual problems, but can also enable entirely new applications, such as simultaneously addressing outliers and promoting fairness.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Geometry-Aware Efficient Algorithm for Compositional Entropic Risk Minimization

    cs.LG 2026-02 conditional novelty 6.0 of 10

    SCENT, a stochastic proximal mirror descent on the dual variable with an exponential Bregman divergence, optimizes compositional entropic risk at O(1/sqrt(T)) in the convex setting and matches or beats baselines on la...

  2. Quantum Learning with Tunable Loss Functions

    quant-ph 2025-08 reject novelty 5.0 of 10

    Proposes QTERM for quantum process learning, but the proof rests on an incorrect equality E[e^{γY}] = e^{γE[Y]} for measurement bits, invalidating the sample complexity and PAC claims.

Pith tools