<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Chasing Convex Bodies Optimally · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.11968/</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/1905.11968/feed.xml" rel="self" type="application/rss+xml" /><item><title>Chasing Convex Bodies Optimally — mentioned by woopwoop</title><link>https://news.ycombinator.com/item?id=33616873</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.11968:33616873</guid><pubDate>Tue, 15 Nov 2022 23:45:26 GMT</pubDate><description>&lt;p&gt;The first thing I tried was &amp;quot;Lipschitz selection&amp;quot;, a somewhat overloaded phrase that I encountered a lot in graduate school. I guess I had in mind a summary of this paper: https://arxiv.org/abs/1801.00325 but would have been happy with a description of work related to this paper: https://arxiv.org/abs/1905.11968 or any number of other things. The page I got stated the following, obviously false, &amp;quot;theorem&amp;quot;: let M be a metric space, and let S be a subset of M such that inf_{y in S} d(x, y) &amp;lt; infinity for all x in M. Then there exists a map f: M to S such that f(x) = x for all x in S. As far as…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.11968/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
