🤖 AI 资讯

每日 05:00 更新 · 11-03 · 主站 liuch.name ↗
全部标签 →
筛选标签:榜单评测 · 返回个性化推荐 · 清空筛选

释新闻|中期选举前不打、选后难测,最后谈判窗口美伊卡在哪里?

澎湃新闻
2026-11-02T12:10:41.383Z · 政策监管,阿里巴巴,办公效率,政务,招聘HR,网络安全,基础设施,模型发布,产品更新,榜单评测

美股科技股暴跌,恐慌指数却岿然不动!BTIG警告:底部信号未现,抛售还没完

华尔街见闻美股科技股持续重挫、半导体连跌四周、纳指较高点下挫9%,但VIX至今未收破20。BTIG首席技术策略师解释:资金轮动“吃掉”了波动率,消费必需品10月大涨11%创2000年来最佳。但他警告,真正的底部信号——情绪极端悲观、全面恐慌性抛售日、信用市场企稳——一个都未出现,系统性清洗或在中选后到来。
· 榜单评测

The road to opaque software is paved with good (engineering) intentions

Lobsters

Comments

· 大模型,算力芯片,AI应用,具身智能,Meta,xAI,对话助手,Agent智能体,办公效率,扩散模型,强化学习,提示工程,招聘HR,网络安全,榜单评测

Program

Lobsters

Comments

· 大模型,算力芯片,AI应用,Google,Meta,搜索RAG,办公效率,Transformer,强化学习,招聘HR,网络安全,收购并购,版权诉讼,榜单评测,开发者生态
AI 资讯

the lost malloc()

Lobsters

Comments

· 算力芯片,AI应用,代码生成,搜索RAG,扩散模型,提示工程,招聘HR,榜单评测
AI 资讯

My reflex of assuming our servers need ever-growing amounts of RAM

Lobsters

Comments

· 大模型,AI应用,Google,Agent智能体,搜索RAG,强化学习,招聘HR,榜单评测

Polyend releases the Tracker firmware source code

Lobsters

Comments

2026-11-02T15:11:11+00:00 · 算力芯片,开源,融资,扩散模型,强化学习,招聘HR,榜单评测,开发者生态
AI 资讯

My favourite laptop

Lobsters

Comments

· 扩散模型,招聘HR,榜单评测
AI 资讯

Stop Hardcoding Your Timeouts

Lobsters

Comments

2026-04-23T02:00:00+02:00 · 招聘HR,榜单评测
AI 资讯

A Decade of Kill Bugs

Lobsters

Comments

· 大模型,开源,强化学习,招聘HR,榜单评测

Benchmarking: Qwen 27B, 35B, QFN180B; Nemotron Bolt 74B, Flint40B & Clover 35B (Q4) on M5 Max 2026 on Kapitsa with KFlash [P]

Reddit r/MachineLearning
Benchmarking: Qwen 27B, 35B, QFN180B; Nemotron Bolt 74B, Flint40B & Clover 35B (Q4) on M5 Max 2026 on Kapitsa with KFlash [P]

https://preview.redd.it/260fkihtk3zh1.png?width=2400&format=png&auto=webp&s=a80b6861abdeee3c9a4e705b6ad9b337be005722

hey folks, I'm Ye, one of the contributors to Kapitsa, an open-source inference engine optimized specifically for Apple Silicon to run Qwen, Nemotron, Flint and Clover models locally. Our custom-written Metal kernels let us tune for each chip and each model. https://github.com/nace-ai/kapitsa/

The latest update, 0.2.26, is out. Since our last M5 Max numbers, Flash-Next 180B reads prompts 46% faster and the 27B writes 8% faster, and DiffuSpace's Clover 35B joins the catalog. Kapitsa also runs Qwen Flash-Next 180B with SSD offloading: on a Mac that can't hold it, the experts that don't fit in RAM stream from the SSD, so it runs on a 48 GB MacBook Pro at 61 tok/s.

Here are the end-to-end numbers on a 2026 MacBook Pro 16 with an M5 Max and 128 GB: six targets (dense, MoE, hybrid Mamba-2 MoE and a block-diffusion MoE), from 1K context up to 32K, against the next-fastest engine for each.

Try it (any Apple Silicon Mac; models in this post: 35b, 27b, flash-next, bolt, flint, clover):

brew install nace-ai/tap/kapitsa kapitsa serve --model 35b # OpenAI and Anthropic APIs on localhost kapitsa opencode --model 35b # or claude, codex, pi kapitsa bench # benchmark your own Mac 

Results

Decode is a 512-token coding answer, prefill a 4K prompt, median of 3 runs:

Model Decode, tok/s Prefill, tok/s
Qwen3.6 35B-A3B 346 6,036
Clover 35B-A3B 304 5,981
Flint 40B 265 5,770
Nemotron Bolt 74B 154 1,075
Qwen3.8 27B 143 904
Qwen Flash-Next 180B 108 1,701

https://preview.redd.it/r1t8d4jtk3zh1.png?width=2400&format=png&auto=webp&s=6f707ed68fe883ddf206de9e30e5f94cef4bd738

From 1K context all the way up to 32K. At 32K the 35B still writes 175 tok/s, and Flash-Next barely drops (90 to 78):

https://preview.redd.it/hxod2sktk3zh1.png?width=2400&format=png&auto=webp&s=9703ef7d4356cac43d685cf5e284a60a51764786

https://preview.redd.it/b2wqfimtk3zh1.png?width=2400&format=png&auto=webp&s=fd2da7b94e354af519fde41fbdaede61aa6df883

Against the other engines

Against the next-fastest engine for each model on the same Mac: 1.23x Splash on the 35B, 2.2x oMLX on Bolt, 1.18x rec on Flint and 1.12x mlx-serve on the 27B. Flash-Next is a tie with mlx-serve, Splash still reads prompts faster on the two Qwens, and nothing else runs Clover on a Mac.

https://preview.redd.it/zpjhe6otk3zh1.png?width=2400&format=png&auto=webp&s=2bf9bbc25c8231fcc1376e9f9efcf8d024914cea

Every cell with versions and flags: benchmarks. Raw runs: results.

Why it's fast: KFlash

Other engines verify the drafter's guesses as one chain and stop at the first miss. KFlash verifies a best-first tree of the drafter's candidates in the same 8-row pass and keeps the longest branch the target agrees with.

https://preview.redd.it/sle8vzptk3zh1.png?width=1200&format=png&auto=webp&s=c2e4afec6cad457c34108beab8824353c0123514

Three details make it fit Apple silicon:

  • Nearly free rows. Apple GPUs work in 8-row tiles, so on dense models an 8-row verify costs about 1.1-1.25x one decode step.
  • Sized per Mac. Each tree is sized cycle by cycle from a budget measured on that Mac: GPU time per row count, plus a per-position calibration of the drafter against its own acceptances.
  • Seed-exact. A guess is accepted only if it equals the token the target itself samples with plain decoding's random number, so a sampled reply is the one plain sampling writes with the same seed.

Write-up and measurements

Send us your benchmarks

Run the same test on your Mac and add it to the community results. It takes 3-15 minutes:

brew install nace-ai/tap/kapitsa brew install gh && gh auth login # results are sent as a GitHub pull request kapitsa bench --submit # pick a model; it asks before sending anything 

Plug in and close heavy apps while it runs. At the end it asks once: Enter sends the result as a pull request from your GitHub fork, and n keeps it on your Mac. What it sends is about 2 KB: your Mac's model, chip, RAM, macOS version and the numbers, with no serial number, user name or paths (add --dry-run to see exactly what it would send). No GitHub? Paste the numbers it prints in a comment here.

One more ask

Do you know prior work where tree-verified sampling matches plain sampling token for token under the same seed? Please point me to it so we credit it. We cite SpecInfer, Medusa, EAGLE-2 and Sequoia.

submitted by /u/DotaMate
[link] [comments]
2026-11-02 01:05:33 · 大模型,算力芯片,开源,OpenAI,Anthropic,Meta,阿里巴巴,代码生成,扩散模型,MoE架构,模型评测,提示工程,招聘HR,榜单评测,开发者生态
AI 资讯

What actually broke when I tried to fine-tune on web-scraped data and what fixed it [D]

Reddit r/MachineLearning

Fine tuning on self collected web data felt straightforward until it wasn’t. Here’s what actually caused problems:

Boilerplate contamination was the silent killer. Navigation menus, cookie banners, and footer text were leaking into training examples. The model started generating weirdly structured outputs that looked like half-rendered HTML. Solved it with aggressive DOM-targeting rather than raw text extraction and switching to a rotating residential proxy layer (per-request IP rotation means target sites serve you the same rendered DOM a real browser session would get, rather than a bot-filtered skeleton) made a noticeable difference in how clean the raw HTML was before I even touched the parser.

Deduplication order mattered more than I expected. Running exact dedup before fuzzy dedup produced meaningfully different training sets than the reverse. The model’s tendency to regurgitate phrasing shifted noticeably depending on the order.

The thing I still haven’t fully solved: near-duplicate detection across different languages. MinHash works fine monolingually, but multilingual dedup keeps surfacing edge cases I don’t love.

Curious whether others have hit the same issues, especially around multilingual corpora. Also genuinely wondering if anyone has a principled approach to deciding when scraped data quality is “good enough” to stop cleaning and just train.

submitted by /u/Symeoon
[link] [comments]
2026-11-02 16:25:25 · 算力芯片,Google,扩散模型,微调蒸馏,招聘HR,榜单评测

Small-scale check of "good views beat next-token prediction" (Balestriero & LeCun 2026): human captions only, 11M-param encoders [P]

Reddit r/MachineLearning
Small-scale check of "good views beat next-token prediction" (Balestriero & LeCun 2026): human captions only, 11M-param encoders [P]

The paper claims text models align with image models faster when trained on "good views" (two different captions of one photo) than on bad views (one caption, words hidden) or next-token prediction. Its largest run used captions written by an image captioner, so image information could have leaked in. I tried a laptop-scale version with human captions only.

Setup

  • Data: 10,000 COCO photos, 5 human captions each. 8,000 train, 1,000 val, 1,000 test.
  • Image side: frozen DINOv2-base, embedded once.
  • Text side: same 4-layer, width-256 encoder (11M params) for all three. Same captions, 3000 steps, batch 256, same anti-collapse loss (VICReg-style variance and covariance, not the paper's SIGReg). Only the training pairs differ. The text models never see an image.
  • Score: mutual 10-NN between caption embeddings and DINOv2 embeddings on the 1,000 test photos (chance 0.010).

Results (same learning speed, mean of 3 seeds)

  • Good views (2 different captions): 0.320
  • Bad views (1 caption, masked spans): 0.192
  • Next-token prediction: 0.148

Each method also got a small learning-rate search. Best speed, 1 seed: 0.328 / 0.196 / 0.168. Order unchanged.

Limits

  • 11M params and 8,000 photos, not the paper's 109M or 72B.
  • Good views need to know which captions describe the same photo. Annotators wrote them looking at the photo.
  • Retrieval (R@1 with one fitted rotation) shows a smaller gap: 0.084 vs 0.063 vs 0.057.
  • Next-token prediction's best learning speed was the top of my range.
  • One dataset, one image model. I added the extra speed step after seeing the first search; it is noted in the repo.

Code, chart and per-run results: https://github.com/IFAKA/platonic-lab

What I would test next: does the gap shrink as the encoder grows? I could not test that on a laptop. Has anyone tried?

submitted by /u/Traditional_Frame763
[link] [comments]
2026-11-02 15:08:41 · 开源,Meta,扩散模型,向量数据库,招聘HR,榜单评测

Show HN: Rustable is an open source database client built in Rust

Hacker NewsComments
· 开源,扩散模型,强化学习,招聘HR,榜单评测

Show HN: I built a little browser game to practice Vim commands

Hacker NewsComments
· 扩散模型,提示工程,招聘HR,榜单评测
AI 资讯

WTF Ubuntu?

Hacker NewsComments
· Anthropic,强化学习,招聘HR,榜单评测

The SEC Should Block Anthropic's IPO to Protect the Public

Hacker NewsComments
2026-11-02T21:34:46.817Z · 大模型,具身智能,融资,OpenAI,Google,Anthropic,Meta,Microsoft,推理思考,扩散模型,强化学习,提示工程,招聘HR,网络安全,榜单评测,开发者生态
AI 资讯

Show HN: Hacker Times, a New York Times-inspired version of Hacker News

Hacker NewsComments
· 大模型,OpenAI,Anthropic,Meta,Microsoft,阿里巴巴,扩散模型,向量数据库,招聘HR,榜单评测,开发者生态

In-N-Out may expand to these 3 states next, owner Lynsi Snyder says, as the 445-location burger chain pushes farther east

Fortune

In-N-Out may be putting a little extra mustard on its expansion plans. The California-based burger chain is considering putting down palm tree roots in three new states—Arkansas, Mississippi, and Oklahoma—potentially expanding the pool of people who insist on explaining “Animal Style” to you.

The burger wars’ eastern theater: In-N-Out, which got its start just outside of Los Angeles in 1948, may be as synonymous with the West Coast as surfboards and clean IPAs, but:

  • It has 445 restaurants in 10 states (including 289 in CA).
  • It went farther east than ever last year, moving into Tennessee.
  • It plans to open a New Mexico location next year.

Because the Tennessee In-N-Outs get supplies shipped from Texas, it could make sense to also open locations in Arkansas, Mississippi, and Oklahoma, since they’re already in the path of the distribution network, Lynsi Snyder, the chain’s owner and president, told actor Terry Crews in a dream we had an interview recently posted to the company’s website.

The chain also plans to expand in California.

Appetite for regional burger chains: In-N-Out saw domestic sales grow about 10% last year compared to 2024, trailing only New York-based Shake Shack among US burger chains, the Wall Street Journal reported in June, citing Technomic.—BC

This report was originally published by Morning Brew.

This story was originally featured on Fortune.com

2026-11-02 21:59:48 · AI应用,搜索RAG,招聘HR,榜单评测
继续滚动加载更多…