<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Random Projections for Linear Support Vector Machines · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1211.6085/</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/1211.6085/feed.xml" rel="self" type="application/rss+xml" /><item><title>Random Projections for Linear Support Vector Machines — mentioned by fiatmoney</title><link>https://news.ycombinator.com/item?id=5487647</link><guid isPermaLink="false">urn:hackerpapers:mention:1211.6085:5487647</guid><pubDate>Wed, 03 Apr 2013 17:43:00 GMT</pubDate><description>&lt;p&gt;Essentially random projection, which has good theoretical justification and comes in handy quite often, for instance, in SVMs [1]. I&amp;#x27;d be concerned about using something as naive as CRC32 though, ideally they&amp;#x27;d be using a cryptographic-strength hash fn. There&amp;#x27;s also an entire area of research around &amp;quot;semantic hashing&amp;quot; and local embedding, that starts with such a random projection, and tries to improve the mapping to be better at a certain task while still remaining low-dimensional. [1] http://arxiv.org/pdf/1211.6085v2.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1211.6085/"&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>
