<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Are Convex Optimization Curves Convex? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2503.10138/</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/2503.10138/feed.xml" rel="self" type="application/rss+xml" /><item><title>Are Convex Optimization Curves Convex? — mentioned by lewhoo</title><link>https://news.ycombinator.com/item?id=45011704</link><guid isPermaLink="false">urn:hackerpapers:mention:2503.10138:45011704</guid><pubDate>Mon, 25 Aug 2025 08:48:25 GMT</pubDate><description>&lt;p&gt;&amp;quot;Now the only reason why I won&amp;#x27;t post this as an arxiv note, is that the humans actually beat gpt-5 to the punch :-). Namely the arxiv paper has a v2 arxiv.org/pdf/2503.10138v2 with an additional author and they closed the gap completely, showing that 1.75/L is the tight bound.&amp;quot; I really don&amp;#x27;t know what to make of this. The conclusion is that a model could still do this without the paper containing the exact info on how to do this ?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2503.10138/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.OC</category></item></channel></rss>
