<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Hormetic Approach to the Value-Loading Problem: Preventing the Paperclip Apocalypse? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.07462/</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/2402.07462/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Hormetic Approach to the Value-Loading Problem: Preventing the Paperclip Apocalypse? — mentioned by academic_84572</title><link>https://news.ycombinator.com/item?id=44584533</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.07462:44584533</guid><pubDate>Wed, 16 Jul 2025 17:03:26 GMT</pubDate><description>&lt;p&gt;Slightly tangential, but we recently published an algorithm aimed at addressing the paperclip maximizer problem: https://arxiv.org/abs/2402.07462 Curious what others think about this direction, particularly in terms of practicality&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.07462/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>A Hormetic Approach to the Value-Loading Problem: Preventing the Paperclip Apocalypse? — HN submission</title><link>https://news.ycombinator.com/item?id=39546577</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.07462:39546577</guid><pubDate>Thu, 29 Feb 2024 05:10:16 GMT</pubDate><description>&lt;p&gt;A possible solution to the superalignment problem?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.07462/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
