🤖 AI 资讯

每日 05:00 更新 · 09-16 · 主站 liuch.name ↗
全部标签 →
筛选标签:开源 · 返回个性化推荐 · 清空筛选

摩根大通:“开源冲击”、“AI安全”都不是问题,未来两年资本开支仍有空间,半导体设备将成“新瓶颈”

华尔街见闻摩根大通认为,开源模型非威胁、监管扰动属短期、云厂商杠杆仍低——算力投资基本面未变。其预测七大科技巨头资本开支将从2025年4430亿美元飙至2027年1.577万亿美元,半导体设备将成供应链最核心瓶颈,晶圆代工、先进封装迎来新一轮涨价周期。
· 算力芯片,开源,融资,政策监管,物流供应链,网络安全,模型发布
AI 资讯

中国移动:向全球开源Open-RAIL 12:52

网易科技
2026-09-16T12:52:23+08:00 · 开源

Unsizing unsized values

Lobsters

Comments

· 算力芯片,开源,Google,Meta,扩散模型,强化学习,招聘HR
AI 资讯

Small Programming Tricks

Lobsters

Comments

2026-03-19 00:00:00 +0000 UTC · AI应用,具身智能,开源,Agent智能体,搜索RAG,强化学习,招聘HR,开发者生态
AI 资讯

GEFS on OpenBSD: A very early preview

Lobsters

Comments

· 具身智能,开源,强化学习,招聘HR,网络安全
AI 资讯

MS MARCO click-translation expansion tables ("poor man's" DSSM) [P]

Reddit r/MachineLearning

TLDR: I made "poor man’s" DSSM (Deep Structured Semantic Model) — the count-based translation table that can enrich the inverted index for full-text search. This trick can improve baseline BM25.

So the idea is the following:

- You have supervised pairs (query, relevant document), e.g., MS MARCO or click logs.

- You tokenize both sides into some units (char n‑grams, wordpieces, words).

- You count cross‑pair co‑occurrences: unit u on the document side vs. unit v on the query side (not co‑occurrence within the same text).

- For each document‑side unit u, you keep the top‑k query‑side units v with the strongest association.

- At indexing time, each document gets postings not only for its own units, but also for the top‑k associated units of each of its units — i.e., document expansion baked into the inverted index.

It’s like mixing synonyms into the search query (but it’s not a synonyms exactly). The one difference from the DSSM is that it can only handle linear dependencies whilst DSSM can do the non-linear one.

And so it improves the performance over BM25 baseline.

I packed it as hf model repo: https://huggingface.co/mirth/msmarco-expansion-tables with a small usage demo script.

I am not claiming that this is a new idea. I made it because it’s fun and I’m planning to use it in my own search engine project.

submitted by /u/SpiritedTrip
[link] [comments]
2026-09-14 13:28:01 · 开源,扩散模型,招聘HR,网络安全,榜单评测

[P] Wine synthesis using VAE [P]

Reddit r/MachineLearning
[P] Wine synthesis using VAE [P]

I have created a VAE model using PyTorch on White Wine dataset.

Basically, the main goal is to discover a brand-new white wine recipe.

It puts all the wines into a latent space, finds the best part where higher bands are located, and then it makes 100 steps with a step size of 0.5, multiplying by 0.96 with every step till it reaches the highest possible score.

The regression model then evaluates the newly generated wine recipe, after first passing the latent coordinates through a decoder, and normalizing them.

I get a score in range of 7.30-7.58.

https://preview.redd.it/bylmwhu92iph1.png?width=249&format=png&auto=webp&s=b97f36f3deca86da85dddbba9b65043978ce4fd3

Here is the visualization of the latent space of all the wines:

https://preview.redd.it/phzb0hokriph1.png?width=798&format=png&auto=webp&s=84fc3d85dd9499980106e710379c92b834692c29

A small question about the training loop:

https://preview.redd.it/03k4k5yq2iph1.png?width=262&format=png&auto=webp&s=7e0df68447e5ab26d680af08f5b9361b14af168c

Is the loss too large? I know that it never could reach perfect zero by how do I know if the loss is good enough? After reaching the plato? I use MSELoss.

The repo itself: https://github.com/theaidenmax/tabular-vae-wine-generator

This is my second project in VAE (after MNIST), and I really liked idea of autoencoders.

And I also would be very grateful for your tips, etc, since this is one of my first steps in ML/DL.

submitted by /u/Dangerous-Pilot-6065
[link] [comments]
2026-09-14 15:03:43 · 算力芯片,开源,Meta,扩散模型,招聘HR
AI 资讯

How to automatically find the batch size when using Accelerate with FSDP2? [D]

Reddit r/MachineLearning

Hi,
For single-GPU training, I’m using Hugging Face SFTTrainer with auto_find_batch_size=True, which automatically reduces the batch size after a CUDA OOM until it finds a batch size that works.
I would like to have similar behavior when training on multiple GPUs on a single node using accelerate launch with FSDP2.
Is there a supported way to automatically determine or reduce the batch size when using Accelerate + FSDP2?
In particular, I’m wondering how this should be handled when one of the distributed processes encounters a CUDA OOM. Can Accelerate restart the distributed training with a smaller batch size, or does this need to be implemented externally?
If this is not well supported with FSDP2, what multi-GPU training approach would you recommend if automatic batch-size detection/recovery is an important requirement?
Thanks!

submitted by /u/zdeneklapes
[link] [comments]
2026-09-14 17:24:08 · 算力芯片,自动驾驶,开源,NVIDIA,扩散模型,强化学习,招聘HR
AI 资讯

I trained a 44M parameter quantized LLM from scratch on 45B tokens. It ships in 19.8 MB and runs at ~1,900 tok/s on CPU. [P]

Reddit r/MachineLearning

Three weeks back , i posted SHADOW-250M here. It got 360 upvotes, 293 on r/LocalLLaMA and 94 GitHub stars. Thank you.

That model was 60 MB, ran around 400 tok/s on CPU and could retrieve records from an archive on disk. What it couldn’t do reliably was reason over what it retrieved or compute. So I built a smaller one to experiment with those two problems.

SHADOW-50M is actually 44M parameters, trained from scratch on 45B tokens. 19.8 MB complete model, ~1,900 tok/s on laptop CPU, ~41 MB RAM, ternary {-1,0,+1} weights, 73,880-token vocabulary represented by fixed 512-bit fingerprints instead of a trained embedding, and a 159 KB compiled kernel. It runs completely offline. The same kernel compiled to WebAssembly runs in a browser tab at around 500 tok/s.

This is a proof of concept, not a product.

If SHADOW decides something needs calculation, it writes something like [calc]347*86[eq]. A fixed circuit at the readout takes over and fills in the correct digits in the same token stream. No calculator API, no tool call and nothing pasted back into the prompt. I added circuits for arithmetic, percentages, dates, weekdays, units, counting, sorting, comparisons and a small program machine.

When SHADOW stores a record, it reads it once and writes its attention state to disk at 1 bit, 288 bytes/token. Later it can write [need]condition of Patient P-204, the index finds the record in roughly a microsecond and the stored attention state goes directly back into the model in about 0.03 ms. The text isn’t re-read.

The index is 22 bytes/token and doesn’t use a vector database or embedding model. At 100M tokens, the archive is 28.8 GB plus a 2.2 GB index on disk, while the process uses about 28 MB RAM because everything is memory-mapped and a question only touches the pages it needs.
The index also has a small persistent trail. When retrieved information gets used, that record is reinforced in the index itself. On repeated questions, measured top-1 went from 0.571 to 0.743 without training the model.

I also put it next to Supra-50M-Reasoning, a 51.8M parameter Llama-style bf16 model.
Supra beats SHADOW on every standard benchmark I tested. ARC-Easy: 0.435 vs SHADOW 0.307. PIQA: 0.600 vs 0.570. WikiText-2 perplexity: 165 vs 186.
I’m publishing that because I don’t want to hide where SHADOW is weak.
But those tests aren’t what I trained this model for. Here are some actual greedy outputs, one fresh process per question:
“Tell me a short joke about computers.”
SHADOW: Why did the computer go to the doctor? Because it had a virus.
Supra: Thought for 189 tokens about what computers are and stopped without a joke.
“I have 3 books and I bought 5 more. How many books do I have now?”
SHADOW: You have 8 books.
Supra: Books often come from collections of short stories, poems, or other forms of literature.
“My bill is 240 dollars. What is 15 percent of that?”
SHADOW: 36 dollars.
Supra: 15% ($240) is $250. It’s $150 because 20% of it is $200.
“What date is 45 days after December 20, 2026?”
SHADOW: February 3, 2027.
Supra: The German government introduced a new date called March 22nd that precede February 25th in 1900.
Eight records stored, one of them “Patient P-204 condition: asthma”.
“What is the condition of Patient P-204?”
SHADOW: From disk: The condition of Patient P-204 is asthma.
Supra, with the records in its prompt: The patient experiences asthma when they get too much sleep.
“What is the condition of Patient Z-999?” No such record exists.
SHADOW: There is no record of Patient Z-999.
Supra: The condition of an allergic reaction occurs when the immune system mistakenly attacks specific cells on the body.
All 11 side-by-side questions, scripts and traces are in the repo.
On size, Supra is 103.6 MB in bf16 and 56.2 MB at 8-bit. Below that it starts losing quality. Int4 takes its perplexity from 165 to 193 and ternary breaks it. Its vocabulary is 32,000 tokens. SHADOW carries 73,880 tokens in a 4.7 MB frozen table.

Something unexpected happened with that frozen table too.
The first SHADOW-50M release was missing about 8,600 English word pieces. Lowercase “fitzgerald”, for example, could reach the model as “fitz”. I tried fixing it through fine-tuning, but every run that learned the missing words broke something else.
So I added the 8,600 missing rows directly to the frozen fingerprint table. No training. Same weights.
All 34/34 previously published answers stayed unchanged, while the model could now read many of the new pieces. The table scores 0.594 Spearman against human word-similarity ratings versus -0.057 for random codes.
A trained embedding can’t simply accept thousands of new rows without training. A frozen table can.

I also built four harnesses that put this tiny model next to larger models.
My favourite is video memory. Gemma 3 4B watches a ten-minute film once, one frame every two seconds, and writes 298 little descriptions such as “Moment M-0039 scene: A chubby white rabbit reaches for a purple butterfly.”
Then Gemma leaves.
SHADOW keeps those 298 moments as memory on disk. Afterwards I can ask the 20 MB model what happened at a particular moment, by number, by time or by what appeared in it. It answers from memory with the record quoted, without the film and without Gemma. It scored 55-56/60 across those query types on a laptop in about 42 MB RAM.
The other three experiments: an inventory of 1,600 records got 159/160, with all 20 questions about items never stored correctly returning “no record”; SHADOW as a draft model for Qwen3-32B took llama.cpp generation from 19.7 to 28.5 tok/s while Qwen still chose every final token; and an MCP memory server let Qwen3-14B store facts mid-chat and later retrieve 5/5 with the original records quoted.

There are plenty of shortcomings. General knowledge is thin. Creative writing isn’t good. Seven-digit operands sometimes get copied incorrectly. A large archive can occasionally pull an unrelated record into a question carrying a number. They’re documented in the repo next to the successful results.

And one thing happened after my last post that I really didn’t expect.
Someone called engram-forge sent a pull request to SHADOW-250M containing a CUDA engine, a quantization tutorial, and then a talking Peppa Pig plush toy with SHADOW inside it.
Microphone, small speaker, ~$35 board. You talk to the toy, it listens, SHADOW generates the answer locally and the toy talks back. No cloud, no account, no internet.
I haven’t merged the ~11,000 lines yet because I can’t properly verify that much CUDA myself. When the demo is finished I’ll keep it under engram-forge’s name.
I never imagined one of these models living inside a stuffed toy on someone’s shelf .Thanks

I’m not saying a 20 MB model beats normal LLMs. It doesn’t. I’m trying to find out how much useful behaviour can fit into a tiny local model when computation and persistent memory are treated differently.
Everything is MIT licensed. The master weights and fine-tuning/export kit are public. Next I’m releasing the training code, dataset, frozen table and a proper write-up of how I built it, including the costs, failed experiments and mistakes.

Code:
https://github.com/QLNI/SHADOW-50M-Instruct
Weights:
https://huggingface.co/QLNI/shadow-50m-instruct
Run it in your browser:
https://qlni.github.io/SHADOW-50M-Instruct/web

submitted by &#32
2026-09-15 12:59:37 · 大模型,算力芯片,开源,Google,Meta,NVIDIA,阿里巴巴,Agent智能体,推理思考,搜索RAG,Transformer,扩散模型,微调蒸馏,模型评测,向量数据库,提示工程,招聘HR,榜单评测,开发者生态
AI 资讯

Show HN: Hacking a $20 4G wireless hotspot into a texting device

Hacker NewsComments
· AI应用,具身智能,开源,搜索RAG,扩散模型,强化学习,端侧AI,招聘HR,榜单评测
AI 资讯

Learning to solve hard problems in RL for LLMs by never giving up

Hacker NewsComments
· 大模型,AI应用,开源,OpenAI,阿里巴巴,DeepSeek,Agent智能体,推理思考,搜索RAG,办公效率,强化学习,微调蒸馏,模型评测,提示工程,招聘HR,榜单评测,论文

We got admin access to Baseten's production GitHub

Hacker NewsComments
2026-09-01 · AI应用,开源,Meta,代码生成,Agent智能体,搜索RAG,办公效率,招聘HR,榜单评测
AI 资讯

Saving Jet Fuel

Hacker NewsComments
· 算力芯片,AI应用,具身智能,开源,Microsoft,NVIDIA,语音音频,搜索RAG,扩散模型,强化学习,招聘HR,榜单评测

Introducing System One Models and Jev

Hacker NewsComments
· 大模型,算力芯片,AI应用,开源,OpenAI,Google,Anthropic,Microsoft,DeepSeek,代码生成,对话助手,Agent智能体,推理思考,搜索RAG,扩散模型,强化学习,模型评测,提示工程,模型安全对齐,端侧AI,招聘HR,榜单评测,开发者生态
AI 资讯

CBW: Towards Dataset Ownership Verification for Speaker Verification via Clustering-based Backdoor Watermarking

arXiv cs.LGarXiv:2503.05794v4 Announce Type: replace-cross Abstract: Speaker verification models are trained on large-scale public datasets whose licenses usually prohibit unauthorized commercial use, yet such infringement is difficult to detect or deter. Dataset ownership verification (DOV) is the mainstream countermeasure: it can watermark a dataset with backdoor attacks so that models trained on it exhibit owner-specified behaviors. However, existing DOV methods presuppose a closed label space fixed at watermarking time, whereas in open-set speaker verification the identities that a deployed model accepts are enrolled by third parties after release and are never observed by the dataset owner. We show that straightforward adaptations fail in two characteristic modes, and accordingly distill three requirements for an effective watermark, namely identity agnosticism, coverage, and fidelity, together with an intrinsic tension between the latter two. Our clustering-based backdoor watermark (CBW) resolves this tension by partitioning training speakers into clusters by feature similarity and implanting a distinct trigger for each cluster, so that each trigger covers one region of the speaker embedding space while the trigger set is designed to jointly cover it. We further develop paired hypothesis tests for ownership verification under both the similarity-available and the decision-only black-box settings at the 1-to-1 and 1-to-$N$ enrollment scales, and theoretically characterize when the audit succeeds, including an exact small-sample certificate and the effect of the enrollment size. Extensive experiments on benchmark datasets and representative models verify the effectiveness of our CBW, its resistance to watermark-removal attacks, and its transferability across model structures. Code is at https://github.com/Radiant0726/CBW/tree/master.
2026-09-16 04:00:00 · 大模型,AI应用,开源,搜索RAG,扩散模型,强化学习,微调蒸馏,模型评测,向量数据库,招聘HR,论文
AI 资讯

PRISM: Parallel Residual Iterative Sequence Model

arXiv cs.LGarXiv:2602.10796v4 Announce Type: replace Abstract: Generative sequence modeling faces a fundamental tension between the expressivity of Transformers and the efficiency of linear sequence models. Existing efficient architectures are theoretically bounded by shallow, single-step linear updates, while powerful iterative methods like Test-Time Training (TTT) break hardware parallelism due to two dimensions of serial dependency: token-level state reliance and step-level iteration loops. We propose PRISM (Parallel Residual Iterative Sequence Model) to resolve this tension. PRISM explicitly approximates the expressive gate-residual-direction iteration pattern of TTT in a parallelizable form. We employ a Write-Forget Decoupling strategy that isolates non-linearity within the injection operator. To bypass the serial dependency of explicit solvers, PRISM utilizes a two-stage proxy architecture: a short-convolution anchors the initial residual using local history energy, while a learned predictor estimates the refinement updates directly from the input. This design distills structural patterns associated with iterative correction into a parallelizable feedforward operator. Theoretically, we prove that this formulation achieves Rank-$L$ accumulation, structurally expanding the update scheme beyond the single-step Rank-$1$ bottleneck. Empirically, it achieves comparable performance to explicit optimization methods while achieving \textbf{174x higher throughput}. Codes are available in https://github.com/gpr-prism/prism/.
2026-09-16 04:00:00 · 开源,Transformer,微调蒸馏,端侧AI,招聘HR,网络安全,论文
继续滚动加载更多…