Recent submissions

Comment · 2 years ago
Spoiler alerts but this exactly the plot twist at the end of the book "Around the World in 80 Days" by Jules Verne

https://en.wikipedia.org/wiki/Around_the_World_in_Eighty_Day...

The following day Fogg apologises to Aouda for bringing her with him since he now has to live in poverty and cannot support her. Aouda confesses that she loves him and asks him to marry her. As Passepartout notifies a minister, he learns that he is mistaken in the date – it is not 22 December, but instead 21 December. Because the party had travelled eastward, their days were shortened by four minutes for every degree of longitude they crossed; thus, although they had experienced the same amount of time abroad as people had experienced in London, they had seen 80 sunrises and sunsets while London had seen only 79. Passepartout informs Fogg of his mistake and Fogg hurries to the Club just in time to meet his deadline and win the wager. Having spent almost £19,000 of his travel money during the journey, he divides the remainder between Passepartout and Fix and marries Aouda.

Comment · 2 years ago
> Pay yourself and a VC-appointed board member below market rate, hire six good engineers, lease some office space, buy equipment, pay for legal and accounting services… and presto, you’re burning through $5M a year

Would love to see the math behind this. How does this add up to $5M/year??

Comment · 2 years ago
Founder of Modal here. We've spent a ton of time on this, including building our own distributed file system optimized for low-latency high-througput workloads. We don't use K8s or Docker and built our own custom infrastructure instead.

Cold starting containers quickly is a fascinating problems. We've gotten a long way but there's still a lot more to do. For GPU-based inference, starting containers isn't enough – you also need to initialize the model GPU quickly. We are working on a long list of things that will bring down cold start latency even further.

Comment · 3 years ago
Annoy author here. What you're describing is Locality Sensitive Hashing (LSH) which is something I spent a lot of time trying back in 2009-2012 but never got it working. It has some elegant theoretical properties, but empirically it always has terrible performance. The reason I don't think it works well is that data often lies near a lower-dimensionality manifold that may have some sort of shape. LSH would "waste" most splits (because it doesn't understand the data distribution) but using trees (and finding splits such that the point set is partitioned well) ends up "discovering" the data distribution better.

(but HNSW is generally much better than this tree paritioning scheme)

Comment · 3 years ago
I don't really buy this argument that you can rent and pay $1000/month, or you can buy an equivalent home and pay $1000/month, but now you can deduct interest rate and build equity.

Landlords can also deduct their interest expenses and so they benefit from leverage too (meaning they don't want to build up equity).

In a reasonably efficient market, this means that the equivalent cost of homeownership would be higher than rent, to offset these things (the rate at which you're paying down the principal, and the deductability of interest rate expenses). This is obviously a very simplified argument, and there's a lot of other factors going into this.

Comment · 4 years ago
haha, author here, I do admit that Matt Levine is one of my favorite writers today
Comment · 7 years ago
I'm one of the authors – there's actually slightly newer benchmarks at http://ann-benchmarks.com/

Reminds me it's probably time to re-run the benchmarks and publish newer numbers

Comment · 7 years ago
i'm the author – would love to read any existing literature on this if you can provide any pointers!
Comment · 7 years ago
I wrote the code and you're wrong :)

1. Diagonal moves have a slightly higher weight. 2. I have an edge weight of 100 to go through another person. This makes it possible to go _towards_ the right direction even though there is no path 3. For the perpendicular lines method, the distance is modified to 1e-3 4. A* doesn't work because the heuristic becomes pretty useless when you have moves that are very "cheap": you need a lower bound that's pretty much zero

So for all those reasons, I just went with plain old Dijkstra!

Comment · 8 years ago
This is probably just a variant of Berkson's paradox, similar to Google's observation that success in programming competitions is negatively correlated with job performance: http://www.catonmat.net/blog/programming-competitions-work-p...

The mechanism would work this way: sales people exhibit multiple features, and they are promoted based on some combination of those. If a sales person has outstanding other credentials, they might be promoted despite poor sales percentile. Those other credentials might actually be better predictors of managerial experience. Conversely, many of the top sales people might have been promoted on the grounds that they were good sales people, without exhibiting any other skills.

Note that there might still be a positive correlations between sales skills and managerial skills, but due to how the promotions are selected, you end up observing a negative correlation in the promoted group.

https://en.wikipedia.org/wiki/Berkson%27s_paradox

Comment · 8 years ago
They should have used containers.
Comment · 9 years ago
I've found these tools extremely useful to understand user behavior. We rely on Fullstory all the time to improve the user experience, to identify bugs, and to debug user issues.

The result of these tools is a far better user experience on our site and many other sites.

"recording every keystroke" makes it sound like there's malicious intent, but it's misleading. It should be added that all these tools have a lot of options to avoid tracking sensitive data (like password fields) and we always rely on that (in fact anything else would be a compliance violation for us).

Comment · 9 years ago
classical music has notoriously bad metadata on spotify – it just doesn't fit into the data model of artist/album/track. i think that causes the system to filter out a lot of the listening data or fail to find patterns.

not sure what's up with jazz but i'm guessing it could be a similar problem

Comment · 9 years ago
only thing you can do to influence the collaborative filtering system is to make users listen to both you and some other artist.

as i mentioned in another reply, CF is really what powers DW

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton