Pith. sign in

REVIEW 2 cited by

Avoiding spurious correlations via logit correction

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 2212.01433 v2 pith:M7Z66FFO submitted 2022-12-02 cs.LG cs.CLcs.CVeess.IVstat.ML

classification cs.LGcs.CLcs.CVeess.IVstat.ML
keywords correlationsspuriouslosslabelslogitattributecorrectiondata
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Empirical studies suggest that machine learning models trained with empirical risk minimization (ERM) often rely on attributes that may be spuriously correlated with the class labels. Such models typically lead to poor performance during inference for data lacking such correlations. In this work, we explicitly consider a situation where potential spurious correlations are present in the majority of training data. In contrast with existing approaches, which use the ERM model outputs to detect the samples without spurious correlations and either heuristically upweight or upsample those samples, we propose the logit correction (LC) loss, a simple yet effective improvement on the softmax cross-entropy loss, to correct the sample logit. We demonstrate that minimizing the LC loss is equivalent to maximizing the group-balanced accuracy, so the proposed LC could mitigate the negative impacts of spurious correlations. Our extensive experimental results further reveal that the proposed LC loss outperforms state-of-the-art solutions on multiple popular benchmarks by a large margin, an average 5.5\% absolute improvement, without access to spurious attribute labels. LC is also competitive with oracle methods that make use of the attribute labels. Code is available at https://github.com/shengliu66/LC.

Discussion (0). Continue with ORCID 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. Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions

    cs.LG 2026-08 accept novelty 8.0 of 10

    For average-reward MDPs with total-variation uncertainty, the minimax sample complexity is SA/epsilon^2 times min{H0,Hsigma}, with an extra SA sigma Hsigma^2/epsilon^2 term in the low-tolerance regime, and the paper p...

  2. The Pitfalls of Memorization: When Memorization Hurts Generalization

    cs.LG 2024-12 conditional novelty 6.0 of 10

    Memorization-aware training (MAT) shifts logits using calibrated held-out predictions from an XRM auxiliary model, improving worst-group accuracy under subpopulation shift.

Pith tools