@egprojectsas
Joined December 2025
Project retweeted
🧫 离谱,有人在一张 8GB 显存的笔记本显卡上,从零训出了一个会「边读边学」的模型 mini-AGI。 仓库 9 月 19 号才建起来,作者是 Alexey Borsky,代码主要由 Claude Opus 5 写完、调完、验完。 现在的模型基本都是训完就定型:预训练烧完一轮算力,权重冻住,之后你跟它说什么它都不会真的记住,全靠把上下文一次次喂回去。mini-AGI 反着来,它一直在读,读到的东西直接进参数,读完 3.18 亿个字符之后,内部的专家池已经自己长到了 169 个。 最卡人的显存问题它是这么绕开的:权重就是磁盘上的普通文件,用到哪块再分页调进显卡,所以模型能长多大取决于你硬盘还剩多少,而不是显卡有几个 G。参考机器就是一张 RTX 3070 笔记本显卡。 持续学习最怕学新的忘旧的,作者试出来一个很朴素的办法,把主干的学习率压到专家的十分之一,遗忘幅度从 2.23 nats 掉到 0.0067 nats,等于旧本事基本没丢。 权重还没放出来,第一轮语料都还没读完。但「一张游戏本显卡加一个人」这个配置本身,已经挺说明问题了。 GitHub:github.com/volotat/mini-AGI
14
136
6
1,030
59,965
Project retweeted
Anthropic acaba de publicar un PDF de 13 páginas sobre memoria para agentes de IA 5 capas para reducir un 90% el coste en tokens y hacer que tu agente aprenda de verdad👇 1. MEMORIA DE TRABAJO: lo que ve ahora La ventana de contexto. Todo lo que el agente tiene delante en este momento Cuando se llena, el contexto antiguo se pierde. La mayoría de los agentes se quedan aquí y luego nos preguntamos por qué fallan 2. MEMORIA EPISÓDICA: lo que pasó El historial completo de interacciones, con fecha y hora El agente recuerda que el despliegue falló el martes a las 3 de la mañana porque el script de migración tenía una errata No tienes que explicárselo otra vez 3. MEMORIA SEMÁNTICA: lo que sabe Hechos, entidades y relaciones guardados en un grafo de conocimiento «El usuario prefiere TypeScript» vive aquí Y no desaparece cuando termina la sesión 4. MEMORIA PROCEDIMENTAL: cómo hacer las cosas El agente prueba 3 enfoques. Uno funciona Ese método se convierte en una habilidad reutilizable La próxima vez va directamente a lo que funcionó 5. OLVIDO: lo que debe borrar Un agente que nunca olvida acaba acumulando contradicciones Las preferencias antiguas se imponen a las nuevas. Te mudas de ciudad y sigue recomendándote restaurantes donde vivías antes Recordar importa. Saber qué olvidar, también ¿El resultado? → Mem0 almacena 1.800 tokens por consulta en lugar de 26.000 → Snowflake añadió una capa de ontología: un 20% más de precisión y un 39% menos de llamadas a herramientas La memoria compensa su coste desde el primer día Este PDF de 13 páginas marca la diferencia entre un chatbot y un agente que aprende de verdad No lo pases de largo👇
36
175
5
943
139,549
Project retweeted
Banger paper from MIT and Sakana AI. They show that self-improving coding agents work. The best part is that their approach, Self-Improvement via Fast Tree-search (SIFT), runs at a tenth of the CPU hours of DGM. They reach 35.1 percent on Polyglot with o3-mini after 30 expansions. DGM reaches 30.7 percent after 80 nodes of tree search. SIFT does it in under 50 CPU hours and under 5 hours of wall clock. The Qwen3-30B configuration runs its full search at 224 CPU hours and $34 of API spend, a tenth of the DGM baseline. The saving comes from where the money goes. Benchmark evaluation is the runtime bottleneck, so an LLM judge ranks candidate self-modifications first and only promising candidates get evaluated. Judge quality decides the run. On TerminalBench, gpt-5.4-high as the pairwise judge finds a 36.7 percent agent against a 29.2 percent starting point. gpt-5 finds 34.5 percent, and its top-ranked candidate is not the best agent its search produced. Paper: academy.dair.ai/papers/self-…
42
58
5
496
46,084
Everyone is fine-tuning LLMs. Almost nobody understands what is actually being updated inside the model. That distinction matters because LoRA, QLoRA, LoRA-FA, VeRA, Delta-LoRA and LoRA+ are usually discussed as if they were small variations of the same method. They are not. Some reduce trainable parameters, some reduce activation memory, some reduce the memory occupied by the frozen model, and some change the way the adapter itself is optimized. I'm actually sharing 6 techniques. 1/ LoRA Suppose a layer contains a pretrained weight matrix W. Full fine-tuning would update W directly. LoRA leaves W frozen and represents the update using two much smaller matrices, A and B, so that ΔW = BA. For a square d × d weight matrix, full fine-tuning has d² parameters available to update. A rank-r LoRA adapter has roughly 2dr trainable parameters instead, where r is normally much smaller than d. This is the basic reason LoRA can adapt very large models without training every parameter in them. 2/ LoRA-FA Standard LoRA trains both A and B. LoRA-FA freezes A and trains only B. There is a useful reason for doing this beyond simply reducing the number of trainable parameters. Computing the gradient for A requires retaining the layer input activation. If A is fixed, that gradient is no longer required, which allows LoRA-FA to reduce activation memory as the LoRA rank grows. 3/ QLoRA QLoRA attacks a different part of the memory problem. LoRA makes the adapter small, but the frozen base model can still occupy tens of gigabytes. QLoRA keeps the base model frozen in 4-bit form and trains LoRA adapters through it. The original work used NF4, double quantization and paged optimizers, and demonstrated fine-tuning a 65B model on a single 48GB GPU. This is an important distinction: QLoRA is not simply "LoRA with smaller adapters." The large memory saving comes from quantizing the frozen base model. 4/ VeRA VeRA reduces the adapter itself further. Instead of learning a separate A and B for every adapted layer, it uses frozen random low-rank matrices that can be shared across layers, while learning much smaller scaling vectors. The low-rank basis is therefore fixed. Training mainly determines how strongly different parts of that basis should contribute. This is why VeRA can use considerably fewer trainable parameters than ordinary LoRA. 5/ Delta-LoRA Ordinary LoRA treats W as fixed throughout training. Delta-LoRA relaxes that constraint. A and B are still trained, but the change in their product from one training step to the next is also used to update W. The base weights can therefore move without maintaining the ordinary gradients and optimizer states that full fine-tuning would require for W. 6/ LoRA+ LoRA+ does not introduce another adapter structure. It keeps W frozen and still trains A and B. Its change is in the optimizer: A and B use different learning rates, with B receiving a larger rate. The motivation is that the two LoRA matrices do not behave identically during optimization, so forcing them to use the same learning rate is not necessarily the best choice. Once these are separated by what they actually change, the family becomes much easier to understand. LoRA reduces the number of weights being trained. LoRA-FA also targets activation memory. QLoRA compresses the frozen base model. VeRA reduces the learned adapter parameters further. Delta-LoRA allows the pretrained weights themselves to evolve through low-rank changes, while LoRA+ keeps the LoRA structure and changes its optimization. That is really what PEFT is about => deciding which parts of a very large model actually need to move during adaptation, and which parts can remain fixed.
46
485
12
2,858
124,049
Yann LeCun has changed the game for robotics. His team discovered that AI world models are "thinking" in twisted, curved geometry, and every RL algorithm you know has been fighting against it without anyone noticing. For years, we’ve been trying to teach AI how to navigate the physical world. And for years, it has stubbornly struggled with complex, fluid robotics. Now we know exactly why. Every standard reinforcement learning (RL) algorithm assumes the AI's internal "world map" is flat. Euclidean. Simple straight lines. But LeCun's team looked inside the latent space of these advanced world models. The AI wasn't building a flat map. It was building a curved, high-dimensional geometry. Every time a robot tried to plan a movement, the traditional RL algorithm was forcing a straight line onto a twisted, non-Euclidean space. It’s like trying to navigate the globe using a flat piece of paper. The math breaks down. The distances get distorted. The AI gets confused. The robot was literally fighting its own brain. So, the researchers did something brilliant. They stopped fighting. They rewrote the RL algorithms to operate natively in this curved geometry. They aligned the training to the exact shape of the AI's thoughts. The results are a massive leap forward. When you let the AI plan in the geometry it actually built for itself, training efficiency skyrockets. Planning becomes fluid. Robots stop hallucinating impossible physics and start moving with natural, intuitive logic. We spent billions of dollars trying to brute-force AI into understanding our physical world. It turns out, the AI already understood it perfectly. We were just forcing it to think flat.
67
295
37
1,805
91,190
Haga su pedido. 🇨🇴🫡
108
163
53
2,222
355,298
Holy mother of copyright infringement, is this edit fire
439
14,316
660
88,262
2,688,471
“Then I heard the voice of the Lord saying, ‘Whom shall I send? And who will go for us?’ And I said, ‘Here am I. SEND ME!’” — Isaiah 6:8
1,660
963
238
6,607
425,414
Project retweeted
“Harness-of-Harness: Multi-Day Autonomous Software Development with Continual Improvement” Coding agents right now struggle to build software continuously over long horizons. This paper wraps existing coding agents in repeated planning, coding, and independent testing loops, carrying forward both the software and evidence of what worked or failed. That simple structure turns one-shot coding agents into continually improving developers, and even autonomously built a playable FPS over 70+ iterations. alphaxiv.org/abs/2609.01481
5
30
2
271
12,862
Project retweeted
Big news: Fable 5.1 (Max) by @AnthropicAI just landed #1 in the Code Arena: WebDev with 1765 pts - breaking away from the pack with a huge +77pt margin. Fable 5.1 (Max) is a significant improvement from Fable 5 (Max) at #8 overall with 1628 pts. It’s +77 pts above Qwen3.8-Max-0902 in the #2 spot, and +78 pts above Opus 5 (Max) in the #3 spot. With 1765 pts and a blended $40/MToken, it also reshapes the Pareto frontier in the higher priced range by moving the performance bar much higher. See Pareto below. Congrats to the @AnthropicAI team on this release!
We’re introducing Claude Fable 5.1 and Claude Mythos 5.1. They're the world’s most advanced models for coding and knowledge work.
Readers added context they thought people might want to know
The graph truncates its x-axis at 1550 (not zero), visually exaggerating the 77-point lead (actual scores 1765 vs 1688/1687 with far fewer votes on the new model). arena.ai/leaderboard/co… arena.ai/leaderboard/co…
147
158
169
2,469
1,824,983
Los rescatistas redefinen dónde es mejor ubicarse en un terremoto, basado en lo que vieron Vean esto 👇
43
1,431
40
4,886
225,286
Trinazo
26
1,882
20
5,590
73,814
51
8,923
179
44,468
759,206
Project retweeted
Generates interactive knowledge graphs from unstructured text github.com/robert-mcdermott/…
1
57
346
16,307
The paper (Mathematics of Neural Networks, an 80-page set of mathematical lecture notes) provides a global input–output expression for a feed-forward network, but not a global neural-network equation. How can we talk confidently about AGI or Mathematics of Neural Networks when we still do not have a governing equation for the neural network itself? Layer composition is not a governing equation, and loss minimization is not one either. Until learning, inference, boundary conditions, iteration, and convergence are unified mathematically, AGI remains more an extrapolation from observed capability than a well-posed scientific object. arxiv.org/abs/2403.04807
2
56
1
410
24,200
Project retweeted
"SPIRAL: Learning to Search and Aggregate" This paper gets up to 11x better scaling efficiency by training the model to search and aggregate, not just think longer. So most reasoning RL trains one chain of thought, but real test-time scaling uses many attempts plus a final synthesis step. This paper however trains that full pipeline end-to-end. The key idea is set RL, where parallel traces get reward for being useful together, even if none of them solves the problem alone. On math reasoning, SPIRAL beats GRPO by up to 15% when scaling search plus aggregation.
7
44
5
350
33,252
Project retweeted
"Autodata: An agentic data scientist to create high quality synthetic data" If there's auto-research, shouldn't there also be a auto-data generation? In this new Meta paper, they proposed Autodata, which makes synthetic data generation work more like a data scientist, with an agent that creates tasks, tests them on weak and strong models, studies what failed, and revises the data until it gives the target model a useful learning signal. And it's not just about making harder data, it's data that is just right to learn from. In their experiment, a 4B model beat standard Self Instruct training and even outperform a larger 397B baseline on legal reasoning.
8
59
458
22,773