The author defends e-means as a superior, drop-in replacement for Lloyd's algorithm that uses scaling laws to automatically tune hyperparameters and escape local minima faster. Critics argue the method relies on known techniques like exponential moving averages and mini-batches without sufficient novelty or rigorous comparison against well-tuned baselines like scikit-learn's implementation.
81 readable replies · Supporting reply 1 · Supporting reply 2 · Supporting reply 3 · Supporting reply 4facebookresearch
faiss
C++2017–2026
facebookresearch / faiss
faiss
A library for efficient similarity search and clustering of dense vectors.
45Distinct people
53Mentions
1Explicit recommenders
41.6KGitHub stars
What to know before exploring
What it is
A library for efficient similarity search and clustering of dense vectors.
GitHub
Where it is used
No documented product use was verified in the last source check.
What people are saying
This tutorial is very complex. Here's how to get free semantic search with much less complexity: 1. Install sentence-transformers [1] 2. Initialize the MiniLM model - `model =…
vikp used a recommendation phrase. One indexed comment matches. This is a phrase match, not a verdict.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
- spotify/annoy · linked in 4 of the same discussions
- searchivarius/nmslib · linked in 2 of the same discussions
Mentioned in the same Hacker News threads. That is not proof they are substitutes.
This week on Hacker News
Nov 8–Nov 15 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/15/2026, 2:59:58 PM UTC.
Mentions over time
HN mentions by year53 dated mentions
Observed mentions: 2017-03-02 20:35:13 UTC to 2026-04-10 23:12:49 UTC.
* An incomplete calendar period is marked with an outlined bar. Its count is not directly comparable with a full period.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| 2017 | 2017-01-01 00:00:00 UTC | 2018-01-01 00:00:00 UTC | 2 | 1 | 1 |
| 2018 | 2018-01-01 00:00:00 UTC | 2019-01-01 00:00:00 UTC | 3 | 0 | 3 |
| 2019 | 2019-01-01 00:00:00 UTC | 2020-01-01 00:00:00 UTC | 5 | 0 | 5 |
| 2020 | 2020-01-01 00:00:00 UTC | 2021-01-01 00:00:00 UTC | 1 | 0 | 1 |
| 2021 | 2021-01-01 00:00:00 UTC | 2022-01-01 00:00:00 UTC | 8 | 1 | 7 |
| 2022 | 2022-01-01 00:00:00 UTC | 2023-01-01 00:00:00 UTC | 3 | 0 | 3 |
| 2023 | 2023-01-01 00:00:00 UTC | 2024-01-01 00:00:00 UTC | 20 | 1 | 19 |
| 2024 | 2024-01-01 00:00:00 UTC | 2025-01-01 00:00:00 UTC | 8 | 1 | 7 |
| 2025 | 2025-01-01 00:00:00 UTC | 2026-01-01 00:00:00 UTC | 1 | 0 | 1 |
| 2026 (partial) | 2026-01-01 00:00:00 UTC | 2027-01-01 00:00:00 UTC | 2 | 2 | 0 |
What Hacker News says
2 sourcesAUaub3bhat·Sep 23, 2017
In Relicensing React, Jest, Flow, and Immutable.jsFaiss: A library for efficient similarity search and clustering of dense vectors
9 points · Open discussion