A Curriculum View of Robust Loss Functions
–arXiv.org Artificial Intelligence
Robust loss functions are designed to combat the adverse impacts of label noise, whose robustness is typically supported by theoretical bounds agnostic to the training dynamics. However, these bounds may fail to characterize the empirical performance as it remains unclear why robust loss functions can underfit. We show that most loss functions can be rewritten into a form with the same class-score margin and different sample-weighting functions. The resulting curriculum view provides a straightforward analysis of the training dynamics, which helps attribute underfitting to diminished average sample weights and noise robustness to larger weights for clean samples. We show that simple fixes to the curriculums can make underfitting robust loss functions competitive with the state-of-the-art, and training schedules can substantially affect the noise robustness even with robust loss functions. Code is available at \url{github}.
arXiv.org Artificial Intelligence
May-3-2023
- Country:
- South America > Chile
- Oceania > Australia
- New South Wales > Sydney (0.04)
- North America
- United States
- New York
- Richmond County > New York City (0.04)
- Queens County > New York City (0.04)
- New York County > New York City (0.04)
- Kings County > New York City (0.04)
- Bronx County > New York City (0.04)
- Nevada > Clark County
- Las Vegas (0.04)
- Hawaii > Honolulu County
- Honolulu (0.04)
- California
- Los Angeles County > Long Beach (0.14)
- San Francisco County > San Francisco (0.14)
- New York
- Canada
- Quebec > Montreal (0.04)
- British Columbia > Metro Vancouver Regional District
- Vancouver (0.04)
- United States
- Europe
- Asia > South Korea
- Genre:
- Research Report (0.41)
- Technology: