<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: pbadams</title><link>https://news.ycombinator.com/user?id=pbadams</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 01 Jun 2026 23:10:27 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=pbadams" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by pbadams in "Nvidia RTX Spark"]]></title><description><![CDATA[
<p>There's the Khadas Mind series of mini pcs. They have a proprietary docking interface though. Agree that it would be great if this form-factor was more common.</p>
]]></description><pubDate>Mon, 01 Jun 2026 17:24:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=48359879</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=48359879</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48359879</guid></item><item><title><![CDATA[New comment by pbadams in "Japan's mini kei-truck sales surge in US despite safety concerns"]]></title><description><![CDATA[
<p>The weight and reinforcement of trees, poles, deer, etc. are difficult to change. Single-vehicle crashes cause more than half the crash deaths in the US[1].<p>I don't think the safety record of a motorcycle is a standard to aim for -- but even then a kei truck is at least twice the weight and likely has significantly less sophisticated brakes.<p>[1] <a href="https://www.iihs.org/topics/fatality-statistics/detail/state-by-state" rel="nofollow">https://www.iihs.org/topics/fatality-statistics/detail/state...</a></p>
]]></description><pubDate>Fri, 28 Jun 2024 12:18:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=40819884</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=40819884</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40819884</guid></item><item><title><![CDATA[New comment by pbadams in "Vector indexing all of Wikipedia on a laptop"]]></title><description><![CDATA[
<p>It's not mentioned in the original paper, but DiskANN also supports PQ at build-time via `--build_PQ_bytes`, though it's a tradeoff with the graph quality as you mention.<p>One interesting property in benchmarking is that the distance comparison implementations for full-dim vectors can often be more efficient than those for PQ-compressed vectors (straight-line SIMD execution vs table lookups), so on some systems cluster-and-merge is relatively competitive in terms of build performance.</p>
]]></description><pubDate>Wed, 29 May 2024 20:54:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=40516913</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=40516913</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40516913</guid></item><item><title><![CDATA[New comment by pbadams in "'Like we were lesser humans': Gaza boys, men recall Israeli arrest, torture"]]></title><description><![CDATA[
<p>I think you might be right that encouraging curious discussion of these topics is important to the mission of HN.<p>However, if the moderation approach is going to change, I think it would be better to do so explicitly through changes to the site guidelines rather than in an ad-hoc way. I don't think that this article is covering an 'interesting _new_ phenomenon' (emph. mine) as discussed in the guidelines, and indeed most of the comments are talking about moderation policy or the conflict in general as opposed to the details presented in the article. Perhaps it would be better to have a thread explicitly focused on members of the community engaging with each other as individuals, such as a hypothetical 'Ask HN: How has conflict personally affected you?' or 'Ask HN: How/why have your views on this conflict changed over time?'<p>The stories that the article has to tell are important, but they aren't the thing that people are discussing here. And moderating submissions instead of explicitly discussion-focused posts invites some of the concerns about sourcing and bias that have been raised in other comments.</p>
]]></description><pubDate>Tue, 12 Dec 2023 23:13:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=38620138</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=38620138</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38620138</guid></item><item><title><![CDATA[New comment by pbadams in "OpenAI board in discussions with Sam Altman to return as CEO"]]></title><description><![CDATA[
<p>Something I don't fully understand, from [1], Altman was an employee of the for-profit entity. So to fire him, wouldn't the non-profit board be acting in it's capacity as a director of the for-profit entity (and thus have a fiduciary duty to all shareholders of the for-profit entity)? Non-profit governance is traditionally lax, but would the other shareholders have a case against the members of the non-profit board for acting recklessly w/ respect to shareholder interests in their capacity as directors of the for-profit?<p>This corporate structure is so convoluted that it's difficult to figure out what the actual powers/obligations of the individual agents involved are.<p>[1] <a href="https://openai.com/our-structure" rel="nofollow noreferrer">https://openai.com/our-structure</a></p>
]]></description><pubDate>Sun, 19 Nov 2023 00:56:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=38327029</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=38327029</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38327029</guid></item><item><title><![CDATA[New comment by pbadams in "OpenAI's board has fired Sam Altman"]]></title><description><![CDATA[
<p>Altman has claimed before that he doesn't hold equity in OpenAI. He could have some kind of more opaque arrangement that gives him a material stake in the financial success of OpenAI, and downplayed it or didn't disclose it to the board.<p>Who knows, though -- I'm sure we'll find out more in the next few weeks, but it's fun to guess.</p>
]]></description><pubDate>Fri, 17 Nov 2023 22:58:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=38311812</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=38311812</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38311812</guid></item><item><title><![CDATA[Measuring the Intrinsic Dimension of Objective Landscapes (2018)]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.uber.com/blog/intrinsic-dimension/">https://www.uber.com/blog/intrinsic-dimension/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=36005524">https://news.ycombinator.com/item?id=36005524</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 19 May 2023 18:52:11 +0000</pubDate><link>https://www.uber.com/blog/intrinsic-dimension/</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=36005524</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36005524</guid></item><item><title><![CDATA[New comment by pbadams in "Product quantization for vector search"]]></title><description><![CDATA[
<p>There are a lot of directions people try to go, making different tradeoffs in the complexity of the clustering, the loss from the quantization, the impact on performance (esp. trying to get some subset of the tables to fit in cache). Readers might be interested in [1], which gives a survey of some of the directions.<p>In general though PQ is a pretty good baseline. I'm glad all these vector DB companies seem to have decided that the best form of marketing is high-quality summaries/tutorials about fundamental concepts, it's a good contribution to the community.<p>[1] Fig. 1 in <a href="https://www.jstage.jst.go.jp/article/mta/6/1/6_2/_pdf" rel="nofollow">https://www.jstage.jst.go.jp/article/mta/6/1/6_2/_pdf</a> (2018)</p>
]]></description><pubDate>Fri, 19 May 2023 18:31:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=36005284</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=36005284</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36005284</guid></item><item><title><![CDATA[New comment by pbadams in "What is a Vector Database? (2021)"]]></title><description><![CDATA[
<p>Apart from the comments you've already gotten, another goal of geospatial systems is to support range queries (e.g. for the bounding box of the user's screen, what are all the businesses in that box). In higher dimensions range queries are mostly useless and the focus is on NN queries.<p>But as the other comments have mostly said, it's mainly dimensionality and scale differences that drive the design differences (e.g. graphs end up working better than trees in high dimensions)</p>
]]></description><pubDate>Fri, 05 May 2023 17:18:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=35832333</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=35832333</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=35832333</guid></item><item><title><![CDATA[New comment by pbadams in "You and Your Research (1986)"]]></title><description><![CDATA[
<p>> Let's put deep learning aside for a second. Can anyone here name a single academic in any other subfield of computer science who had a string of groundbreaking research works where every one of those works is from 1980 or after?<p>Shafi Goldwasser (Probabilistic encryption, zero-knowledge proofs, etc.) got her PhD in 1984.<p>Leslie Lamport is just a bit before your deadline, his 'Time, Clocks' paper came out in 1978, but the bulk of his work was after 1980, including paxos.<p>While there's definitely some truth to your Kuhnian view of 'times of revolution' in a field, I think it's hard to apply that to recent progress because it may just be that it's not clear which research works were groundbreaking without the benefit of hindsight. To me, the revolutionary period of CS research is still ongoing.</p>
]]></description><pubDate>Mon, 01 May 2023 20:22:38 +0000</pubDate><link>https://news.ycombinator.com/item?id=35778619</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=35778619</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=35778619</guid></item><item><title><![CDATA[New comment by pbadams in "Google’s “million’s of search results” are not being served"]]></title><description><![CDATA[
<p>Part of the difficulty is, if very few people are browsing to page 2, deciding what to put on page 2 becomes harder and harder.<p>Google has a lot of user behavior signals to decide what should be in results 1-10. Deciding if a page should be ranked 20, 200, or 2000 without any user clicks to check if you're right is really difficult.<p>I would bet that since 2008/9, the relative numbers of spam site operators, Google engineers, second-page searches have changed significantly.</p>
]]></description><pubDate>Mon, 03 Oct 2022 18:06:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=33071358</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=33071358</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=33071358</guid></item><item><title><![CDATA[New comment by pbadams in "Heavier cars are safer for their drivers, but far deadlier for everyone else"]]></title><description><![CDATA[
<p>There are also fewer buses needed to carry the same number of people, and they are operated by professional (and hopefully less distracted!) drivers.<p>I'm not sure a good data source, but I'd expect that the serious injury rate per person-mile of buses is much lower than that of private cars.</p>
]]></description><pubDate>Mon, 12 Sep 2022 04:33:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=32806124</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=32806124</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32806124</guid></item><item><title><![CDATA[New comment by pbadams in "Slow Travel"]]></title><description><![CDATA[
<p>Even if the 'bug' of limited time off is solved, I think people's valuation of their time is still pretty high. The trains/airships would have to be quite nice (read: heavy, expensive, possibly less efficient) for you to be willing to spend so much time in them.<p>On a sillier note, I wonder what the fastest speed you can reach is, in terms of timezones/hr.<p>My guess was a polar route like ANC-HEL, but there don't seem to be any direct passenger flights. Condor flies ANC-FRA seasonally, which is pretty much exactly 1 hour time difference per hour of flight. Another possibility is TAS->URC, at 1.2.<p>The author's routes, YVR-LHR and YVR-NRT, are both 0.8-0.9 hours difference per hour flight time, depending on direction.</p>
]]></description><pubDate>Fri, 19 Aug 2022 02:15:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=32517019</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=32517019</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32517019</guid></item><item><title><![CDATA[New comment by pbadams in "Vector search just got up to 10x faster and vertically scalable"]]></title><description><![CDATA[
<p>I agree in the typical case, but they support concurrent add/delete one of their index options. Handling consistency/contention for modifying whatever graph/tree/etc structure they are using is probably nontrivial, and the resulting cache invalidations would also likely affect the QPS.<p>P.S. Great work on your site, by the way - it's a really inspiring project!</p>
]]></description><pubDate>Tue, 16 Aug 2022 23:59:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=32490660</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=32490660</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32490660</guid></item><item><title><![CDATA[New comment by pbadams in "Vector search just got up to 10x faster and vertically scalable"]]></title><description><![CDATA[
<p>They used to publish some benchmarks on their site, but seem to have removed them. You can find them on archive.org[1]. I guess it is understandable, since vector search performance is pretty unpredictable, and depends on a lot of factors. If their target market is people who want vector search without needing to read a bunch of papers first, benchmarks might be more confusing than they are helpful.<p>edit: While I do think it's understandable, it's not great for transparency. Even if they don't want to open-source their index, I would admire it if they were willing to give ann-benchmarks[2] an API key to publish some independent results.<p>Disclaimer: I work on vector search at a different company<p>[1] <a href="https://web.archive.org/web/20210227105542/https://www.pinecone.io/learn/similarity-search-benchmarks/" rel="nofollow">https://web.archive.org/web/20210227105542/https://www.pinec...</a>
[2] <a href="https://github.com/erikbern/ann-benchmarks" rel="nofollow">https://github.com/erikbern/ann-benchmarks</a></p>
]]></description><pubDate>Tue, 16 Aug 2022 23:30:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=32490423</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=32490423</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32490423</guid></item><item><title><![CDATA[New comment by pbadams in "Vector search just got up to 10x faster and vertically scalable"]]></title><description><![CDATA[
<p>Most vector search research teams are a lot smaller than you suggest, and haven't been around that long (e.g. the FAISS paper was published in 2017).<p>From public info, you can see they have at least one researcher working there. It's believable to me that they could have some new innovations, especially since the product space they're focusing on is different from other teams working on vector search. State-of-the-art for a specific set of constraints is still state-of-the-art.<p>However, considering how much of their edu-marketing content is posted to HN, it would be great if they could share more details about the internals of their index with the community. One of the great things about vector search is how many techniques are open sourced or documented in papers :).<p>Disclaimer: I work on vector search at a different company</p>
]]></description><pubDate>Tue, 16 Aug 2022 23:22:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=32490344</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=32490344</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32490344</guid></item><item><title><![CDATA[New comment by pbadams in "Product Quantization: Compressing high-dimensional vectors"]]></title><description><![CDATA[
<p>In addition to these other answers, a commonly used metric in the literature is the k-Recall@R, or the portion of the top k ground-truth vectors that are found in the top R ANN queries. This parametrization can make it clearer when comparing between different approaches<p>For your case, you might find it helpful to look at the excellent ann-benchmarks.com, and in particular the benchmarks for GIST, which is an image embedding.</p>
]]></description><pubDate>Thu, 02 Sep 2021 21:25:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=28397559</link><dc:creator>pbadams</dc:creator><comments>https://news.ycombinator.com/item?id=28397559</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=28397559</guid></item></channel></rss>