<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Consistency of Lipschitz learning with infinite unlabeled data and finite labeled data · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1710.10364/</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/1710.10364/feed.xml" rel="self" type="application/rss+xml" /><item><title>Consistency of Lipschitz learning with infinite unlabeled data and finite labeled data — mentioned by WAMoezart</title><link>https://news.ycombinator.com/item?id=29479367</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.10364:29479367</guid><pubDate>Tue, 07 Dec 2021 23:12:33 GMT</pubDate><description>&lt;p&gt;A simple way to do SSL with not enough data is Lipschitz learning. It avoids the necessity for pseudo-labeling and computes an absolutely minimizing Lipschitz extension of the labels instead. https://arxiv.org/abs/2111.12370 https://arxiv.org/abs/2012.03772 https://arxiv.org/abs/1901.05031 https://arxiv.org/abs/1710.10364&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.10364/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.AP</category></item></channel></rss>
