Founder @ startup · AI agents · fine-tuning & post-trained models · agentic video/aigc

Joined October 2007
Include

Only show posts containing:

Exclude

Hide posts containing:

Time range
-
Minimum likes
GroundAnything Why locate objects one token at a time? This 4B diffusion model generates grounding predictions in parallel, delivering a 4.51× speedup while setting a new SOTA across 30 benchmarks.
8
30
1
334
17,287
Frank Lin retweeted
Qwen3.8-27B reportedly shrinks from 55.6GB to just 5.9GB with Bonsai 2, while retaining 98.2% of its aggregate benchmark performance across 20 benchmarks. That’s a model footprint more than 9× smaller, according to PrismML, the team behind Bonsai. Here’s the comparison: Original Qwen3.8-27B: 55.6GB Bonsai 2 27B: 5.9GB Reported performance retention: 98.2% Previous Bonsai generation: ~95% The technology behind this is ternary quantization. Instead of representing model weights with conventional higher-precision numerical formats, ternary quantization restricts them to a tiny set of values, typically −1, 0, and +1, with implementation-specific scaling techniques. This dramatically reduces the storage required for billions of parameters. The challenge is preserving what those parameters enable: reasoning, coding, instruction following, and reliable tool use. According to PrismML, Bonsai 2 improves on its predecessor in areas including coding agents, multimodal reasoning, and long-horizon tool use. These tasks are particularly demanding because an agent must plan, execute tools, interpret results, recover from errors, and maintain context across multiple steps. Why does the size reduction matter? A 27B model with a 5.9GB weight footprint could become accessible to more consumer GPUs, laptops, and edge devices. Smaller weights can also leave more memory available for context and other runtime operations, or allow servers to accommodate more concurrent workloads. But two caveats matter. First, 98.2% performance retention does not mean 98.2% accuracy on every task. It’s an aggregate across selected benchmarks, and individual capabilities may degrade differently. Second, a 5.9GB model file doesn’t guarantee that a device with 6GB of RAM can run it comfortably. The inference runtime, KV cache, and other overhead require additional memory. Independent testing will be important to establish whether the reported results hold across different hardware and real-world workloads. Still, the reported progression is notable. Bonsai’s previous generation retained around 95% of the original model’s aggregate benchmark performance. Bonsai 2 reportedly raises that figure to 98.2% while reducing the footprint to 5.9GB. 55.6GB → 5.9GB. More than 9× smaller, with 98.2% reported performance retention. If independent evaluations confirm those results, ternary quantization could make capable 27B models much more practical to run locally.
Qwen3.8-27B reportedly went from 82 to 381 tokens/sec on a single RTX 3090 with 24GB VRAM. That’s a 4.6× increase without upgrading the GPU or changing the model. The improvement came from optimizing the inference stack. Here’s how the reported speeds progressed: Baseline: 82 tokens/sec Optimized MTP: 114 tokens/sec DFlash2 + context lookup: 138 tokens/sec Optimized lookup verification: 381 tokens/sec Three techniques explain much of what’s happening. 1. Speculative decoding reduces sequential generation work. Language models normally generate one token at a time, with each new token depending on the previous output. Speculative decoding uses a faster drafting mechanism to propose multiple tokens, then has the main model verify them. When several proposals are accepted, the system can produce more tokens per verification cycle. MTP and DFlash2 use different approaches to accelerate this process. In this experiment, optimized MTP raised throughput from 82 to 114 tokens/sec. Combining DFlash2 with context lookup pushed it to 138 tokens/sec. 2. Context lookup reuses text already available. If a model needs to reproduce text that already exists in its context, generating every token from scratch can waste computation. Context lookup finds matching sequences and proposes them for verification. The reported implementation checked blocks of up to 16 tokens, with roughly 15 accepted per block. On a 25,000-token document reproduction task, throughput reportedly increased from around 260 to 382 tokens/sec. This works particularly well when the output closely matches existing text. Open-ended conversations typically offer fewer opportunities for reuse, so the same peak shouldn’t be expected across every workload. 3. Prefix caching makes repeated prompts cheaper. Coding agents often resend the same system instructions, repository information, and code snippets across multiple requests. Prefix caching stores reusable computations from previously processed prompt tokens, allowing the runtime to skip repeated work when the prefix matches. In the reported test, time to first token dropped from 22.4 seconds to just 0.56 seconds. That’s approximately a 40× reduction in initial waiting time. For agents working with large codebases or documents, that can make repeated interactions considerably more responsive. One important distinction: 381 tokens/sec isn’t regular chat speed. The developer reports around 133 tokens/sec for ordinary chat. The 381 tokens/sec peak comes from a workload that benefits heavily from text reuse and optimized verification. Both numbers are useful, but they measure different conditions. The broader lesson is that GPU specifications alone don’t determine local inference performance. Speculative decoding, verification efficiency, context lookup, and caching can all affect how much work a system completes on the same hardware. The RTX 3090 still has 24GB of VRAM. The gains come from using its resources more efficiently. Project: TeksEdge’s Qwen3.8-27B RTX 3090 implementation.
1
4
15
1,472
Mistral recently released a 209M model that can predict future data locally on a CPU in ~140 milliseconds. Not every useful AI model needs to talk (just like Jev) No GPU required. It's a super small foundation model designed for time-series forecasting. Give it historical data like: 📈 sales ⚡ power usage 🏭 sensor readings 📦 demand/inventory 🌡️ telemetry …and it predicts what comes next without training a new model for each dataset. The largest version stats 🧠 209M parameters 💾 837MB FP32 🖥️ runs on CPU or GPU 📚 up to 32,768 historical time steps 🔮 forecasts up to 1,024 steps per forward pass 📊 outputs 21 probability quantiles 🎯 Mistral says it ranks #1 among pretrained/zero-shot models on all three major public forecasting benchmarks 🥇 GIFT-Eval 🥇 TIME 🥇 fev-bench It can get small like Timestral-5M → 21MB Mistral says on an 8-thread CPU: ⚡ 5M model → ~10 ms ⚡ 209M model → ~140 ms for a one-day forecast from three weeks of 15-minute data. 🔗 Links below in ALT.
43
210
25
2,509
97,008
Frank Lin retweeted
Qwen3.8-27B reportedly went from 82 to 381 tokens/sec on a single RTX 3090 with 24GB VRAM. That’s a 4.6× increase without upgrading the GPU or changing the model. The improvement came from optimizing the inference stack. Here’s how the reported speeds progressed: Baseline: 82 tokens/sec Optimized MTP: 114 tokens/sec DFlash2 + context lookup: 138 tokens/sec Optimized lookup verification: 381 tokens/sec Three techniques explain much of what’s happening. 1. Speculative decoding reduces sequential generation work. Language models normally generate one token at a time, with each new token depending on the previous output. Speculative decoding uses a faster drafting mechanism to propose multiple tokens, then has the main model verify them. When several proposals are accepted, the system can produce more tokens per verification cycle. MTP and DFlash2 use different approaches to accelerate this process. In this experiment, optimized MTP raised throughput from 82 to 114 tokens/sec. Combining DFlash2 with context lookup pushed it to 138 tokens/sec. 2. Context lookup reuses text already available. If a model needs to reproduce text that already exists in its context, generating every token from scratch can waste computation. Context lookup finds matching sequences and proposes them for verification. The reported implementation checked blocks of up to 16 tokens, with roughly 15 accepted per block. On a 25,000-token document reproduction task, throughput reportedly increased from around 260 to 382 tokens/sec. This works particularly well when the output closely matches existing text. Open-ended conversations typically offer fewer opportunities for reuse, so the same peak shouldn’t be expected across every workload. 3. Prefix caching makes repeated prompts cheaper. Coding agents often resend the same system instructions, repository information, and code snippets across multiple requests. Prefix caching stores reusable computations from previously processed prompt tokens, allowing the runtime to skip repeated work when the prefix matches. In the reported test, time to first token dropped from 22.4 seconds to just 0.56 seconds. That’s approximately a 40× reduction in initial waiting time. For agents working with large codebases or documents, that can make repeated interactions considerably more responsive. One important distinction: 381 tokens/sec isn’t regular chat speed. The developer reports around 133 tokens/sec for ordinary chat. The 381 tokens/sec peak comes from a workload that benefits heavily from text reuse and optimized verification. Both numbers are useful, but they measure different conditions. The broader lesson is that GPU specifications alone don’t determine local inference performance. Speculative decoding, verification efficiency, context lookup, and caching can all affect how much work a system completes on the same hardware. The RTX 3090 still has 24GB of VRAM. The gains come from using its resources more efficiently. Project: TeksEdge’s Qwen3.8-27B RTX 3090 implementation.
8
21
3
283
24,198
This week, we launched Indra, a 1M parameter OCR model that's 15x faster than Tesseract on CPU and much more accurate. I still can't believe how good this model is.
109
242
27
2,942
103,163
We made open models run over 2x faster than Ollama, without any new hardware Introducing Magnitude, an open source inference engine that runs open models as fast as your hardware allows. It tunes its kernels on your machine to find the fastest way to run each model Works on Apple Silicon, NVIDIA, AMD, or just a CPU On average across 11 popular local models: Mac M4 Pro vs Ollama (MLX) 1.32x faster prefill, 2.19x faster decode DGX Spark vs Ollama (llama.cpp) 1.34x faster prefill, 2.17x faster decode Ollama, LM Studio, and llama.cpp ship one-size-fits-all kernels, because tuning each model for each chip by hand would take forever Magnitude tunes them automatically. When you download a model, it spends up to a minute on your actual chip trying different ways to split up the math (how many GPU threads team up, how big a chunk each one takes, how far ahead to load data) and keeps the fastest combination that doesn't change the model's output Each model also comes paired with the best speculative decoding drafter, for even more speed One click connects Magnitude to the agent you already use (Pi, OpenCode, Hermes, Codex, and more). It's also built specifically for agents: • Each agent uses about half the memory, thanks to a quantized KV cache • Memory grows and shrinks with your sessions, so your computer stays usable • Agents share prefix caches, so several can run at once without slowing down Next, we're working on getting even more out of your hardware: • Expert streaming from RAM or disk, to run models bigger than your GPU allows • Splitting one model across all your GPUs and CPU so nothing sits idle • Attention pruning that skips low-impact math, for much faster prefill Ships as a desktop app on Mac, Windows, and Linux 100% free and open source Download → magnitude.dev/download GitHub → github.com/magnitudedev/magn…
100
186
35
2,055
99,598
Frank Lin retweeted
BFL really decided to hop into the same lane as QI-2.1 and just dropped a super-fast editing monster! FLUX 3 Image Klein.. hello, hello.. - Well, only 5.6B params - Pixel-perfect edits + mixes up to 10 reference images - Bounding box control right in the prompt - Runs locally on consumer GPUs (yes, even 8GB VRAM!) - 4 sec gen on an RTX 5090 huggingface.co/black-forest-…
FLUX 3 Image Klein is here. Open Weights with the quality of a large frontier model. Customizable and fast. 5.6B parameters and runs on a single consumer GPU. Native 4K, bounding boxes, and pixel-perfect editing.
3
2
47
3,164
Frank Lin retweeted
🎬 MiniMax-H3, now powered by Sol Engine in ComfyUI! Generate 5s videos with native audio on a single GPU: ⚡ RTX 5090: 35.5s ⚡ DGX Spark: 64.3s Meet Sol-H3 Studio: a visual workspace for local video generation, powered by our optimized inference engine. Open source 👇 github.com/NVlabs/Sana/tree/…
33
63
7
767
40,429
Frank Lin retweeted
Big news! Krea 3 is promising Nano Banana Pro/GPT Image 2.5 quality, 5x faster. Imagine turning storyboard images into photographic frames you could put in front of a director. The prompt I’d use: “Make every panel photographic. Preserve the composition, subject placement and camera angle.” Then put the two boards side by side. Some ideas become much harder to leave in a folder once you can see what they could look like.
🤝 Paid partnership · 🤖 Made with AI
today we open the beta for Krea 3, a new frontier for image editing. - end-to-end 2k edits in under 8s. - matches Nano Banana Pro or GPT Image 2.5 quality. - bounding box control and precise multi-turn edits. learn and get access 👇
4
9
67
5,677
Frank Lin retweeted
Now we can use Fish Drama 3 in ComfyUI, and yes, it actually runs on just 8GB of VRAM! massive 35B text-to-speech model does insane voice cloning, full dialogue, and even inline emotional cues like [whispers] /[sighs]. > FP8/int8 ConvRot/W6A8/W4A8 smart MoE routing,. it keeps the heavy lifting in system RAM github.com/PedroMarinhoDev/C…
This one model literally kills billion-dollar closed source voice AI companies. Fuiyoh! Fish Audio Drama 3 - absolute BEAST. - Entire multi-character scenes in a single take - Direct emotions on the fly - Fix/infill misspoken words inside existing audio ElevenLabs should be sweating right now. 40GB model?! Still runs on a consumer GPU though. huggingface.co/fishaudio/dra…
15
65
6
909
41,486
Frank Lin retweeted
Today we’re releasing Muse Spark Open, the most capable US open-weight model to date. Built for coding and agentic work, it excels at long-horizon tasks, complex software engineering, and multi-step reasoning. Key Model Specs: → 816B total / 42B active parameters → 1M token context window → Natively multimodal across text, image, video, audio
474
1,223
700
11,523
1,222,510
Mobile Use + Jev for audio = ULTRAFAST⚡️ 10x faster and 20x cheaper than Gemini Live. It's our Audio Action model, Thud. Thud listens and then does. It has a pre-built list of actions it can take on every page and listens for that action. It's 2026. We don't need to transcribe every voice command before spoon-feeding it to the AI. The AI is smart enough to just hear audio and do! It doesn't need text.
52
83
12
929
54,115
Frank Lin retweeted
Introducing the largest open-source multilingual, multimodal RL environments 🌍 📄 OCR: 1M+ document pages in 22 languages 🎙️ ASR: speech in 102 languages 12M+ tasks across two OpenEnv Environments, open on @huggingface 🤗
29
83
9
768
41,742
Frank Lin retweeted
VideoJev System One Model for Video Understanding and Interaction paper: huggingface.co/papers/2610.1…
13
71
5
521
41,180
We just open-sourced an entire 3D team for Blender. Introducing the Scenario plugin. Use it inside Blender, or let Claude Code run it through MCP. 📁/scenario-plugin ┃ ┣ 📁 Concept Artist ┃ ┣ 📁 Concept Art From a Prompt ┃ ┗ 📁 References From Your Viewport ┃ ┣ 📁 3D Artist ┃ ┣ 📁 Meshes From Text or a Photo ┃ ┗ 📁 Retexture or Remesh the Selected Mesh ┃ ┣ 📁 Animator ┃ ┣ 📁 Rig the Selected Character ┃ ┗ 📁 Motion From Text ┃ ┣ 📁 Surfacing Artist ┃ ┣ 📁 PBR Materials Onto Any Slot ┃ ┗ 📁 Maps From a Photo ┃ ┣ 📁 Layout Artist ┃ ┣ 📁 Greybox From a Description ┃ ┗ 📁 360 Worlds and Skies ┃ ┣ 📁 Camera Operator ┃ ┣ 📁 Camera Path From a Sentence ┃ ┗ 📁 Orbits, Dollies, Cranes and Flyovers ┃ ┣ 📁 Render Artist ┃ ┣ 📁 Viewport to Finished Still ┃ ┗ 📁 Playblast to Finished Shot ┃ ┗ 📁 Sound Designer ┣ 📁 Music, Voice and SFX ┗ 📁 Dropped on Your Sequencer Comment "BLENDER" and I'll send you the GitHub repo.
1,152
340
27
3,747
200,133
MiniMax H3 – Character Sheet Workflow Test Testing out a workflow in ComfyUI that uses MiniMax H3 to generate character sheets. This could be really useful for keeping characters consistent across different scenes and videos. Link: youtube.com/watch?v=A53fIhsy…
7
15
1
284
16,362
AIへの指示用に、"モーショングラフィックスの演出名" をまとめました。 ClaudeやCodexで動画を作るとき、「カッコよく動かして」だけでは、狙い通りの動きは出せない。 「スタガー」「オーバーシュート」「マスクトランジション」と名前で頼めば、思い通りの演出を再現できます。 保存推奨です🔖
15
224
28
2,184
144,526
Frank Lin retweeted
I turned @googlegemma EmbeddingGemma 2, an embedding model, into a speech-to-text model, and it turned out to be one of the fastest STT models you can run on device. On a base M3 MacBook Air it transcribes an hour of audio in about 13 seconds: 288× real time. The idea came in March with Gemini Embedding 2. It puts text, images, audio and video into one shared space, so a spoken word lands right next to the written word. If that's true, you should be able to read a transcript straight out of the embedding model. I couldnt tried it then, but last week EmbeddingGemma 2 came out as an open model, so I tried it.
123
270
61
3,444
276,349
RaCo: Ranking and Covariance for Practical Learned Keypoints(3DV 2026) RaCo is a rotationally equivariant keypoint detector that identifies stable and repeatable keypoints in images. Refer the paper for a quantitative evaluation of its rotational equivariance.
14
114
6
1,684
111,981