Antonio Montano ☼ (@AntoMon) profile picture

Digital transformer

Milan
Joined March 2009
Photo by Antonio Montano ☼ (@AntoMon)
Antonio Montano ☼ retweeted
China cracked recursive self-improvement 🤯 Tencent dropped 27B model that rewrites, retrains, and refines itself.. with zero human in the loop. It’s called "Terminal-RSI" and it solves one of the biggest problems with AI. They are incredibly lazy. Usually, an agent will make partial progress, claim it succeeded, and completely fail the final environment verifier check. this new pipeline forces agents to actually finish the job. here’s how it works: they built a recursive loop with two alternating phases.. - RSR (recursive self-rewrite): the model fine-tunes itself on its own successfully rewritten trajectories - RPR (recursive policy-refine): it then runs reinforcement learning (ppo) using a "critic" inherited directly from the previous stage to lock in those discovered behaviors - Loop: the training sequence leapfrogs itself: Base → RSR-1 → RPR-1 → RSR-2 → RPR-2 and the numbers are insane.. they applied this to a qwen3.8-27b base model. across the four "terminal-bench" suites, the agent's average success rate jumped from 20.68% all the way to 50.58%. on the absolute hardest benchmark suite (terminal-bench 4.0), the base model scored a flat 0.00%. after terminal-rsi? it hit 19.84% (putting it right on par with reference models like gemini 3.8 flash). the secret sauce? they fixed the reward system. instead of giving the ai "dense rewards" for just trying or passing semantic checks, they switched to a "success-prioritized reward" (spr). it mathematically separates strict success from partial credit. basically, the agent only gets the massive reward payout if the code actually passes the final terminal gate.. so it stops faking success. the gap between partial local repairs and strict terminal verification is closing fast. we are watching agents build their own training environments and level up autonomously.. the future is wild.
41
103
24
714
31,303
Antonio Montano ☼ retweeted
[RO] Democratizing Robot-Use Agents: A Unified Harness with Open Models J Yuan, Y Zuo, X Huang, W Zhang… [Tsinghua University & UC Berkeley] (2026) arxiv.org/abs/2611.01560
5
534
Antonio Montano ☼ retweeted
Hybrid Computer Use: agents pick among code, accessibility trees, and GUI—with live-state guards so stale actions die. Highest Partial and Binary on OSWorld 2.0 among compared systems. The desktop stops pretending to be a screenshot. Microsoft Research: arxiv.org/abs/2610.41432
3
4
18
644
Antonio Montano ☼ retweeted
A diagnostic model should be evaluated for how it changes readers' decisions, alongside its standalone score. DeepFAN, a Nature Cancer study involving Peking Union Medical College Hospital, HKU, Peking University People's Hospital, Deepwise and collaborators, examines AI-assisted assessment of incidental pulmonary nodules. Three takeaways: 1. Combine complementary views. A vision transformer captures the nodule and surrounding context, a 3D convolutional branch learns local imaging attributes, and a graph network relates those features to predict malignancy probability. 2. Test paired assistance. Twelve radiologists with one to five years of experience read 463 pathology-confirmed nodules from 400 patients across three centers, with and without AI assistance. Two crossover reading rounds included a four-week washout. 3. Separate model and reader outcomes. Standalone model AUC was 0.954 on the trial set. Readers' mean nodule-level AUC increased by 0.109, an absolute change rather than a 10.9% relative gain. These diagnostic endpoints do not establish mortality benefits or equivalent performance across all clinical populations. DeepFAN, a transformer-based model for human–artificial intelligence collaborative assessment of incidental pulmonary nodules in CT scans: a multireader, multicase trial Paper: nature.com/articles/s43018-0… Project: arxiv.org/abs/2603.25607 Code: github.com/zhjtwx/DeepFAN Our Report: jiqizhixin.com/articles/2026… 📬 #PapersAccepted by Jiqizhixin
3
3
2
7
734
Antonio Montano ☼ retweeted
speculative decoding is one of the main tricks for making AI answer faster: a small model quickly drafts the next few words, and the big model checks them all at once in papers however (below are few most interesting ones) these speedups are usually measured with a single user, while on a busy server the GPU has less spare capacity for drafting, so the gain shrinks DFlash: 5.1x faster with 1 request at a time, 2.4-2.9x with 32 arxiv.org/abs/2602.06036 P-EAGLE in @vllm_project: up to 1.69x over EAGLE-3 with 1 request, 1.05-1.25x with 64 arxiv.org/abs/2602.01469 DeepSeek’s DSpark reports the number a provider actually needs: on live traffic, each user gets answers 60-85% faster while the server handles the same total load arxiv.org/abs/2607.05147 so “5x faster” is true for one person in a chat window. for anyone serving many users, one needs to check out speed per user at the same load
3
3
21
967
Antonio Montano ☼ retweeted
Video generation meets the agent harness: multi-shot production, interactive world models, and paths toward recursive self-improvement of the generator itself. The clip is no longer the end of the loop. The loop is. Video Rebirth/NUS: arxiv.org/abs/2610.40191
2
2
14
587
Antonio Montano ☼ retweeted
Code skeletons (types, modules, signatures) beat prose design docs and behavioral specs in AWS’s new Skeleton Coding paper. - Code skeletons raised SDDBench mean test pass rate from 29% to 74% vs a task description alone. - With skeletons plus global invariants, a smaller model came within 5–8 percentage points of the larger model’s best results at 15–26× lower token cost. The best-performing specs combined modules, types, and signatures with natural-language contracts and global invariants. Richer .md architecture docs helped, but remained below the best code-like skeletons. Excessive contract detail hurt performance, especially for smaller models. Skeletons also reduced code erosion (a complexity-based proxy for maintainability) while behavioral specs increased it. Theory: structure changes which tests are sufficient. Interfaces expose intermediate states that end-to-end tests can miss. Limitations: the skeletons came from reference implementations. Costs exclude specification generation and evaluation. Unclear: how cheaply we can produce this structure upfront, and whether making the contracts mechanically checkable would improve results enough to justify the added cost. My bet: the best starting point for a coding agent isn’t more prose. It’s a model of the system and explicit constraints the implementation must satisfy. arxiv.org/abs/2610.38214
15
8
4
147
5,643
Antonio Montano ☼ retweeted
Are we entering a new golden age of scientific discovery? We analyze 200,000+ sessions of scientists using @claudeai across academic fields to understand what drives adoption—and how much AI could accelerate science. 🧵
3
18
2
92
7,520
Antonio Montano ☼ retweeted
Another one bites the dust: the k-Clique conjecture is dead, for good! @pinkfloydie and I show that for all k>k0 we can find (and count) k-cliques in n^((w/3-c)k) time, where k0,c>0 are consts independent of both k and the matrix mult exp w, even if w=2! orz.am/kclq
5
21
2
165
11,196
Antonio Montano ☼ retweeted
Rebuilding Computational Physics in Rust with AI Agents shinaoka.github.io/assets/so…
2
12
1
84
4,708
Antonio Montano ☼ retweeted
Agents don't need to read tool outputs as text. Coca-Cola compresses them into latent tokens: 70–89% fewer agent tokens, 24–56% faster runtime, and better task performance. Machines are starting to talk to machines in their native tongue. Tsinghua: arxiv.org/abs/2611.06500
4
4
19
895
Antonio Montano ☼ retweeted
For my own understanding, I have simplified @DavidTurturean's proof of the Aaronson-Ambainis conjecture. My main intent is to make the proof more accessible to researchers, teachers and students with basic knowledge of linear algebra, linear programming, probability and quantum computing. It is self-contained and easy-to-understand. I have added some worked examples. Constructive comments and suggestions are welcome. Paper is on my homepage: shivakintali.github.io PDF file: shivakintali.github.io/paper… I am working on making a video explanation. Congrats to @DavidTurturean and @psipbc for achieving this breakthrough. 🥳🍾🎉 CC: @AAmbainis, @DeryaTR_, @kimmonismus, @Dr_Singularity, @scottstts, @henryquantum, @PI010101, @mahdi_tcs_, @rynorhn, @infinterenders, @cgtwts, @choblin29, @aklokus, @tomgur, @wkcosmo, @say_cem, @jdlichtman, @rrwilliams @fortnow @octonion @thegautamkamath @KWRegan
Today Physical Superintelligence PBC is announcing a proof of the Aaronson-Ambainis conjecture, one of the central open problems in quantum complexity, with major implications for quantum computing speedup. psi.inc/research/aaronson-am… Thread 👇
4
6
38
4,143