<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervision · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2312.09390/</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/2312.09390/feed.xml" rel="self" type="application/rss+xml" /><item><title>Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervision — mentioned by simonw</title><link>https://news.ycombinator.com/item?id=42143375</link><guid isPermaLink="false">urn:hackerpapers:mention:2312.09390:42143375</guid><pubDate>Fri, 15 Nov 2024 02:16:02 GMT</pubDate><description>&lt;p&gt;From this OpenAI paper (page 29 https://arxiv.org/pdf/2312.09390#page=29 &amp;quot;A.2 CHESS PUZZLES Data preprocessing. The GPT-4 pretraining dataset included chess games in the format of move sequence known as Portable Game Notation (PGN). We note that only games with players of Elo 1800 or higher were included in pretraining. These games still include the moves that were played in- game, rather than the best moves in the corresponding positions. On the other hand, the chess puzzles require the model to predict the best move. We use the dataset originally introduced in Schwarzschild et al. (2021b)…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2312.09390/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
