paper-with-me

Papers

Unbiased Risk Estimators Can Mislead: A Case Study of Learning with Complementary Labels

2020-07-05 · ICML 2020 1 · Yu-Ting Chou, Gang Niu, Hsuan-Tien Lin, Masashi Sugiyama

In weakly supervised learning, unbiased risk estimator(URE) is a powerful tool for training classifiers when training and test data are drawn from different distributions. Nevertheless, UREs lead to overfitting in many problem settings when the models are complex like deep networks. In this paper, we investigate reasons for such overfitting by studying a weakly supervised problem called learning with complementary labels. We argue the quality of gradient estimation matters more in risk minimization. Theoretically, we show that a URE gives an unbiased gradient estimator(UGE). Practically, however, UGEs may suffer from huge variance, which causes empirical gradients to be usually far away from true gradients during minimization. To this end, we propose a novel surrogate complementary loss(SCL) framework that trades zero bias with reduced variance and makes empirical gradients more aligned with true gradients in the direction. Thanks to this characteristic, SCL successfully mitigates the overfitting issue and improves URE-based methods.

📄 PDF Abstract BibTeX arXiv:2007.02235

Code (0)

등록된 구현이 없습니다.

Tasks

Weakly-supervised Learning

Similar Papers 제목 키워드 기반

Unbiased estimation of risk

2017-08-24

The estimation of risk measures recently gained a lot of attention, partly because of the backtesting issues of expected shortfall related to elicitability. In this work we shed a new and fundamental light on optimal est…

From Cross-Validation to SURE: Asymptotic Risk of Tuned Regularized Estimators

2026-03-20 · Karun Adusumilli, Maximilian Kasy, Ashia Wilson arxiv

We derive the asymptotic risk function of regularized empirical risk minimization (ERM) estimators tuned by $n$-fold cross-validation (CV). The out-of-sample prediction loss of such estimators converges in distribution t…

Control Variates for Slate Off-Policy Evaluation

2021-06-15 · NeurIPS 2021 12 · Nikos Vlassis, Ashok Chandrashekar, Fernando Amat Gil, Nathan Kallus

We study the problem of off-policy evaluation from batched contextual bandit data with multidimensional actions, often termed slates. The problem is common to recommender systems and user-interface optimization, and it i…

Off-policy evaluationRecommendation Systems

Unbiased least squares regression via averaged stochastic gradient descent

2024-06-26 · Nabil Kahalé

We consider an on-line least squares regression problem with optimal solution $\theta^*$ and Hessian matrix H, and study a time-average stochastic gradient descent estimator of $\theta^*$. For $k\ge2$, we provide an unbi…

regression

Stochastic Gradient Descent with Biased but Consistent Gradient Estimators

2018-07-31 · Jie Chen, Ronny Luss

Stochastic gradient descent (SGD), which dates back to the 1950s, is one of the most popular and effective approaches for performing stochastic optimization. Research on SGD resurged recently in machine learning for opti…

Stochastic Optimization