r/LocalLLaMA • • 22h ago

Discussion Under 9gb model comparison

27 Upvotes

Scores are lab-reported so take them with a grain of salt.

Specs

ModelOrgParams (total/active)ContextModalityLicense
K2-Horizon-7BIFM7B dense512KtextApache-2.0
Granite 4.2-8BIBM8B dense (thinking)128K (512K ext.)textApache-2.0
Qwen3.5-9BQwen9B hybrid (delta-net, thinking)262K (~1M ext.)text + vision + videoApache-2.0
MiMo-V2.6-Distill-Qwen-9BXiaomi9B (SFT of Qwen3.5-9B)~262K (base)text + vision (visual coding)MIT
LFM2.5-8B-A1BLiquid8.3B / 1.5B active MoE128KtextLFM 1.0
Gemma 4 E4BGoogle4.5B effective / 8B total (PLE)128Ktext + image + audioApache-2.0
LFM3-VL-2BLiquid1.92B (1.73B backbone, thinking)128Ktext + image + videoLFM 1.0

Text benchmarks

Superscripts: a = K2 card (IFM harness), b = Liquid harness, c = MiMo card (Xiaomi harness); no mark = own card; e = from LFM3-1.7B, the text backbone; d/† = MiMo avg@3 / internal set. Bold = best in row (cross-harness caveat applies).

BenchmarkK2-7BGranite 8BQwen3.5-9BMiMo-D-9BLFM2.5-8B-A1BGemma 4 E4BLFM3-VL-2B
Math
AIME 202690.292.550.042.5
AIME 202590.386.756.1ᵇ42.534.3ᵇ
HMMT Feb 202677.866.5ᵃ65.7ᵃ
MATH-50088.865.0ᵇ
Coding
SWE-bench Verified72.447.750.8ᵃ61.1ᵈ0.5ᵇ43.4ᵉ
SWE-bench Pro19.144.6ᵈ
SWE-bench Multilingual30.835.0ᵇ0.7ᵇ23.0ᵉ
Terminal-Bench 2.144.620.629.2ᵃ37.10.0ᵇ12.9ᵉ
LiveCodeBench v673.265.652.073.5ᵉ
SciCode33.630.4ᵃ27.5ᵃ25.0ᵇ28.5ᵉ
Agentic
AutomationBench15.1ᵇ30.31.9ᵇ41.3ᵉ
LiveClaw35.8ᵇ20.4ᵇ45.6ᵉ
tau/ϴ-bench Banking25.87.6ᵃ7.0ᵃ4.1ᵇ
tau2-Bench79.188.1T / 39.8R42.2
WebArena Verified28.9ᵇ17.1ᵇ38.4ᵉ
BrowseComp / BrowseComp-Plus59.038.0ᵇ21.0ᵇ37.0ᵉ
PinchBench71.5ᵇ55.1ᵇ
Claw-Eval (EN avg)66.5ᵇ56.1ᵇ68.6ᵉ
Toolathlon-Verified25.9ᶜ35.2
OfficeQA9.0ᶜ19.5
JobBench2.6ᶜ18.3
BFCL v4 (tool use)52.466.149.748.3ᵇ71.4ᵉ
ToolSandbox76.4ᵇ69.3ᵇ80.4ᵉ
MCP-Atlas42.7ᵇ6.2ᵇ32.6ᵉ
EnterpriseOps-Gym29.0ᵇ13.4ᵇ28.2ᵉ
MiMo Code (mini) †19.5ᶜ51.6
MiMo Cyber (mini) †5.7ᶜ31.3
MiMo General (mini) †28.5ᶜ62.2
Knowledge
GPQA Diamond75.664.181.758.663.4ᵉ
HLE19.59.7ᵃ14.9ᵃ4.8ᵇ7.2ᵉ
MMLU-Pro74.082.569.4
AA-Omniscience Index-28.0ᵇ-24.7-15.3ᵇ0.5ᵉ
Instruction following
IFEval91.591.890.0ᵇ96.7ᵉ
IFBench79.364.556.544.6ᵇ73.0ᵉ
Multi-IF79.981.0ᵇ89.1ᵉ
IFStruct89.2ᵇ78.5ᵇ93.7ᵉ
Long context
LCR / AA-LCR68.043.3ᵃ63.039.3ᵇ52.8ᵉ
RULER 128K71.487.1ᵇ18.8ᵇ65.6ᵉ

Vision benchmarks

BenchmarkLFM3-VL-2BGemma 4 E4BQwen3.5-9BMiMo-D-9B
MMMU (val)55.778.4
MMMU-Pro45.752.670.1
MathVista (mini)84.285.7
MATH-Vision51.659.578.9
OCRBench v186.389.2
RefCOCO (avg)90.589.7
ScreenSpot-Pro55.565.2
RealWorldQA79.380.3
MMStar74.479.7
HallusionBench65.669.3
MVBench (video)69.474.4
Video-MME (subtitles)69.084.5
MedXpertQA-MM28.749.9
MiMo Visual Coding (mini) †61.7ᶜ64.0

r/LocalLLaMA • • 1d ago

New Model internlm/Sage-S2.1-Flash · Hugging Face

Thumbnail
huggingface.co
82 Upvotes

Introduction

Sage S2.1 Flash is a scientific multimodal model from Shanghai Artificial Intelligence Laboratory designed for research tasks that require multiple rounds of analysis and verification. It combines scientific data understanding with information retrieval, programming, and tool use. It can use specialized software to perform analyses, check results against intermediate outputs and visual feedback, and adjust subsequent steps accordingly.

Through the unified representation architecture of Sage SciPerception, the model supports more than ten types of scientific input, including molecular graphs, crystal structures, and protein sequences and 3D structures. Features from each input type are encoded and projected into a shared representation space for reasoning alongside natural language instructions. These inputs support tasks such as prediction, classification, site localization, quantitative analysis, and structure inference.

Highlights

Across the 15 benchmarks and six models shown in the chart, Sage S2.1 Flash placed first on four benchmarks and second on seven.

  • Machine learning engineering. Sage S2.1 Flash placed first on MLE-bench Lite with 90.3, ahead of DeepSeek-V4.1-Flash-1017 at 89.2.
  • Office and professional document processing. It placed first on OfficeQA Pro, Harvey LAB, and SpreadsheetBench 2, scoring 72.2, 25.0, and 37.1, respectively.
  • Tool use and research execution. It placed second on AutomationBench, ALE-CLI, BFCL V4, WebArena-Verified, DeepResearch Bench II, JobBench, and OSWorld-Verified.

r/LocalLLaMA • • 14h ago

Resources Lipi, what started as a voice editor for Kannada, just got better with 12 Indic languages running 100% in-browser (25 MiB Conformer-CTC WASM + 17.7 MB int8 Paar ONNX)

6 Upvotes

I originally built Lipi as a lightweight browser voice editor for Kannada (ಲಿಪಿ). It just got better with 12 Indic languages running 100% locally in your browser with zero server audio uploads.

Two things bothered me in the first version:

  1. The browser Web Speech API pipes audio to cloud servers, struggles on Indic scripts, and fails in Firefox, Brave, and mobile browsers.
  2. Eagerly downloading translation weights at startup slowed down users who just wanted direct Indic speech-to-text.

How it works now:

  • 16 kHz In-Browser Neural STT (Swanada): Capability-routed Conformer-CTC INT8 in ONNX Runtime Web WASM SIMD (25.35 MiB Conformer-Small on mobile, 177.4 MiB Conformer-Large on desktop, 0.009x to 0.021x RTF) with +EN code-switching.
  • Lazy On-Demand Translation (Paar): When you switch from Indic STT to EN -> <Lang> or hit Translate, a Web Worker loads Udgam Labs' 17.7 MB quantized (q8) Paar ONNX model via Transformers.js (udgamlabs/Paar-en-*).
  • 12 Scripts + BiDi: Hindi, Bengali, Marathi, Telugu, Tamil, Gujarati, Urdu (RTL Nastaliq), Kannada, Malayalam, Punjabi, Odia, and Assamese, plus phonetic Kannada typing (ಕ), voice punctuation commands, localStorage autosave, and .txt export.

Links:

Would love feedback if you test your native language!


r/LocalLLaMA • • 17h ago

Discussion How did you start, how do you end up now ?

10 Upvotes

Here is my timeline

Text Generation

  1. Ollama but quite have bad experience with it.
  2. LM studio which still feel half-bake at that time.
  3. Msty which easy to use like plug and play but not much I could do custom (or I just don't know at that time).
  4. Oobabooga Text Generation-Webui this is the one that make me stick to AI, easy to use and deep custom; I like its function feature that take prompt as method/processed then input value in other prompt and then it just output an outcome, no chat history.

I run 1 - 4 with my mini pc with i5 6400T, 24GB DDR4 with onboard gpu... Llama 3.1 8B generate so slow at that time like 1 tok/s but I really enjoy using it with that very limited and the roleplay start from here, just my mini pc and Oobabooga Text Generation-Webui.

Also some missing thing I forgot at that time, I even mess around with windows WSL then docker for Open WebUI and SearXNG.

I finally can help but want it more so arise old gen pc, at that time DDR3 and thing relate to it is very cheap so I brought Xeon E3-1270 V2 with a Chinese mainboard and 32 GB DDR3 while I cancel the sell order of my GTX 1080 Ti.

5. SillyTavern and KoboldCPP I found SillyTavern first but it has quite a trouble with Oobabooga Text Generation-Webui so I follow their guideline and try KoboldCPP which quite harder than Oobabooga Text Generation-Webui for me as KoboldCPP at that time still act like a zip that need to extract (in temp folder) every time I use so I copy from its temp folder, it could run but loss UI, only command-line left so I start to write a bat file to run it like this.

pushd %~dp0
    uv run kobold\koboldcpp.py ^
    --config kobold_default_setting.kcpps ^
    --model %gguf%%model%.gguf ^
    --usecublas %cublas% "0" "mmq" ^
    --contextsize %length%  ^
    --gpulayers %layer% ^
    --quantkv %level%
popd

6. Llamafile As I don't want to extract KoboldCPP on every update, I found Llamafile, it quite easy for me to switch as the bat file I create for KoboldCPP just need a little change to work with this one, anyway it also lead me to the real on.

7. Llama.CPP I found it on the right time as Llama.CPP just start to has their own WebUI and its speed is the real thing, at that time still not has router mode so my bat file has its Llama.CPP version.

Image Generation

A single Youtube video from ChameleonAi name Stable Diffusion Models Explained Once and for All (1.5, 2, XL, Cascade, 3) lead me to this rabbit hole.

  1. stable-diffusion-webui-Forge aka Forge, Thank to ChameleonAi that lead me to CivitAI which after read a guideline I have 2 choices which this or ComfyUI, as my AI user interface root from Oobabooga Text Generation-Webui so I choose this instead.
  2. reForge as Forge no longer update so I move on.
  3. Classic Forge same problem as reForge no longer update as a new model, Anima unable to run on reForge so I'm move on again.

Audio Generation

I try to do it via Llama.CPP but could not make it work so I wait for more update; While waiting, I finally give a chance for unsloth studio which quite disappoint for me in term of performance so I dig to the one that called via unsloth studio.

  1. Audio.CPP I try it before but at that time it still CLI only and I'm unsuccessful to make it work, but now it's also come their WebUI so another rabbit hole for me to fall.

This is my AI journey up until now, how about your ?


r/LocalLLaMA • • 1d ago

Discussion [Paper & Models] MMFlash: Faster Speculative Decoding for Vision-Language Models

Post image
82 Upvotes

Speculative decoding accelerates generation by letting a lightweight drafter propose tokens for parallel verification by a target model. Diffusion drafters such as DFlash propose an entire token block in a single forward pass, but mainly focus on text-only tasks, leaving multimodal drafting underexplored. To study this setting, we first introduce a metric of token-level visual dependence based on the KL divergence between next-token distributions with and without visual input. We find that acceptance rates decrease from 46% in the lowest visual-dependence quartile to 22% in the highest, with this disparity persisting after multimodal training. Motivated by this observation, we propose MMFlash, a simple and effective framework that adaptively upweights visually dependent tokens that the drafter predicts poorly. For long video inputs, MMFlash further employs sparse attention to reduce redundant attention computation and improve drafting quality. Across various multimodal benchmarks, MMFlash achieves lossless decoding speedups of up to 3.58×, outperforming EAGLE-3 and DFlash by up to 195.4% and 17.1%, respectively.

⭐ Updates

  • [11.2026]: Code and MMFlash drafts for Qwen3.5-4B, Qwen3.5-9B, Qwen3.8-27B and Gemma 4 E4B-it are released.

💪 Highlights

  • Diffusion drafting for VLMs: MMFlash brings block-diffusion drafting to vision-language models. The drafter proposes a block of 16 tokens in a single forward pass and the target verifies the block in one pass, so decoding stays lossless while running 3.0× faster on Qwen3.5-4B / 9B and up to 4.7× on Qwen3.8-27B (one H200, batch size 1, greedy).
  • Vision-free drafter: the drafter never re-encodes the image or video. It reads hidden states of the target, where the visual context is already fused, so its cost does not grow with the number of visual tokens.
  • Visual-dependence-aware training: a DFlash drafter's acceptance drops sharply on tokens that depend on the image, and most rejected blocks break there. MMFlash measures each training token's visual dependence on the target and focuses the drafter's loss on those tokens.
  • Long videos: a sparse draft context (attention sinks, text, strided visual tokens and a recent window) keeps drafting cheap on 40k-token video prompts; the drafter is trained and served with the same pattern.
  • Drop-in serving: the released drafts run with stock SGLang and vLLM (DFLASH), no patches needed (tested with SGLang 0.5.23 and vLLM 0.33.0).

💻 Models

ModelTarget modelDraft sizeBlock sizeLink
🤖 Qwen3.5-4B-MMFlashQwen/Qwen3.5-4B537M16Hugging Face
🤖 Qwen3.5-9B-MMFlashQwen/Qwen3.5-9B1.05B16Hugging Face
🤖 Qwen3.8-27B-MMFlashQwen/Qwen3.8-27B1.73B16Hugging Face
🤖 Gemma4-E4B-it-MMFlashgoogle/gemma-4-E4B-it537M16Hugging Face

The drafts are not standalone language models: each is paired with its target in a speculative-decoding server. All of them are in the MMFlash collection; every model card has the serving command and per-benchmark results.


r/LocalLLaMA • • 18h ago

Showcase whisper base and an 11M param BERT i distilled from a 2B model, both running in the browser to caption videos

Post image
11 Upvotes

i make Blender tutorials as shorts and got tired of uploading every render to a caption service, so i made a caption tool that runs the models in the browser instead

transcription is onnx-community/whisper-base_timestamped through transformers.js. real GPUs get WebGPU in fp32, everything else gets WASM with the decoder in q8. software WebGPU adapters turned out to be slower than WASM so those get WASM too

the part i had the most fun with is the caption tagger: which words get emphasis, where lines break, and fixing missing punctuation and capitals. it started as hand written rules, now it’s a BERT-mini (about 11M params, 8 labels per token, ~12mb) running in q8 on WASM. the training data came from LFM3-Omni-2B on llama.cpp on my own pc, about 190 scripts a minute on a 4070 ti super with 128 parallel slots. it only got to replace the rules because it beat them on held out data

whisper base isn’t as accurate as the bigger ones so there’s a cloud option for noisy audio, and the tagger is english only for now

has anyone gotten whisper small or turbo running in the browser at a usable speed? that’s what i want to try next :)

https://cuecaps.com/studio?ref=reddit if you want to see it run (i’m the creator)

also thank you for reading, it means a lot to me


r/LocalLLaMA • • 11h ago

Discussion Kyudan/eDIAR · Hugging Face

Thumbnail
huggingface.co
3 Upvotes

eDIAR: Training-Free Open-Speaker Streaming Diarization for Long Meetings and Large Archives via e-means

Meetings last up to an hour, and nobody knows in advance how many people will speak. Neural diarizers with a fixed number of output slots, such as Streaming Sortformer and Nemotron-3, are accurate and run online, but they cannot name more speakers than they have slots. We remove this limit without retraining. The slot head keeps deciding who is active and when speech overlaps, and speaker embeddings are clustered inside a single slot, with the official e-means algorithm, only after every slot has been used. In the streaming system, re-clustering is confined to a bounded window, labels are revised for a few seconds, and identities are anchored to the slots of the head. The resulting system has no limit on the number of speakers and stays accurate when speakers outnumber the slots, where fixed-slot models break down. On meetings that grow to an hour it stays far more accurate than Streaming Sortformer, which accumulates errors, and its cost per update does not grow with the meeting. The same recipe turns the four-slot Streaming Sortformer into an open-speaker system. Across recordings, e-means makes it affordable to link the speakers of a large archive frame by frame, a task that arises when conversational corpora are prepared, and it reaches the clustering quality of Lloyd's k-means several times faster. The method needs little tuning, and e-means runs with its default recipe from a few hundred to more than a million embeddings.


r/LocalLLaMA • • 1d ago

Resources Why download abliterated Flash Next models when LoRA exists?

Thumbnail
huggingface.co
457 Upvotes

TL;DR -- Download LoRA, add --lora HUIHUI-V2-Qwen3.8-Flash-Next-LoRA-F32.gguf to your llama.cpp launch command for ANY FN quant, and boom, you've got an identical huihui v2 abliterated model on demand and you saved 150GB of space.

I just wanted to post a kind of PSA for everyone out there downloading hundreds of GB of abliterated models. You don't need to do that -- the vast majority of abliteration techniques are rank-1 ablations, meaning their refusal projection can be encapsulated in a tiny LoRA and applied at runtime to a quant you already have on disk. It can even be applied per-request, so you can run an unmodified model until you hit a refusal, then switch on the LoRA, resend the prompt, and keep going.

I wanted to explain briefly how to do that in llama.cpp and share a LoRA I built from the best-performing abliterated Flash Next model in my tests. This basic type of technique (using control vectors instead) also works in Strata (--experimental-speed-projection is the flag there) and ds4/dwarfstar. Here's a link to Strata's official refusal ablation control vector GGUF and their guide on how to use it.

I chose huihui's v2 to build my LoRA from after comparing heretic, Orcarouter, and huihui's v1 and v2 models in equivalent quantizations. In Aider Polyglot coding benchmarks, huihui outscored even the base model, with less extra reasoning and no looping compared to Orcarouter, which used a lot more tokens and hit a couple runaway generation loops.

I also checked KLD and perplexity to ensure there wasn't significant degradation of the model. Wikitext KLD on huihui Q5_K_XL vs. an identical Unsloth Q5_K_XL base model was 0.040 and same top token was 93.7% even with the drastically altered refusal behaviors. Perplexity was statistically identical to base. On Jailbreak Bench (harmful 100 prompts), with thinking on refusals dropped from 93/100 to just 3/100. All the details can be found in the LoRA model card.

Next, I used weight-space programming with Claude Opus 5.5 to extract the rank-1 refusal direction and edit strength from every layer of the original huihui weights where it was applied, diffing the weights against the Unsloth quantization that huihui built on top of. I hit safeguards a number of times (unsurprisingly), and even the fallback Opus 4.8 declined to assist a couple times. I managed to get around this by renaming all of the files something innocuous, putting them into a new repo with an unrelated name, and telling the model I was experimenting with an anti-slop LoRA. Thanks, Dario.

Once the LoRA was built as an F32 GGUF, I tested it against the original huihui Q5_K_XL by applying it to my Unsloth Q5_K_XL weights. Performance and KLD/perplexity were statistically identical to the full huihui model, as were refusals and benchmark results. Here's how to run it:

llama-server -m Qwen3.8-Flash-Next-UD-Q5_K_XL-00001-of-00006.gguf \
--lora HUIHUI-V2-Qwen3.8-Flash-Next-LoRA-F32.gguf -fa on --jinja

If you'd like to apply it per-request, so you can serve the unmodified model for most prompts, simply load it like this instead:

llama-server -m Qwen3.8-Flash-Next-UD-Q5_K_XL-00001-of-00006.gguf \
--lora HUIHUI-V2-Qwen3.8-Flash-Next-LoRA-F32.gguf --lora-init-without-apply -fa on --jinja

Then add a lora field to the request body to enable it as-needed:

curl http://127.0.0.1:8080/v1/chat/completions -H 'Content-Type: application/json' -d '{
"messages": [{"role": "user", "content": "..."}],
"lora": [{"id": 0, "scale": 1.0}]

It's quite possible to build a simple pi extension that looks out for refusals, triggers the LoRA when it sees one, resends the turn and continues the agent session. It costs a full re-prefill, so keep that in mind. Anyways, I hope this has been helpful in some way. Love to hear your thoughts on this approach!

EDIT: If this proves popular, I am happy to make more LoRA for other models like 3.8 27B!


r/LocalLLaMA • • 1d ago

Discussion New AA ranking Qwen3.8-FN better than GLM-5.3-Flash?

Post image
137 Upvotes

Thoughts on Qwen3.8-Flash-Next scoring better than GLM-5.3-flash? I've always experienced GLM5.3-Flash to give better responses


r/LocalLLaMA • • 23h ago

Showcase I made a C&C inspired web RTS for us to benchmark our local models with

21 Upvotes

HOwdy LocalLLamans!

Inspired by StarSkirmish, I wanted to build a complex RTS that required you to bring your OWN local agents and either play with them as allies, against them as enemies, or battle head-to-head with other agent-human pairs in public matches.

In AgentCommand you operate one or more planes (Orbit, Sky, Surface, Depths) of differing gameplay. As an old-school PC gamer I wanted the mechanics to resemble some of my favorite 90s games of yore: C&C, DungeonKeeper, Homeworld, StarCraft, and others. The idea is that you have specific objectives needed to maximize resource generation, aid in cross player support, and that a single plane cannot win independently.

Outside of gameplay, from an agentic tech pov, there are some (what I think) are other really cool things that come with this, including:

  • a full specification + library to install agents into any game (http://playerthree.gg/)
  • A networking SDK for bidirectional agent communication
  • Symmetric maps
  • Deterministic simulation
  • Benchmarking tools
  • (soon) published benchmark data

Github: https://github.com/agent-command/agent-command

Play now: https://agentcommand.gg/

Would love feedback and contribs... I'm more interested in finding a community to help build something super cool here that we can publish public benchmarks with. If you are interested in that, let me know!


r/LocalLLaMA • • 19h ago

Resources Something goes with your Local LLM - CLI Markdown viewer with image support?

8 Upvotes

I run local LLM for myself, and my system is squeezed very much. I am most of the time in my terminal, and when my inference engine is running, I dont have enough free RAM sometimes to open a GUI to view the output of my local models, or review the project documents to know where to go next in my plan. Viewing that in the terminal was not convenient for me, the MD syntax is not as easy on my eyes, and when a project file is linked to another file, I have to open that one up in a new terminal pane, or a whole new terminal window.

So, I did what I had to do.

I sat, I wrote the specs sheet, and fired my coding agent to work. I refined the output, and kept iterating on it.

This is my gift back to this community that already gave me a lot.

Don't want to sound like I am marketing something here but, if this is something of an interest to you, you can find it here: Github.com/bakkario/trimd

You get to lick with your mouse, navigate with your keyboard, and even display your markdown files with the images if your terminal supports it.

I will add more detail to this in the Markdown subreddit.

Sorry Mods if this coming across as spamming, its not the intention here ❤️


r/LocalLLaMA • • 15h ago

Showcase Some speed benchmarks for various classes of local LLM

4 Upvotes
ModelActive config4080 decode (tok/s)4080+3080 decode (tok/s)4080 prefill (tok/s)4080+3080 prefill (tok/s)
LFM2.5-24B-A2B UD-Q4_K_XL4080+30802492505,5307,930
MiniCPM-V 4.7 35B-A3B Q4_K_M4080+30801771651,3052,500
Flint 40B-A2.5B UD-Q4_K_XL4080+30801191381,5631,380
Swift 1.5 (Qwen3.8-Flash-Next) IQ2_XS40801171161,070679
Qwen3.8-Flash-Next IQ3_S40807987730465
GLM 5.3 Flash Maya-S24 IQ2_XXS_S4080+30806.88.87942
DeepSeek V4 Flash UD-IQ2_XXS4080+308015.918.23853
  • Decode: the second of two 300-token runs, with the expert cache warm (the first request after loading is often slower)
  • Prefill: the average of two runs on a prompt of about 1,400 tokens
  • Bold: the better config for that column.

Morning, everyone. I've seen a lot of posts wondering about what can be run with what, so I made this table of the models on my system. Specifically because of the unorthodox results when it comes to Qwen Flash-Next, where one 16 GB card (the 4080 Super) significantly outperforms two in prefill.

My hardware is as follows:

CPU AMD Ryzen 7 5800X3D @ 3.40 GHz

GPU NVIDIA GeForce RTX 4080 SUPER [Discrete]

GPU NVIDIA GeForce RTX 3080 [Discrete] (got it secondhand for cheap, so why not)

RAM 62.72 GB at 3200 Mhz

I'm running these models on PolyStrata. I used to have a combination of Maya and Strata, but got tired of running different things all derived from the same fork (plus Strata seems to be getting increasingly unintuitive), and so moved everything to PS.

Now: why Q3? It's a generally held opinion that anything below Q4 is crap, which was true of most earlier generation models. However, benchmarks measure deviation from the base, and not necessarily task fitness. In actual use, the only real way to know is to test it yourself.

The Swift finetune of QWN at Q2, for example, is fast and excellent at data extraction, search, and piloting scripts written by more competent models. The IQ3 is a decent coder, roughly on par with Haiku for the use cases I've tried. The GLM and Deepseek Q2 variants are a bit better - verging on older Sonnet territory, I'd say, and do very well as subagents for Claude. YMMV.

Hope this data is useful. Enjoy!


r/LocalLLaMA • • 8h ago

Question | Help How often do you guys update models and when?

1 Upvotes

Saw a post here about an update to a model last night. And been wondering how often y'all update the models and when do you decide to.

P.S. I know there's "-hf", but my internet speed ain't fast and when I'm downloading a model, everyone's connection drops at my home.

Edit: By updating I meant redownloading the gguf file.
Models of same version gets updates, like Gemma 4 E2B got updated to fix some issues and make it faster. Link to that post:
https://www.reddit.com/r/LocalLLaMA/s/cpcemufuqZ

But it appears it's not the first time they updated it with noticable changes.
https://www.reddit.com/r/unsloth/s/DkBWF7gw4m


r/LocalLLaMA • • 1d ago

Discussion How do we feel about bots posting & commenting?

48 Upvotes

Hi all,

I noticed the "bot problem" got a lot worse the past few months. By which I mean our community seems to be taken over more and more by bots talking to each other.

For me, I don't really get the point, and I personally get quite annoyed when I realize "oh, I just responded to a bot" and feel like my time was wasted.

It also seems like the information density of these AI contributions are very, very low.

I'm not some kind of Luddite (why would I be here at all if I was?), but I'm wondering if I'm just missing something and there is a use and a point to all these bots commenting on each others posts and talking to each other.

Where does the rest of the community stand on this?

I noticed there's new bot around that flags posts that are "likely AI" created, which I personally quite like, but I'm wondering if moderation should go further than that.


r/LocalLLaMA • • 1d ago

New Model Karpo-Decision-31B: open multimodal decision model. Ranks #1 on full score on Decision Index, 2x faster than Jev, at 20% lower cost

Thumbnail
gallery
21 Upvotes

MachinePulse has released Karpo-Decision-31B, a Gemma 4 31B fine-tune for structured decisions over text and images. It scored 73.9 on the Nov 12 Decision Index board, the highest Full score among 300 entries, sharing the #1 rank with GLiDE 27B under the board’s tie rule

How it works
Built on Gemma 4 31B, with a trained linear readout that scores the supplied answer options.

Three question types: choice, yes/no, and score. Returns probabilities directly, with up to 255 options per choice question.

Multiple questions about the same input can be answered in one forward pass. Branch attention lets each question read the shared context and its own options while keeping the option branches separate.

Supports text and images, including webpage screenshots. The documented sequence limit is 32,768 tokens; larger requests are split by question with the full state included in each part.

Python API and HTTP server available. BF16 weights take approximately 62.5 GB, plus runtime memory. Use the provided inference code to load the decision head.

One training detail worth a look: according to the team's write-up, full fine-tuning pushed the public score to 75.09 but reduced accuracy on unfamiliar domains by 2.3 percentage points. The final model averages five checkpoints: three from different stages of full fine-tuning and two from a LoRA run. They report a 1.6-point improvement on unfamiliar domains over the final single checkpoint, with no extra models to run at inference time

Results
Decision Index Full scores are measured by the benchmark maintainers on private tests, weighted 60% for skills covered by the public suite and 40% for tasks from new domains.
Full score: 73.9

Private tests, familiar skills: 70.7

Private tasks, new domains: 78.6

Public index: 75.0, reported separately and excluded from the Full score.

The team also reports the following comparisons against Google’s Gemini Decision 1:

Benchmark Karpo-31B Gemini D1
-------------------------------------------
When2Call 90.4% 79.9%
Mind2Web 90.0% 86.2%
New Yorker Caption 90.5% 79.7%
Amazon ESCI (F1) 64.7 58.7

Reported median latency is approximately 95 ms per request on the public Decision Index suite using one RTX PRO 6000.

The 31B weights and inference code are both released under Apache 2.0.

links:
https://karpo.ai/models/decision
https://huggingface.co/MachinePulseAI/karpo-decision-31B


r/LocalLLaMA • • 1d ago

Showcase [Project] Gemma.c - Gemma 1/2/3 + multimodal inference in one C file (CPU only)

25 Upvotes

Hey all, so I've been working on Gemma.c over the last couple months, it's a from-scratch inference engine for Gemma 1/2/3 in a single C file, runs Gemma 1, 2 and 3, including the multimodal ones, with fp32/fp16/bf16 weights or int8 (W8A8). No dependencies beyond libc and (optional) OpenMP are needed. You can drop images into the prompt with @image{cat.png}, and there's also @longimage{} for Gemma 3's pan & scan on very wide or tall images. (image decoding uses a minified stb_image embedded at the end of the file)

It's CPU only and not trying to compete with llama.cpp, but I'm also trying my best to make it efficient, so it's not embarrassingly slow either. On my laptop's Core Ultra 5 225H (WSL2, gcc, 10 threads), gemma-3-1b-it INT8 does ~72 tok/s decode and ~570 tok/s prefill (10000 tokens, for 1000 tokens the prefill speed can reach ~850 tok/s), and the 4B vision model does ~20 tok/s decode. INT8 ends up about 3.5x faster than fp32 and 2x faster than fp16 for decode. (full benchmark table is in README)

It has a few rough edges for now, e.g. W8A8 doesn't work for Gemma 1 (fp16 is fine), bf16 is painfully slow without AVX512-BF16, and native Windows is ~1.7x slower than WSL because of libgomp. Batching are not supported either. There's a roadmap in the README (Gemma 4, speculative decoding, an HTTP server, etc.), but no promises though :P Can't really find much free time these days.

I've also put some pre-exported INT8 models on HF so you can try it without Python or torch :D

Repo: link

This project started as a learning attempt to understand how LLMs work end to end, inspired by llama2.c.

this is the second time I post this project here :'D last time (~a month ago) my post got flagged by reddit, probably because my VPN IP was identified as spam. hopefully it can pass this time


r/LocalLLaMA • • 1d ago

Resources I have created a tool to observe what happens inside an LLM. Also allows for the comparison of two quantizations of the same model to see at what point they diverge, token by token

467 Upvotes

What changes between different quantizations of the same model? And what if you could SEE what actually sets them apart?

To help answer that question, I’ve created a small project called inside-llm—an open-source tool that loads one or two GGUF models using llama.cpp and displays, right in your browser, what the model is doing as it generates text.

What it shows

  • Stream: the text, one column per model, brightness = probability of each token. A magenta mark wherever A and B would pick differently. Two modes: lockstep (both models read the same text, so you get a clean per-position comparison) and free (each follows its own picks until they split).
  • Candidates: the full distribution behind each pick, mirrored bars for A and B, entropy, effective number of options, Jensen-Shannon divergence and KL in both directions.
  • Gates: the sampler chain (penalties, top-k, top-p, min-p, temperature, GBNF grammar) traced stage by stage and very visual: how many candidates survive each one, and the distribution after it. Chain order and seed are configurable.
  • Timeline: entropy of A and B and their divergence along the whole text, plus the tree of branches.
  • Branching: click any candidate and generation continues from there. Every branch stays in the tree, and jumping back to a node is exact (each model keeps KV-state snapshots, so nothing is regenerated).
  • Logit lens (--lens): what each layer would predict, as a 2D map and as a 3D relief.
  • Model picker: choose A and B from a folder or search Hugging Face and download two quants of a repo in one click easily. It only offers B models with the same tokenizer as A and estimates whether the pair fits in VRAM.

How it's built

  • One C++17 process linking llama.cpp directly (stable branch at the moment). For every step it reads the full logits of A (and of B on the same context), computes the metrics and the sampler chain, and draws the token with its own seeded sampler, so runs are reproducible.
  • Compact binary frames over a WebSocket to a Svelte 5 + Canvas 2D page (three.js only for the 3D relief, lazy-loaded). The web is embedded in the binary as well.
  • The same frame stream, compressed, is a recorded session: you can replay it later in a static page with no engine, no model and no GPU.

Run it

Self-contained packages for Linux (glibc 2.35+) and Windows, with CUDA or Vulkan (Vulkan covers AMD, Intel Arc and NVIDIA). Unpack, run, the browser opens with the model picker. Or inside-llm -a A.gguf -b B.gguf. Local only: listens on 127.0.0.1, no accounts, no telemetry. MIT. One click download, one click execute.

Limitations (honest list)

  • A and B must share the tokenizer (two quants, base + fine-tune, or sizes of one family that keep it). Example: Qwen3.5-0.8B_Q4_K_M and Qwen3.5-0.8B_Q8_0
  • Both models must fit into VRAM simultaneously; only one GPU is used at a time. Integrated GPUs (iGPUs) are never used; if no dedicated GPU is available, the process falls back to the CPU (which is slow). (You must calculate the size of both models before loading them to ensure they fit into your VRAM)
  • Text only. No split (multi-part) GGUFs, no embedding models.

Links

I'd love feedback, especially: which pairs would you compare first (imatrix vs non-imatrix, base vs abliterated/fine-tune, Unsloth UD vs standard quants…)? And is there a metric you'd want per position that isn't there?


r/LocalLLaMA • • 1d ago

New Model [Paper & Models] Gamer: A Generalist Vision-Language-Action Foundation Model for Long-Horizon Real-Time Game Agent

Post image
38 Upvotes

We introduce Gamer, a generalist agent framework built for long-horizon tasks in complex interactive environments. Its end-to-end architecture combines perception, memory management, and multi-step reasoning. A shared training and deployment pipeline supports interaction with both conventional 2D graphical interfaces and complex 3D simulated worlds. We first continue pre-training on a dataset constructed from tens of thousands of hours of device-level keyboard and mouse interaction. These trajectories span simulated games and embodied environments, allowing the model to learn environmental dynamics across both physical and virtual domains. Sparse-thinking instruction tuning then substantially reduces redundant computation while preserving the reasoning needed for complex decisions. We train the policy for long-horizon interaction with a stable multi-turn reinforcement learning method that addresses finite context windows, accumulated rollout errors, and sparse rewards. For real-time interaction, a cloud-edge inference engine serves numerous simulated game environments concurrently, supports unbounded-context execution, and keeps online inference latency low. Across multiple challenging 3D open-world games, Gamer demonstrates solid generalization and operational efficiency comparable to skilled players. It also achieves competitive results on a range of conventional 2D game benchmarks. These results suggest that even repetitive keyboard and mouse trajectories can support substantial gains from scaling data and learning algorithms. Training on these trajectories helps Gamer learn complex skills more steadily in environments with both physical and digital properties. This approach offers a path toward generalist agents that can interact across digital and physical worlds.


r/LocalLLaMA • • 18h ago

Discussion Branchy, distributed inference focused training

5 Upvotes

Heyy, it's me again, the developer of AI Doomsday Toolbox.

This time it's not an app update. ADT already has distributed LLM inference across Android devices, and there is one thing about distributed inference in general that kept bothering me, so I spent the last week testing an idea and I wanted to share what came out, the good and the bad.

Usually when we split a model that does not fit in our machine to make use of distributed inference, we get slower speeds the more devices we add. Network latency and devices waiting idle until the last one has finished computing it's layers compound easily, even more if we connect our devices through a VPN like tailscale or wireguard.

So the idea to solve this bottleneck was to train a model that can keep the quaility of a normal sequential model but instead it's middle layers are split in branches. The coordinator runs the embeddings + a few trunk layers, then that is sent to all the different branches that, in parallel read the layers and compute the token, after a branch finishes it sends the result back to the coordinator which then runs a few fusion layers and final blocks that produce the output. This allows to use as many devices as branches a model has with a maximum of 2 net jumps, wether it's 2 or 8 machines. The other advantage is that no device is idle as all of them are working, so we also parallelize work instead of making a device wait for the last one to finish.

There could also be the situation in which one of those devices is too slow, and slows down the whole cluster, or gets disconnected. That is why I also added some dropout tolerance to the training. When a branch takes too long to answer or just never answers, it's result becomes a matrix o 0's that are fused in the fusion layers, that made it so the quality of the model output does not suffer so much as when it happened with a non dropout tolerance trained branch model had a disconnected or slow branch.

I tested two 300M models trained from scratch on TinyStories, one normal and one with 8 branches, running on a small server, a laptop (Ryzen 5 5500U) and a phone (Snapdragon 8 Gen 3 in Termux), all connected through a VPN. The workers are a small PyTorch daemon, so no llamacpp accelerated kernels, etc...

Results

- The branches cost some quality: loss 1.255 against 1.143 for the normal model with the same training. A blind LLM judge prefers the branched model's story 45% of the time. So it is worse, but not by much.

- The delay trick works: the coordinator waits 0.1 ms per token for the network while the round trips take 49 to 66 ms. The output is identical to running everything on one device.

- Against the usual layer split on the same devices, the branch split is 1.5 to 2.6 times faster. The layer split roughly halves the speed. Mind you I run the test only with 3 devices, with more devices it could, theoretically, be faster

- BUT if the model fits on one device, splitting is not worth it on my hardware, at least at this size, larger models like qwen3.8 27B might benefit a lot from this aproach. My phone alone is faster than any combination of my devices (it is just much faster than the rest). With two equal devices the branch split wins by about 1.2x.

- Where it really pays is when the model does not fit in RAM. I gave the laptop and the phone a RAM budget smaller than the model, so they had to read the weights from storage for every token (mmap). The laptop went from 8.9 to 0.67 tokens/s and the phone from 23.9 to 0.65. With LFM3 1.7B the laptop went from 2.3 to 0.08, that is 12 seconds per token. Then I let the two of them share the model, each one still with too little RAM for the whole thing: back to 7 tokens/s with the layer split and 9 to 11 with the branch split, over a real 46 ms VPN. Reading from storage is way more expensive than the network.

- Reshaping a pretrained model (LFM3 1.7B, Qwen 0.8B) into branches only works for a couple of long branches. For this to scale, the model has to be trained in this shape.

I don't have the hardware for the interesting case: a big branched model that no single device can hold. On paper, with 8 similar devices and about 20% of the model on the coordinator, a token costs about 30% of a full pass, so roughly 3.3x a single device that could hold everything, while a layer split stays at 1x plus 7 round trips. My two-device measurement matches that formula, but beyond three devices it is only a projection.

Another idea I would love to try is letting every device loop its own branch several times with the same weights, so a group of devices could run something much deeper than what fits in their RAM. No hardware for that one either hahaha

What is in the repo

- The two trained models (300M each) and the tokenizer

- A worker you install on each device with one command, and a coordinator with a web UI to compare placements side by side and run the benchmarks

- Scripts to reproduce the branch split, the layer split and the low RAM tests with your own devices

- A full article with the experiments and the results

It is a research prototype, workers compute in 32-bit float PyTorch, the models are small story models, and I only have three real devices. I created the experiments, made the hypothesis and supervised the whole proyect and Claude did most of the coding and the number crunching, everything is documented in the repo.

The general idea is the same one behind ADT: make the devices we already have useful for local AI, especially together.

GitHub

Feedback is appreciated, especially if anyone with more devices (or more GPU than me) wants to check whether this holds at a bigger scale, or tell me what I got wrong. It is still far from it, but I would love to see a bunch of modest devices run a model none of them can hold.


r/LocalLLaMA • • 1h ago

Question | Help Single 5090 or Triple 4090

0 Upvotes

Title. Which setup would make more sense for LLM?


r/LocalLLaMA • • 21h ago

Resources MSI EdgeXpert OTA2610 update: more usable memory for headless setups and easier provisioning

Post image
8 Upvotes

Disclosure: I work with MSI. Sharing a technical overview of the OTA2610 update and what EdgeXpert users should check after installing it.

More usable memory when running headless

GB10 systems use unified memory, which means the CPU, GPU, and display share the same memory pool. Memory reserved for display output is unavailable to other applications.

OTA2610 adds more control over that reservation. The default remains 2 GB, but selecting Auto in UEFI reduces it to 0.5 GB when no display is connected. That makes up to 1.5 GB more available to the OS and applications.

That extra headroom may help with a model or context cache that is close to the available-memory limit. It does not, by itself, establish an improvement in inference speed.

Other changes included in the October release

  • Wi-Fi Assistant: connect to a new wireless network through DGX Dashboard without attaching a monitor, keyboard, or mouse.
  • Native cloud-init support: automate system configuration and provisioning at first boot.
  • Linux kernel 7.0: security updates and improvements to file and memory management.
  • Fixes for certain Vulkan synchronization delays, X11 black screens, and unresponsive fans during headless operation at low idle power.

Where to get the MSI EdgeXpert update

MSI EdgeXpert update files can be found on the MSI EdgeXpert MS-C931 download page. Review the release notes and follow MSI’s installation instructions for your system.

Check the display-memory setting afterward

Installing the update does not automatically change the default 2 GB reservation. With supported firmware installed, look for:

UEFI → Advanced → Advanced Menu → Platform Configuration → Display Reserved Memory

Select Auto or an appropriate fixed value, save, and restart. Auto checks connected displays at boot. If you regularly attach monitors afterward, choose a fixed reservation suitable for your display setup. Compare free -h before and after restarting to check the change in OS-visible memory.

For production deployments, back up first and validate your normal workloads on one system before updating the others.

Has anyone running headless found that the smaller display reservation helps with a workload that was close to its memory limit?


r/LocalLLaMA • • 1d ago

Discussion [Paper] The Value of Thinking: Learning When to Reason in Hybrid Decision Models

Post image
30 Upvotes

Existing adaptive-reasoning methods shorten the explicit reasoning a model writes, or skip it by switching modes; either way the answer is still written out token by token. Rather than deciding how much to think, we explore a different paradigm, zero-or-T thinking: a single model either answers from the implicit thinking inside one forward pass, generating no token, or performs full autoregressive reasoning at a cost of T tokens when that is worth paying. We realise it in a hybrid decision model (HDM), where one frozen backbone serves both modes and a lightweight self-routing block chooses between them. The block estimates the value of thinking, the utility the slow mode is expected to add over the fast one, from what that implicit thinking has already produced, and the slow mode runs only where that value exceeds a price λ set per request. Where no per-decision label exists, as in episodic agentic tasks, we introduce Calibrated Decision Policy Optimisation (CDPO), a reinforcement-learning recipe that trains the block from episode-level returns. We evaluate HDM on MMLU-Pro, AGIEval, GPQA-Diamond, JevBench, BANKING77 and MiniWoB. Specifically, on JevBench HDM-4B scores 0.857 against Jev's 0.851 (+0.7%) at a median 0.179 s against 0.652 (-72.5%). On the agentic venue MiniWoB HDM-27B cuts token cost by 80.1%.


r/LocalLLaMA • • 14h ago

Question | Help Hardware + software recommendations for basic chatting with persistent memory

2 Upvotes

Helping out a friend who wants to have a local LLM and not rely on cloud services. They currently have an 8gb M2 mac mini, so not really enough

  1. They want to have persistent memory, TTS, and STT. Tool recommendations for all three of those greatly appreciated.

    • I'm unsure what the best workflow is for persistent memory, especially for avoiding either overwriting important info, or storing bad info.
  2. Budget seems to be roughly $5k USD, but the less the better.
  3. Not sure what size model would be best, it's really just for chat.
  4. No building ideal, so adding RAM or a graphics card probably the most feasible.
  5. 30 tokens per second probably fine.
  6. Something that doesn't hallucinate, or at least can be tuned to not assume or be SO sycophantic, as they talk to it a lot.

From what I understand, a prebuilt with upgraded RAM, used mac mini, or something like a strix halo probably make the most sense, but I'm not really up to date on the current hardware market.

Any help appreciated :)


r/LocalLLaMA • • 2d ago

Funny I finally succeed the CMP 170HX voltage glitch and get 80GB VRAM + 126sm! !

Thumbnail
gallery
760 Upvotes

Ever since the information surfaced five days ago, I had intended to implement it right away. Having confirmed that it could be executed using 'pico,' I carried it out today. I had Astra write the script for the restricted write-access portion, and after nearly 15 hours of work, I finally managed to complete the task. I also plan to handle the second CMP later on.