r/machinelearningnews • • 3d ago

Cool Stuff CopilotKit releases OpenBot 1.0, an MIT-licensed self-hostable AI coworker workspace with policy checks on every action

26 Upvotes

CopilotKit just released OpenBot 1.0. It is an open-source agent workspace where each Bot gets its own browser, files and tools, and every action passes a policy gateway before it runs. You bring your own AG-UI agent and model keys, and run it on a laptop or in your own Kubernetes cluster.

What it does

  • Plugs in any AG-UI agent (Claude Agent SDK, OpenAI Agents SDK, LangChain, Google ADK, Mastra, AWS Strands, Microsoft Agent Framework, CrewAI)

  • Supports OpenAI, Claude, Gemini, Grok, plus Kimi, DeepSeek, Qwen, Nemotron and Mistral

  • CEL policy: deny before allow, fail closed, audit row written before the action

  • New in 1.0: desktop app for Mac and Windows, Teach a Bot (record a task once, get a reusable skill), Bot-to-Bot handoff, multiple app accounts via Composio and Arcade

Key numbers

  • 9 model families, 8 named agent frameworks

  • Free for personal use; up to $29 per active user per month for business

  • 5% charge on model spend above $5,000 per month

  • 1 Helm chart for AWS (EKS), Azure (AKS), Google Cloud (GKE) or any Kubernetes cluster

Full analysis: https://www.marktechpost.com/2026/11/12/copilotkit-openbot-1-0-open-source-ai-coworker/

Repo: github.com/CopilotKit/OpenBot

Site: open.bot

Release notes: github.com/CopilotKit/OpenBot/releases/tag/v1.0.0


r/machinelearningnews • • 5d ago

Cool Stuff Marktechpost launches GPU Leaderboard and a Chrome extension: cloud GPU inference prices across multiple providers (8×H100 run: $967 vs $3,545)

Post image
12 Upvotes

We at Marktechpost just shipped GPU Leaderboard. It is a free portal that ranks cloud GPU offers by price per GPU-hour for inference. Prices are read from each provider's own pricing page and refreshed daily at 06:00 UTC. A companion Chrome extension, Deploy It, shows VRAM needs and the cheapest GPU on Hugging Face model pages.

What it does

  • Ranks 201 live instances (148 on-demand, 53 spot) from 24 providers across 37 accelerators

  • Prices a whole run: GPU count, duration and utilization, at every provider

  • Lists the lowest on-demand floor per GPU, from RTX A4000 ($0.10/hr) to GB300 ($13.44/hr)

  • Extension estimates VRAM at FP16, INT8 and INT4 on Hugging Face pages and GitHub repos

Key numbers (as listed 10 Nov 2026)

  • 8×H100 for 72 h: $967.68 cheapest (Latitude), $1,716.48 median, $3,545.28 priciest (CoreWeave)

  • H100 floor: $1.68/hr; H200 floor: $2.30/hr; B200 floor: $5.43/hr

  • $1.68/hr at 90% utilization works out to $1.87 per used GPU-hour


r/machinelearningnews • • 3h ago

Research How much can we actually trust open base model benchmarks anymore? New study ("Benchleaking") finds ERNIE-5.5-Flash-Base reciting unseen test sets in exact order.

1 Upvotes

Link to the report & repo:https://github.com/GAIR-NLP/Benchleaking

Saw this making the rounds today and thought it was worth sharing here. Basically, they removed stop tokens during few-shot evals and found that ERNIE-5.5-Flash-Base just keeps going after answering—reciting 96% of HumanEval, 85% of OpenBookQA, and 80% of GSM8K verbatim in exact dataset order (including reference solutions and even original typos like "for examble:" in HumanEval #67).

Across the four open base models they tested, zeroing out leaked items drops the 20-benchmark average by up to 16.6 points on heavily contaminated ones, while cleaner base models stay within 1.5 points of their original scores. Curious how people doing SFT/RL on open weights feel about this—does pre-training contamination ruin downstream evals for everyone else too?


r/machinelearningnews • • 4h ago

ML/CV/DL News is it worth to learn classic ml or nlp ?

0 Upvotes

r/machinelearningnews • • 9h ago

Research Alibaba releases Qwen4-Max, a proprietary 2.4T MoE with 71B active parameters (1M context, $1.5/M input)

Post image
16 Upvotes

Alibaba's Qwen team released Qwen4-Max, the first Qwen4 model. It is a closed, API-only sparse MoE with a 2.4T-parameter backbone, 71B active parameters per token, native vision and a 1M-token context. Alibaba also cut API prices versus Qwen3.8-Max. All benchmark numbers below are self-reported by Alibaba or cited by Alibaba from third-party leaderboards.

What it does

  • Reads text, images and video, writes text, with up to 393K output tokens

  • 3 Gated DeltaNet layers per Qwen Sparse Attention (QSA) layer; QSA uses a lightweight indexer to select context at micro-block granularity

  • 4 gated residual branches plus 328B N-gram Embedding parameters at layer 2

  • OpenAI-compatible and Anthropic-compatible API, function calling, structured outputs, caching, batch, fine-tuning

Key numbers (self-reported)

  • First on 4 of 16 charted benchmarks: HLAB-Vals-1.1 21.3, Agents' Last Exam v1.1 46.7, BioMysteryBench 85.0, DeepSWE v1.1 75.7

  • Work360 (Alibaba's in-house benchmark): 52.69 vs 47.74 for Qwen3.8-Max

  • Work360 cost per task: $4.43 to $1.67 (62% lower); up to about 50% fewer tokens

  • Price: $1.5 input / $4.5 output / $0.075 cached input per 1M tokens (Qwen3.8-Max: $2 / $6 / $0.25)

Full analysis: https://www.marktechpost.com/2026/11/16/alibaba-qwen4-max-release/

Technical details: qwen.ai/blog?id=qwen4-max

API: qwencloud.com/models/qwen4-max

Pricing: qwencloud.com/pricing/token-plan


r/machinelearningnews • • 1d ago

Research LongMemEval-S: 96.0% with the official judge, and what top-5 vs top-20 retrieval changes

Thumbnail
reddit.com
3 Upvotes

r/machinelearningnews • • 2d ago

Research Cmpnd releases dspy-wsp, a DSPy optimizer where GPT-6-Astra edits model weights directly (d1-omni-600M +18.3 pts on Typed Decisions)

Post image
30 Upvotes

Cmpnd released dspy-wsp, a prototype DSPy optimizer built on the "Sparks of Weight-Space Programming" work from MIT CSAIL (Takehi, Teoh, Zhang, Khattab). A frontier "writer" LLM reads a small student model's weights in a sandbox, edits them with Python, and checks edits with a capped number of forward passes. No gradients and no training data pipeline. All numbers below are self-reported by Cmpnd.

What it does

  • WeightSpace optimizer works with any DSPy module and metric

  • Writer: gpt-6-astra at max reasoning effort, 25 forward passes per run

  • Writer sees practice examples and holdout scores, never holdout examples; a hidden valset is used once at the end

  • Output is a patch (manifest.json + edit.npz) with sha256 hashes, so anyone with the public base model can rebuild the edited weights

  • Backends: Liquid AI d1-omni, d1-2B, NanoJev; text LLMs via vLLM, HF or MLX

Key numbers (Typed Decisions, 400 held-out cases)

  • d1-omni-600M: 50.9% → 66.9% (WeightSpace) → 69.1% (+ ReAnchor)

  • NanoJev (Qwen3-0.6B): 39.2% → 52.4% → 56.4%

  • d1-2B: 60.6% → 74.0% → 77.9%

  • Clef-Flash 9B: 68.8% → 70.7% → 75.3%

  • Cost: $5.42 to $7.63 per run, 78 to 167 minutes, on 1 Mac

Full analysis: https://www.marktechpost.com/2026/11/14/cmpnd-dspy-wsp-weight-space-programming/

Repo: github.com/cmpnd-ai/dspy-wsp

Blog: cmpnd.ai/blog/weight-space-programming-dspy.html

Research: rikiyat.github.io/blog/weight-space-programming


r/machinelearningnews • • 2d ago

Research Temperature, top-k and top-p explained: the model only sets the odds, a sampler rolls the dice, and temperature 0 does not promise the same answer every time

19 Upvotes

A language model never picks a word. Its last output is a list of scores, one for every token it knows (262,144 of them on one model we run). Ordinary code outside the network, called a sampler, turns the scores into chances and draws one token. Temperature, top-k, top-p, min-p and the repetition penalty are the settings on that draw.

The guide works one made-up example by hand: five candidate tokens after "The lighthouse keeper poured a cup of", with scores 3, 2, 1, 0 and -1. Divide the scores by the temperature and the favourite, "tea", gets 86.5 % of the draws at 0.5, 63.6 % at 1 and 42.9 % at 2. The order never changes; temperature decides how often the long shots come up. Top-k, top-p and min-p then cut the unlikely tail in three different ways: on the same table, top-p 0.9 keeps 2, 3 or 4 tokens depending on the temperature.

Two things worth knowing before you compare outputs. The defaults differ: as documented on 2026-11-13, llama.cpp's server and Ollama ship temperature 0.8 and vLLM ships 1.0; top-k is 40, 40 and off; top-p is 0.95, 0.9 and off. And the order differs: llama.cpp cuts first and applies temperature last, vLLM applies temperature first. With only temperature 2 and top-p 0.9 switched on, one order keeps four of our five tokens and the other keeps three, so the same two numbers give different text.

Temperature 0 removes the dice and takes the top score. It does not promise the same answer every time: llama.cpp's own server manual warns that "the logits are not guaranteed to be bit-for-bit identical for different batch sizes". And the likeliest token is not a checked fact.

What it cannot tell you: which settings are best. Nothing was tested for this guide; the example's scores are made up and the arithmetic is ours; the defaults are one day's reading of each project's documentation, and a model's maker or a single request can override them.

The practical point: before comparing two answers, ask three things: which settings, in which order, set by whom.

The guide, with every source: https://research.strata2signal.com/temperature-and-sampling-in-plain-words/

A small human team asked for this; AI agents read the sources and drafted it; every figure is linked to its source on the page.


r/machinelearningnews • • 3d ago

Research 🏆 Introducing XYBench: Can LLMs solve the problem behind your question? (EMNLP 2026 Best Resource Award)

Thumbnail gallery
5 Upvotes

r/machinelearningnews • • 3d ago

Research Perplexity releases Decider v1.3 and Flash v1.3, open-weight decision models with span extraction (91.6% on 63 query-classification tasks)

Post image
15 Upvotes

Perplexity released pplx-decider-v1.3 (built on Qwen3.8-27B) and pplx-decider-flash-v1.3 (distilled into Qwen3.5-4B) under Apache 2.0. They answer yes/no, multiple-choice and score questions with probabilities instead of generated text. The new Locate feature extracts exact text spans with character offsets.

What it does

  • Takes a shared state (text or images) plus multiple labeled questions, answered in 1 forward pass

  • v1.3 isolates questions: each sees only the state and itself, unlike v1.2

  • Locate returns spans for NER, PII and extractive QA via a span head plus an unmerged LoRA adapter

  • Available on Hugging Face, OpenRouter and the Perplexity Decisions API

Key numbers (all self-reported by Perplexity)

  • 91.6% mean accuracy on 63 query-classification tasks

  • 83.99 nDCG@10 on 72 retrieval tasks (+1.81 vs Qwen3-Reranker-8B, +2.24 vs Jev 1.14)

  • Locate average 69.0 (v1.3) and 63.6 (Flash) vs 43.3 for Liquid d1 and 33.6 for GLiNER large v2.5

  • 93.98% agreement with frontier LLM judges on 1M real API requests (Jev 1.14: 93.35%)

  • $26.47 to run those 1M requests vs $68.10 for Jev 1.14

  • API: $0.02 (v1.3) and $0.01 (Flash) per 1M input tokens, output free

Full analysis: https://marktechpost.com/2026/11/13/perplexity-decider-v1-3-open-weight-decision-models-locate/

Model: http://huggingface.co/perplexity-ai/pplx-decider-v1.3

Flash: http://huggingface.co/perplexity-ai/pplx-decider-flash-v1.3

Docs: http://docs.perplexity.ai/docs/decisions/quickstart

Blog: http://perplexity.ai/hub/blog/perplexity-decider


r/machinelearningnews • • 3d ago

AI Tools Kapso: Evolving harness by learning from experimentation

8 Upvotes

Hey guys!

https://github.com/Leeroo-AI/kapso

We built Kapso, an engine that runs experiments toward an objective, deploys the best solution on your stack and learns from every run into a bank of lessons with a credence score and a boundary.

You can view a video walkthrough here: https://www.youtube.com/watch?v=W4FHlza1fRs

Here’s how it works…

Kapso has a bank of lessons that are induced or deduced from the past experiments, and each carries a credence score, conditions on where it applies, and the evidence behind it.  For each new experiment, an ideation module proposes ideas considering the earlier lessons, re-ranks them by expected return against the budget each would use, and sends the top-ranked ones to the implementor. Because the bank keeps learning from the past experiments in that environment, the proposed ideas are better suited to it than generic hypotheses from an LLM or RAG. Also, results of each experiment are verified by a verifier module that no experiment can access and cheat. As we’ve found when building such systems, sometimes the success criteria and evaluation tests need to be evolved. The experimentation modules can propose updates to the metrics and criteria for the verifier to approve or reject.

After each run, learn() updates the bank of lessons’ scores and boundaries using the evidence from that run. Changes to the bank can also be A/B tested by running otherwise identical builds with the previous and updated banks. The bank is built on git, so you can share your experience with others, list the banks available to you, and update them (`kapso experience share/list/update` in CLI). The system is model-agnostic and coding-agent-agnostic.

kapso.deploy(solution, target_stack) follows the same workflow, runs a shorter experimentation loop to adapt the best solution to the target stack (e.g. Docker, Modal, BentoCloud, LangGraph). Every domain has a harness to start from, you can write your own domain harness with /kapso:harness in the plugin or through CLI (kapso harness new <name>), and compound over that by running experimentations.

We ran it on some public benchmarks and live competitions, with the following results…

- Predictive modelling on relational databases: first on RelBench, Kumo AI (now Nvidia) and Stanford's benchmark, ahead of the best tabular foundation model (https://star-project.stanford.edu/relbench/leaderboard/). This shows that keeping the learning in the harness-level can beat foundational table models. Updating a bank of lessons costs far less than retraining a tabular foundation model.

- ML Engineering: First on OpenAI's MLE-bench at submission, still among the top open-source systems (https://github.com/openai/mle-bench/pull/107).

- AI competitions: ahead of the best agent the ALE-Bench authors at Sakana AI reported, and running autonomously at the live International Olympiad in AI 2026, above all 471 human contestants and in the top three AI systems (https://ioai-official.org/ai-models-track/ioai%c2%b2-2026-report/).

We have a public bank for ML and Data at Leeroopedia (https://leeroopedia.com/): around 100k pages extracted by experimenting on papers and repos, about 6M requests a month, about 28% from AI agents.

We would like to get your feedbacks on how to improve our learning!


r/machinelearningnews • • 3d ago

Research Gradient-free local physical weight writing for LLMs (PoC on single 5070 Ti)

3 Upvotes

Hey everyone,

I'm an independent researcher exploring test-time training and continual learning. Instead of using external vector databases (RAG) or gradient-based parameter updates (LoRA), I tried a different approach: direct, gradient-free physical writing into FFN weights during inference, controlled by a frequency-threshold mechanism and a safety "Triple-Lock" system (clipping, norm, rollback).

Results:

Limitations: Currently only L1 (single entity) is robustly validated due to single-GPU constraints (RTX 5070 Ti, 12GB). Multi-concept coexistence (L2) causes semantic leakage, which is the next challenge I'm tackling.

I hold a patent pending (App No. 2026111114738) and a TSA timestamp (2026-06-20) which precedes recent related works from Stanford/MIT, establishing independent priority for this specific mechanism.

Full 14-min video demo (English audio, Chinese subtitles): [YouTube Link: https://youtu.be/v1J8V2aSMfE]
Code & Whitepaper: [GitHub Link: https://github.com/SUANNIYUZHUANXU/dual-zone-memory]

I am looking for technical feedback, and potential collaboration or compute resources to scale this. Happy to answer any questions about the Hebbian update or the Triple-Lock mechanism.

Thanks for reading!


r/machinelearningnews • • 3d ago

Research Google releases Gemini 4 Hydrogen, a fast agentic model with a 1M window (57% on Terminal-Bench 4.1, self-reported)

Post image
19 Upvotes

Google released Gemini 4 Hydrogen, a closed-weights model for fast coding and agent work. It sits below Gemini 4 Carbon and Argon, and is adapted from Carbon per the model card. It ships with 4 thinking levels and a 1,048,576-token unified window. Pricing is $1.50/$7.50 per 1M tokens.

What it does

  • Runs everyday agent loops: edits, package updates, tests, data and spreadsheet work.

  • Thinking levels via thinking_level: low, medium, high (default), xhigh. minimal returns an error.

  • Pairs with Carbon in Antigravity's Orchestrator: Carbon plans, Hydrogen executes, then hands back on friction.

Key numbers (self-reported by Google)

  • Artificial Analysis Intelligence Index: 51 at high, 54 at xhigh (Argon: 50).

  • Terminal-Bench 4.1: 57% vs 18.2% for Gemini 3.8 Flash.

  • Vals Tax Agent Bench: 52.3%, ranked #1 overall. Vals Legal Research: 55.8%, tied #1.

  • 2.5x faster task completion than 3.8 Flash at the default high level.

  • Orchestrator (Carbon + Hydrogen): near-Carbon success, 24% less quota, 19% faster.

Full analysis: https://www.marktechpost.com/2026/11/13/google-gemini-4-hydrogen/

Blog: blog.google/innovation-and-ai/models-and-research/gemini-models/introducing-gemini-4-hydrogen/

Model card: storage.googleapis.com/deepmind-media/Model-Cards/Gemini-4-Hydrogen-Model-Card.pdf

Docs: aistudio.google.com/docs/whats-new-gemini-4-hydrogen


r/machinelearningnews • • 3d ago

Research Speculative decoding explained: draft heads, what "acceptance" really counts, and why every tok/s figure should say if a drafter was on

13 Upvotes

A language model writes one token per pass through its weights, and that pass is the slow part. Speculative decoding adds a cheap guesser, a "drafter": it proposes the next few tokens, the model checks them all in one pass and keeps the run of right ones. Guess four and all four are right: five tokens from one pass. First guess wrong: one token, the same as without it. Done by the textbook rule (Leviathan, Kalman and Matias, 2022), the output comes from the same distribution as before.

The drafter can be a second small model, a head trained into the model itself (Medusa, or the multi-token-prediction heads in DeepSeek-V3 and Qwen3.8-Flash-Next), or no model at all (n-gram or prompt lookup).

Two things surprised us in our own published runs. On one dense 27B model the engine's log read 2.95 tokens a round with the draft head on, but the model was not 2.95 times faster: over 270 calls the head bought 1.34 to 1.43 times the writing speed (about 109 against 76 tokens a second at a 1K prompt). Tokens a round is a ceiling, not the speed-up. And "acceptance" was three different numbers on one run: 49.1 % of guesses, 2.95 tokens a round, or 86 / 56 / 37 / 16 % by slot.

What it cannot tell you: that is one model on one card, and the two draft-on blocks disagreed by more than the run's own ±3 % tolerance, so the page prints the ratios as a reading, not a settled figure. Nothing new was measured for this guide.

The practical point: a tok/s figure that does not say whether a drafter was on, how deep it guessed and what the engine's log accepted cannot be compared with another one. The guide ends with six questions to ask of any speed claim.

The guide, with every source: https://research.strata2signal.com/draft-heads-and-speculative-decoding/

A small human team asked for this; AI agents read the sources and drafted it; every figure is linked to its source on the page.


r/machinelearningnews • • 4d ago

Research Serin 0.8B: a disclosed demo of a useful model with a hidden trigger

Thumbnail
reddit.com
5 Upvotes

r/machinelearningnews • • 4d ago

ML/CV/DL News A 30B MoE model was running at 6.7 s/token on two V100s. The cause was not the kernels.

0 Upvotes

I'm the author of NeuroBrix, an open-source (Apache 2.0) inference engine that runs models without PyTorch at runtime. I want to share a debugging story from this week, because the cause surprised me.

Setup: Qwen3-Coder-30B-A3B (mixture of experts) on two Tesla V100 32GB. Through the serving daemon, one request took about 11 minutes. From the command line: 6.7 seconds per token.

I assumed the kernels were slow. They were not. Three things were wrong, all in the planning layer:

  1. The hardware profile for the two-card setup was missing two measured values. The memory planner therefore believed the second card was completely free, over-committed it, had to re-plan, and fell back to a slow streaming strategy.

  2. The server sized the conversation cache against the card's total memory instead of its usable part, so the cache took the room that should have held the model's experts.

  3. The daemon reloaded 57 GB of weights and recopied 31 GB of experts at every request.

After fixing those at the source: 0.33 s/token from the command line (20x), and a served 64-token answer went from about 3 minutes to about 30 seconds.

What I took from it: on multi-GPU MoE models, where the experts live matters more than how fast any kernel is. And a missing profile value should be a hard error, not a silent default. It is now.

Honest limits: one model and one conversation per daemon for now, and a single very long prompt (about 80k tokens) is still slow, 39 minutes on that rack.

Code and details: https://github.com/NeuroBrix/neurobrix

Happy to answer questions about the planner or about running old V100s in 2026.


r/machinelearningnews • • 4d ago

Research New Inference Optimization technique speeds DeepSeek-V4.1-Flash up 3x on B200 than vLLM and SGLang running on GB300

Post image
17 Upvotes

It was achieved by dynamically changing the topology based on the load according to their blog


r/machinelearningnews • • 4d ago

Research Google DeepMind releases AlphaGenome 2, a cell-type-conditioned DNA model (30% vs 16% causal sc-eQTL recall at 90% precision)

Post image
14 Upvotes

Google DeepMind released AlphaGenome 2, a sequence-to-function model that takes 1 Mb of DNA plus a target tissue, cell type or cell state. AlphaGenome 1 predicted a fixed set of bulk tracks. This version predicts 1 condition per call and can build conditions from your own scRNA-seq data without fine-tuning.

What it does

  • Conditions encoder, transformer and decoder on a 256-d embedding via FiLM

  • Predicts expression, splicing, ATAC, histone marks, TF binding, contact maps and now CpG methylation

  • Imputes unmeasured assays for a condition from the ones that were measured

  • Ships precomputed enhancer-gene links (640 conditions) and about 7M variant scores (510 conditions)

Key numbers (self-reported, from the paper)

  • TenK10K sc-eQTLs: 30% causal recall at 90% precision vs 16% for AlphaGenome 1 fine-tuned

  • Effect-direction recall at 90% accuracy: 43% vs 23%

  • Held-out ENCODE-rE2G CRISPRi enhancer-gene AUPRC: 0.78 vs 0.73 (AG1) vs 0.61 (Borzoi ensemble)

  • Beats Avocado on 166 of 181 held-out imputation tracks

Full analysis: https://www.marktechpost.com/2026/11/11/google-deepmind-alphagenome-2-cell-type-variant-effects/

Paper: storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphagenome-2-deciphering-how-cells-read-dna-to-better-understand-disease/alphagenome-2.pdf

Docs: alphagenomedocs.com

Blog: deepmind.google/blog/alphagenome-2-deciphering-how-cells-read-dna-to-better-understand-disease/


r/machinelearningnews • • 4d ago

ML/CV/DL News How fast can Cerebras order your breakfast on Kimi K3.1 Pro?

0 Upvotes

r/machinelearningnews • • 5d ago

Research Weight-space programming

Thumbnail reddit.com
4 Upvotes

r/machinelearningnews • • 5d ago

Research Independent Assessment of AI R&D Acceleration at Anthropic in October 2026

Thumbnail
metr.org
10 Upvotes

r/machinelearningnews • • 5d ago

Research Meta FAIR releases e-means, a k-means replacement in FAISS 1.16.0 (matches 25 Lloyd epochs in 1.4 to 2.6)

Post image
52 Upvotes

Meta FAIR researchers released e-means, a mini-batch replacement for Lloyd's k-means. It updates centroids with exponential moving averages of each cluster's sum and count. Fitted scaling laws set batch size and step size, so only k needs choosing. It ships in FAISS 1.16.0 under faiss.contrib.e_means.

What it does

  • Replaces full-dataset passes with EMA mini-batch updates: S ← (1−α)S + αs, same for N.

  • Sets batch size B and step α0 from n, k and epochs T, with a cosine-decayed step.

  • Revives dead clusters by splitting large ones, then finalizes on each cluster's exact mean.

  • Uses fused GPU kernels for nearest-centroid assignment.

Key numbers (self-reported)

  • Beats Lloyd's 25-epoch test loss in 1.4 to 2.6 epochs.

  • 10-45x GPU wall-clock speedup vs Flash-KMeans; 8-15x on CPU vs Faiss.

  • 1.6 to 2.4 epochs on all 11 VIBE embedding datasets.

  • On a 5-blob toy, Lloyd stayed stuck on 46% of 200 starts; e-means on 0%.

  • DEEP, k = 16,384: 47 dead clusters with revival vs 4,313 with it off.

Full analysis: https://www.marktechpost.com/2026/11/10/meta-fair-e-means-k-means-faiss/

Paper: arxiv.org/abs/2611.09501

Repo: github.com/facebookresearch/faiss/tree/main/contrib/e_means

Blog: e-means.github.io


r/machinelearningnews • • 6d ago

ML/CV/DL News Fearless Engineering: The CS-4 is our first engineering documentary.

0 Upvotes

r/machinelearningnews • • 7d ago

AI Tools HyperspaceDB v4.2.3: 1.58-bit BitNet quantization (15.5× compression, 92.6% recall), and fixing the HNSW 5–10% filtered search cliff (154× faster than OpenSearch 3.9)

Thumbnail
reddit.com
7 Upvotes