<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning Online Alignments with Continuous Rewards Policy Gradient · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1608.01281/</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/1608.01281/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning Online Alignments with Continuous Rewards Policy Gradient — mentioned by pizza</title><link>https://news.ycombinator.com/item?id=43901785</link><guid isPermaLink="false">urn:hackerpapers:mention:1608.01281:43901785</guid><pubDate>Tue, 06 May 2025 04:22:23 GMT</pubDate><description>&lt;p&gt;Think of it as generating a constantly streaming infinite list of latents. These latents are basically decoded to a tuple [time_until_my_turn(latent_t), audio(latent_t)]. You can train it to minimize the error of its time_until_my_turn predictions from ground truth of training samples, as well as the quality of the audio generated. Basically a change-point prediction model. Ilya Sutskever (among others) worked on something like this long ago, it might have inspired OpenAI&amp;#x27;s advanced voice models: &amp;gt; Sequence-to-sequence models with soft attention had significant success in machine translation…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1608.01281/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning Online Alignments with Continuous Rewards Policy Gradient — HN submission</title><link>https://news.ycombinator.com/item?id=12301476</link><guid isPermaLink="false">urn:hackerpapers:submission:1608.01281:12301476</guid><pubDate>Tue, 16 Aug 2016 23:40:25 GMT</pubDate><description>&lt;p&gt;Learning Online Alignments with Continuous Rewards Policy Gradient&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1608.01281/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
