<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>WRENCH: A Comprehensive Benchmark for Weak Supervision · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2109.11377/</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/2109.11377/feed.xml" rel="self" type="application/rss+xml" /><item><title>WRENCH: A Comprehensive Benchmark for Weak Supervision — mentioned by razcle</title><link>https://news.ycombinator.com/item?id=30956624</link><guid isPermaLink="false">urn:hackerpapers:mention:2109.11377:30956624</guid><pubDate>Fri, 08 Apr 2022 13:38:03 GMT</pubDate><description>&lt;p&gt;Hi Raza here, one of the other co-founders. I know that HN likes to nerd out over technical details so thought I’d share a bit more on how we aggregate the noisy labels to clean them up. At the moment we use the great Skweak [1] open source library to do this. Skweak uses an HMM to infer the most likely unobserved label given the evidence of the votes from each of the labelling functions. This whole strategy of first training a label model and then training a neural net was pioneered by Snorkel. We’ve used this approach for now but we actually think there are big opportunities for…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2109.11377/"&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>
