<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Taylorformer: Probabilistic Modelling for Random Processes including Time Series · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.19141/</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/2305.19141/feed.xml" rel="self" type="application/rss+xml" /><item><title>Taylorformer: Probabilistic Modelling for Random Processes including Time Series — mentioned by omernivro</title><link>https://news.ycombinator.com/item?id=40620385</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.19141:40620385</guid><pubDate>Sat, 08 Jun 2024 21:47:11 GMT</pubDate><description>&lt;p&gt;This is an interesting study. A similar permutation approach appears already in the Taylorformer paper (https://arxiv.org/pdf/2305.19141v1). The authors use a Transformer decoder for continuous processes, like time series. During training, each sequence is shuffled randomly. Each sequence element has a positional encoding. Then, they use log-likelihood on the shuffled sequence. There, the permutation helps with predictions for interpolation, extrapolation and irregularly sampled data. Also, they show it helps with &amp;#x27;consistency&amp;#x27;, i.e., roughly the MSE is the same regardless of the generated…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.19141/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
