🤖 AI 资讯

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

Unsizing unsized values

Lobsters

Comments

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

[P] Built a 100% Client-Side Vision Pipeline for Real-Time Chessboard & Multi-Board Detection (Chrome/Firefox Extension) [P]

Reddit r/MachineLearning
[P] Built a 100% Client-Side Vision Pipeline for Real-Time Chessboard & Multi-Board Detection (Chrome/Firefox Extension) [P]

Hi everyone,

Inspired by tools like Chessvision.ai, I wanted to take a different architectural approach and build a browser extension (ChessInsights AI) that performs chessboard detection and piece recognition 100% client-side using local inference—with zero image data ever leaving the user's machine, support for detecting multiple boards in a single frame, and entirely free features.

The main goal was to bridge passive chess content (YouTube, Twitch, PDFs, articles) with active engine analysis without context switching: capture what's on screen and get a FEN string + engine eval in a couple of clicks.

System Architecture & Technical Approach

  • On-Demand Capture (Multi-Board Support):
    • Instead of continuously sampling video frames, the extension captures a screenshot of the visible tab via the browser's tab-capture API, triggered by the user (either a one-click "Analyze" on the current view, or a "Photo mode" where you draw a selection rectangle to crop a specific region).
    • That screenshot is fed to a locally-run object-detection neural network (YOLO-style architecture via TensorFlow.js, WebGL/CPU backend) that outputs bounding boxes and confidence scores for chessboard-shaped regions, filtered with non-max suppression.
    • Because detection runs over the whole frame rather than assuming a single board, it can find and return several distinct chessboards in one screenshot (e.g., multi-diagram PDFs, news articles, or broadcast splits). Boards are currently expected to be roughly axis-aligned rectangles (perspective/homography correction for heavily skewed boards is planned).
  • Piece Classification & Artifact Robustness:
    • Each detected board is cropped, split into its 8x8 grid, and each of the 64 cells is passed to a separate local CNN classifier (also TensorFlow.js) that predicts the piece type or empty square.
    • To handle video compression noise, stream overlays, arrows, and different 2D/3D board themes, the classifier was trained with augmentations focused on UI artifacts and low-resolution captures.
  • Everything Runs In-Browser:
    • Both the detection and classification models run entirely inside the extension (in an offscreen document on Chrome MV3) via TensorFlow.js—no image or frame data is ever sent to a server.
    • Position analysis uses Stockfish compiled to WebAssembly, running locally in a Web Worker, so engine evaluation also happens fully offline.
    • Results are converted into a FEN string and shown in the extension's dashboard/board editor, where you can play out lines against the local engine.

Key Differences vs. Existing Tools

  • Private by Design: No board images or video frames are ever uploaded—detection, classification, and engine analysis all run locally on your device.
  • Multi-Board Processing: Native support for capturing multiple diagrams at once.
  • Zero Cost / No Paywalls: Full feature set available out of the box.

I’d love to gather technical feedback from the community on client-side vision optimizations! For those building in-browser CV tools: what edge-case augmentation strategies or lightweight architectures have worked best for you when dealing with compression artifacts and overlay occlusions in real-time frame parsing?

submitted by /u/NullPointerGambit
[link] [comments]
2026-09-14 10:47:39 · 算力芯片,Google,扩散模型,强化学习,招聘HR,开发者生态
AI 资讯

Duplicating baseline benchmarks [D]

Reddit r/MachineLearning

Suppose I create two machine learning models suppose tree and neural network for a task let's suppose regression problem, now suppose I am sending both of this paper to two different journals, now the thing is the baseline models I need to only run once because I have reported same baseline in both papers, so the RMSE tables looks exactly same except the proposed model, does it lead to any problems like palgiarism??

Edit : I don't know why I am getting downvotes

submitted by /u/Jealous_Key_4030
[link] [comments]
2026-09-14 12:18:06 · 扩散模型,强化学习,模型评测,招聘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 资讯

[D] How do you get preprocessed dataset of a paper [D]

Reddit r/MachineLearning

Hi all,

I'm trying to reproduce a paper where the reported dataset statistics in Table 1 don't match what I get from the public raw data, even after implementing the preprocessing exactly as described.

I've tried all reasonable interpretations of the filtering described in the paper and the closest I can get is still an order of magnitude off for one of the datasets. The paper says "data available on request" — I emailed the authors and followed up once, no reply so far.

For those who've been in this spot:

  • Do you just keep the larger-but-valid version you can reproduce and document the mismatch?
  • Is it worth sampling to match the reported size or does that just create a different irreproducible dataset?
  • When do you escalate to the journal vs just waiting?

How have you successfully gotten preprocessed files from authors? Any etiquette around follow-ups or journal contacts that actually worked?

Thanks for any advice.

submitted by /u/Individual-Safety906
[link] [comments]
2026-09-15 08:50:58 · 扩散模型,招聘HR
AI 资讯

How much work in progress can a workshop submission be [R]

Reddit r/MachineLearning

Hi,

let's suppose I am working on an algorithm that uses principles x to solve problems A and B. I already implemented a very basic algorithm that used principle "x mini" to just solve problem A, ran experiments, but have not yet implemented the full one to solve A and B. I must say the algorithm to just solve A is not that novel and only the one that solves A and B would be.

Is this enough for a workshop submission? I want to submit the algorithm I already have, results and then the plan for the algorithm to implement A and B and the mathematics behind that.

Thanks

submitted by /u/strammerrammer
[link] [comments]
2026-09-15 09:13:12 · 算力芯片,扩散模型,强化学习,招聘HR

RSI is not happening [R]

Reddit r/MachineLearning
RSI is not happening [R]

A new paper (I'm not a coauthor BTW -- I just found it interesting) argues, basically, that RSI1 is not on the horizon2, because current (at the time the study was done) agents cannot do open-ended ML research.

Specifically, they took some accepted, but unpublished papers from NeurIPS, and tried to get the agents to do the same work, which was then graded by the original authors. And the agents (Codex/GPT-5.6 Sol and OpenClaw/Opus 4.8) could not do it.

And since they cannot do open-ended ML research, they cannot recursively self-improve -- this is their argument.3

Link: https://arxiv.org/abs/2607.27191

I think I've regretted the last 10 or so times I posted any kind of "research" in this subreddit -- either people downvote it, or it gets upvoted, but there is zero meaningful discussion. This might be the last time I'm trying this.4

Footnotes:

  1. RSI = Recursive self-improvement, a.k.a. superintelligence explosion. The concept was invented by I.J. Good in 1965. It does not mean "anything that speeds up AI research". Compilers speed it up! RSI means, basically, a nuclear chain-reaction, but for AI. The paper talks about "explosive AI progress" in the very first sentence of the abstract, and mentions "RSI" in the text.
  2. Some people have objected to my use of "X is on the horizon". I consider it synonymous to "people forecast X", and the authors use the word "forecast". "Not on the horizon" does not mean "can never happen".
  3. Quote: "This design also allows us to test a mechanism that informs many forecasts of recursive self-improvement: AI agents accelerate AI research because researchers delegate entire projects to agents and judge whether the returned results advance their work. Our evaluation closely matches this model, since authors handed an agent their own research question and closely evaluated the resulting output."
  4. 3 years ago, many of you upvoted a bunch of very uninformed comments that accused some researchers of misconduct, until I explained that this stemmed from misunderstanding how training works, in practice: https://www.reddit.com/r/MachineLearning/comments/18bdcu7/r_sequential_modeling_enables_scalable_learning/kc60k7e/?context=3 Today, one of the top comments is "I read the abstract (...) Nowhere, absolutely nowhere, do they make the claim ...". It's completely absurd. (Also, the commenter doesn't understand what "RSI" means.) The hivemind is very disappointing.

https://preview.redd.it/kprgucsxaoph1.png?width=796&format=png&auto=webp&s=60fdf26d150d9588e90b3d08e6a1b7fd84192ba5

submitted by /u/we_are_mammals
[link] [comments]
2026-09-14 18:03:41 · 大模型,算力芯片,AI应用,OpenAI,Google,代码生成,Agent智能体,扩散模型,强化学习,端侧AI,招聘HR,榜单评测,论文
AI 资讯

TabPFN-3.5 is released as the next SOTA tabular foundation model [N]

Reddit r/MachineLearning

Prior Labs released their latest tabular foundation model, TabPFN-3.5 today.

The model is top of both TabArena and BeyondArena and SOTA for 1M rows and up to 20k features

It comes with:

- TabPFN-3.5-Fast (in alpha): This one goes 6x faster than the base model
- TabPFN-3.5-Thinking: you basically exchange compute for better accuracy with this one and it's via the API
- TabPFN-3.5-Plus

On BeyondArena, TabPFN-3.5 leads on text-rich, high-cardinality and high-dimensional data, with +250 Elo points over the strongest previous baseline and +150 Elo points ahead of the previous overall leader.

TabPFN-3.5-Thinking is +20 Elo on the base model in BeyondArena and +44 Elo on TabArena

submitted by /u/tuanacelik
[link] [comments]
2026-09-15 16:18:50 · 算力芯片,扩散模型,招聘HR,榜单评测,开发者生态
AI 资讯

NeurIPS 2026: handling of multiple venue locations seems bad [D]

Reddit r/MachineLearning

There has been a recent post acknowledging that NeurIPS passes for Sydney sold out in minutes. For paper authors (guaranteed 1 pass at their designated location) — we recently received forms to select a preferred venue, but apparently we’re not guaranteed to present there. I thought it’s a good idea to discuss what this means. Does everyone want to go to Sydney? Is it going to be unlikely to get sent there if you’re in, e.g, Europe? I hear it’s the “main” venue. Is that really the appropriate way to go about things — having a “main” location with all the cool stuff and f*cking over a bunch of unlucky people to go to the runoffs? Wouldn’t it be more fair, if multiple locations are necessary, to spread the conference evenly across them? Curious to hear more opinions.

submitted by /u/CantKillTheLifeless
[link] [comments]
2026-09-15 13:48:40 · 扩散模型,招聘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 资讯

Narrative

Product Hunt

AI-first video editor, just describe edits & refine in chat

Discussion | Link

2026-09-13 23:37:48 · 扩散模型,招聘HR
AI 资讯

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

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

Most people prefer traditional architecture

Hacker NewsComments
2026-09-14T13:06:22+00:00 · 扩散模型,招聘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,榜单评测,开发者生态

CRISPR crops are coming to Europe — why bolder would be better

Nature

Nature, Published online: 15 September 2026; doi:10.1038/d41586-026-02848-z

For farmers and consumers to reap the benefits, guidelines for farming gene-edited plants must be implemented with careful thought.
· 扩散模型,招聘HR
继续滚动加载更多…