<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Top-K Tau-Path Screen for Monotone Association · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1509.00549/</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/1509.00549/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Top-K Tau-Path Screen for Monotone Association — mentioned by acaloiar</title><link>https://news.ycombinator.com/item?id=24766866</link><guid isPermaLink="false">urn:hackerpapers:mention:1509.00549:24766866</guid><pubDate>Tue, 13 Oct 2020 16:06:56 GMT</pubDate><description>&lt;p&gt;The optimizations here are uncannily similar to the ones I performed for an algorithm we developed for application in bioinformatics. It began with a statistics post-doc who knew some R. It was very brute-force. https://arxiv.org/pdf/1509.00549.pdf (Results on page 28) I suspect we would have seen similar speedups with larger vectors. If you look at the tweaks to the algorithm, they&amp;#x27;re relatively minor, but with very significant gains. Sorry about the code syntax; the audience for the paper were statisticians.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1509.00549/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.AP</category></item></channel></rss>
