<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Robustness of Accuracy Metric and its Inspirations in Learning with Noisy Labels · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2012.04193/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2012.04193/feed.xml" rel="self" type="application/rss+xml" /><item><title>Robustness of Accuracy Metric and its Inspirations in Learning with Noisy Labels — mentioned by tmabraham</title><link>https://news.ycombinator.com/item?id=26687856</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.04193:26687856</guid><pubDate>Sun, 04 Apr 2021 08:43:16 GMT</pubDate><description>&lt;p&gt;People are studying ways to train accurate labels with noisy labels (see the paragraph in this article: https://tmabraham.github.io/blog/noisy_imagenette#Prior-rese...) Also, technically accuracy as a metric is robust to noise (https://arxiv.org/abs/2012.04193). That means that a model with the highest accuracy on a noisy dataset will likely be the best model on the clean dataset. So these noisy datasets can still be very useful for the development of deep learning models. In fact if you look at the tradeoffs between getting larger datasets that have noisy labels vs. smaller datasets will…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.04193/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
