Search: “Pyramid Solutions”

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

Discovery Foundation Models: Toward Open-Ended Discovery Intelligence

Proposes Discovery Foundation Models that participate in creating new problems and knowledge, instantiated in Zetema and the GALILEO therapeutic-discovery system.

The paper formulates Discovery Foundation Models (DFMs) as general-purpose systems for open-ended discovery, supporting seven coupled capabilities from problem discovery through evidence-grounded revision and continual improvement. It instantiates the framework with Zetema, combining explicit research-state dynamics, verification gating, external grounding, and cross-task Discovery Skill evolution. GALILEO, a real therapeutic-discovery system, closes the loop between Dry-Lab reasoning, robotic and hands-on Wet-Lab experimentation, and iterative hypothesis revision. The authors also define process-centered evaluation so discovery behavior can be trained and measured beyond final answers.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:56 UTC · 1d agoAI research 2 sources

38

Pyramid Solutions NetStaX EtherNet/IP Stack

CISA flags critical CVE-2026-78012 (CVSS 9.8) stack buffer overflow in Pyramid Solutions NetStaX EtherNet/IP stacks below v5.6.1, risking crashes or remote attack vectors.

CISA republished Pyramid Solutions' advisory for CVE-2026-78012, a CWE-121 stack-based buffer overflow in the NetStaX EtherNet/IP stack versions prior to 5.6.1, scored CVSS 9.8. Large Class 3 explicit-message requests can exceed the application-side receive buffer without generating a CIP error, potentially causing memory corruption, device crashes, or a silent remote attack vector. All eight adapter and scanner DLL/development kit variants, including CIP Security editions, are affected across critical manufacturing, energy, water, and chemical sectors. No public exploitation has been reported.

CISA Advisories·Sep 3, 12:00 UTC · 13d agoAdvisoryCVE-2026-78012

55

Learning-Guided Planning in Large Dynamic Action Spaces: Budgeted Tree Search for One-to-Many Mobile Charging

LP-BTS uses graph proposal policies, learned critics, and budgeted PUCT search to plan mobile charging across dynamic action spaces up to 2,813 stops.

LP-BTS is a learning-guided planning architecture for one-to-many mobile charging, where N=250 sensors induce roughly 1,125 initial candidate charging stops. A graph proposal policy concentrates candidate support, a learned value critic evaluates leaves, and edge-budgeted PUCT compares simulated futures, letting a single frozen checkpoint cover action universes from 736 to 2,813 stops. On a sealed 30-scenario confirmatory bank it attains the highest observed survival (0.4545) and alive-AUC (0.8031), though its +0.0066 survival edge over the strongest engineered comparator is statistically unresolved.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 16:42 UTC · 23h agoAI research

13

Building the materials foundation for AI

Syensqo's CTO says AI pushes semiconductors and data centers to physical limits, driving advanced materials demand and AI-accelerated materials discovery.

MIT Technology Review's Business Lab podcast, produced in partnership with Syensqo, features CTO Mike Finelli discussing how AI workloads push semiconductors and data centers to physical limits in performance, thermal management, and reliability. Syensqo develops high-voltage data center materials, semiconductor sealing materials, and immersion cooling fluids, while using AI agents to digitally synthesize millions of molecular combinations and predict performance before lab testing. Finelli describes a reinforcing cycle where AI improves materials that in turn enable better AI infrastructure.

MIT Technology Review · AI·12:47 UTC · 2h agoAI industry

25

ICS Patch Tuesday: Schneider Electric, Siemens Fix Critical Flaws

September ICS Patch Tuesday brings critical fixes from Schneider Electric, Siemens, and Aveva, including CVSS 9.2 authentication flaw CVE-2026-3869 in Modicon M580 controllers.

Schneider Electric's September advisories include a critical authentication vulnerability, CVE-2026-3869 with a CVSS score of 9.2, in Modicon M580 and Modicon M580 Safety controllers, plus high-severity bugs in PowerLogic T300 and EcoStruxure IT Data Center Expert. Siemens published nine new advisories, four rated critical across Reyrolle 7SR5, Open Interface Services, Industrial Edge Management, and SIMOVE Fleetmanager and SIPLANT, and began rolling out fixes for CVE-2026-31431, a 7.8-rated Linux kernel flaw enabling root shell access. Aveva disclosed four flaws in Pipeline Integrity Monitor's PIMBoards, including a hardcoded encryption key and MD5-hashed passwords, plus an unsafe deserialization issue in Enterprise SCADA. Rockwell Automation separately issued nine advisories covering RSLinx Classic and multiple controller products.

SecurityWeek·Sep 9, 10:49 UTC · 7d agoVulnerabilityCVE-2026-3869CVE-2026-31431

52

ModularRSI: Modular and Generalizable Recursive Harness Self-Improvement

Researchers propose ModularRSI, a modular benchmark-disjoint recursive self-improvement framework that evolves agent harnesses across five modules, improving TB2.0 and SWE-Bench Verified results.

ModularRSI targets generalizable recursive self-improvement (RSI) for agent harnesses by contrasting successful and failed trajectories for the same task and aggregating evidence across tasks to find recurring behavioral deficiencies. It decomposes the evolvable harness into five modules—Agent Loop, Tool Use, Observation Management, Context Management, and Task Completion Detection—each evolved independently within a restricted scope, then integrated with conflict resolution. Using 2,000 executable evolution tasks disjoint from evaluation benchmarks, it shows consistent gains on TB2.0 and SWE-Bench Verified and transfers across different foundation models.

Hugging Face daily papers·Sep 13, 20:00 UTC · 2d agoAI research

30

Why you should work on AI for AI Research — Richard Socher of Recursive

Richard Socher's new lab Recursive, backed by $4.65B seed, targets AI systems that automate AI research itself.

Latent Space interviews Richard Socher, founder of You.com and AIX Ventures, about his new venture Recursive, which raised a $4.65 billion seed round to build the 'Eureka Machine' — a superintelligence for automating invention and AI research. Early claimed results include an AI research system outperforming humans and their agents on optimization tasks within two days, and NVIDIA GPU kernel improvements discovered without CUDA experts. Discussion spans reward hacking, constitutional AI critique, AI regulation, open-source models as geopolitical soft power, and hard-takeoff constraints.

Latent Space·Sep 14, 16:04 UTC · 1d agoAI industry

45

Making Knowledge Distillation Cheap Enough to Run at Scale

Hugging Face blog by Multiverse Computing describes techniques making knowledge distillation cheap enough for large-scale training.

A Hugging Face blog post from Multiverse Computing (CAI) presents methods for reducing the cost of knowledge distillation so it can be run at scale. The post is aimed at practitioners compressing large models into smaller, cheaper ones for production use.

Hugging Face Blog·Aug 10, 10:05 UTC · Aug 10, 2026AI research

30

Learning to Solve Hard Problems in RL for LLMs by Never Giving Up

Paper introduces Never Give Up adaptive sampling, fixing RL's 'Matthew Effect' where compute is wasted on easy problems and hard problems see little improvement.

Researchers identify a 'Matthew Effect' in reinforcement learning for LLMs, where RL yields large gains on easy problems but minimal improvement on hard ones because compute is misallocated. They propose Never Give Up (NGU), an adaptive sampling method that keeps generating samples for a problem until one is correct, using asynchronous RL to filter easy problems cheaply and concentrate compute on hard ones. NGU improves performance per compute on the Deepscaler math benchmark and iteratively solves the Manufactoria coding task where standard GRPO with per-test reward fails.

Hugging Face daily papers·Sep 10, 20:00 UTC · 5d agoAI research

45

ZGCM-1: A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search

ZGCM-1 is a fully open 7B foundation model with 256K context that stays competitive with frontier models on math reasoning and agentic search.

ZGCM-1 is a fully open 7B dense foundation model trained from scratch using an efficiency-focused recipe: interleaved gated sliding-window and full attention, a stable FP8 Muon optimizer, and MDP-based mid-training with context scaling across 16K, 64K, and 256K. On mathematical reasoning and agentic search suites it remains competitive with much larger frontier models such as Qwen3-235B-A22B and GLM-5.1. The recipe yields a ~4.2x improvement in 16K pre-training time-to-loss, and all weights, checkpoints, training code, data recipes, and W&B logs are open-sourced.

Hugging Face daily papers·Sep 10, 20:00 UTC · 5d agoModel release

50

Sakana AI Researchers Introduce PC-ALM, a Layer-Local Alternative to Backpropagation That Trains 1000-Layer Networks

Sakana AI's PC-ALM adds per-layer Lagrange multipliers to predictive coding, matching backprop on networks up to 1000 layers with layer-local updates.

Sakana AI researchers propose Augmented Lagrangian Predictive Coding (PC-ALM), a training method that keeps every update layer-local while recovering backprop-aligned credit signals. The team proves multipliers converge to exact backprop adjoints in linear networks and trains 1000-layer residual MLPs on MNIST within about 2 points of backprop accuracy. PC-ALM matched backprop across a width/depth grid from 8 to 128 on MNIST and Fashion-MNIST where standard predictive coding failed in deep, narrow networks, and improved over PC on ResNet-18 with CIFAR-10 and Tiny ImageNet. An MIT-licensed JAX reference implementation reproduces the results on CPU.

MarkTechPost·Sep 14, 20:46 UTC · 1d agoAI research1

40

Dream-RSI: Recursive Self-Improvement through Evolving Worlds

Dream-RSI refines exploration policies by dreaming in replay simulators built from discovery history, cutting discovery costs across coding tasks.

Dream-RSI is a framework for scalable recursive self-improvement in autonomous coding agents, where a lightweight orchestration layer makes exploration explicit and programmable while leaving the underlying agent unchanged. Its core insight is that accumulated discovery history can serve as a replay simulator over the realized search space, providing immediate, low-cost off-policy feedback to evaluate and refine exploration policies without expensive online evaluations. Across algorithm engineering, mathematical optimization, and GPU kernel engineering, Dream-RSI achieves competitive or improved discovery quality at substantially reduced cost.

Hugging Face daily papers·Sep 13, 20:00 UTC · 2d agoAI research

32

One Symptom, Three Levers: A Critical Review of On-Policy Self-Distillation

A review paper frames on-policy self-distillation collapse as governed by three levers: token weighting, privileged information, and guidance decay.

The paper critically reviews On-Policy Self-Distillation (OPSD), where a language model trains on its own generations scored token-by-token by a teacher conditioned on privileged information such as reference solutions or environment feedback. It identifies collapse, the progressive narrowing of producible reasoning paths, as the dominant failure mode and analyzes it through three levers: signal weighting, the nature of privileged information, and teacher dynamics. The review is restricted to mathematical reasoning, reports no new experiments, and offers a shared vocabulary separating settled findings from disputed ones.

Hugging Face daily papers·Aug 25, 20:00 UTC · 21d agoAI research

45

Show HN: Ordewell – turn one goal into an ordered plan of coding-agent tasks

Ordewell is an open-source tool that decomposes a single goal into an ordered plan of coding-agent tasks, posted on Hacker News.

Ordewell, shared as a Show HN project on GitHub, converts one high-level goal into an ordered plan of tasks for coding agents to execute. The post received 40 points and 29 comments on Hacker News. It focuses on task planning and orchestration for autonomous coding agents.

Hacker News · AI·Sep 15, 13:31 UTC · 1d agoAI tools & infraHN 40↑ · 29 comments

15

Autonomous Research for Open-Ended Problems: A Case Study on Telecom Ticket Retrieval

Case study shows autonomous LLM research reaches 90% of SOTA on telecom ticket retrieval in 10 weeks versus 10 months human work.

The paper explores adapting autonomous research to open-ended, industry-grade ML problems through a telecom ticket retrieval case study with commercial and open-source agents. Autonomous research reached 90% of state-of-the-art performance (0.34 vs. 0.38 Recall@1) in 10 weeks versus 10 months of human work, at up to $200 per Cursor campaign. The authors find agents excel at narrow hyperparameter optimization but lack human-like intuition, recommending human-agent collaboration.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 17:09 UTC · 4d agoAI research

18

Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science

Stellar Colosseum, a many-agent harness for long-horizon math and TCS research, solves open problems and reaches 71% on TCS-Bench with Gemini models.

Stellar Colosseum is a model-agnostic harness that allocates inference across long-horizon research in mathematics and theoretical computer science, using strategy exploration, a readiness gate, section-level decomposition, and verifier feedback routing. Integrated into Google Antigravity's Teamwork framework as the Long Proof pattern, it obtains new results on open problems from FOCS and JMLR papers using Gemini 3.1 Pro. On TCS-Bench it achieves 71.0% accuracy with Gemini 3.1 Pro and Gemini 3.7 Flash, and a Codeforces evaluation with Gemini 3.1 Pro solves 218 of 222 problems.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:58 UTC · 1d agoAI research

55

An Open Recipe for IMO Gold: Training Nemotron for Olympiad Mathematics

Open post-training pipeline turns Nemotron 3 Ultra checkpoints into an IMO 2026 gold-medal system, scoring 30/42 without formal provers or external tools.

Starting from Nemotron 3 Ultra, researchers trained two specialist checkpoints using supervised fine-tuning and reinforcement learning for natural-language olympiad proof generation. Three checkpoints power an iterative generate-verify-refine search plus a separate high-compute selection stage, operating entirely in natural language with no formal prover, external tools, or internet access. The system scored 30 of 42 points at IMO 2026, reaching the gold-medal threshold. The release includes the post-trained checkpoints, training data, training and inference code, submitted solutions, and Nemotron-IMO-Bench with 200 novel olympiad-level problems.

Hugging Face daily papers·Sep 8, 20:00 UTC · 7d agoModel release

65

Online Change-point Detection for Cooperative Multi-Agent Reinforcement Learning

Researchers propose Patterns of Past Rewards (PPR), a lightweight reward-based detector that flags environment shifts in cooperative multi-agent reinforcement learning training.

The paper introduces Patterns of Past Rewards (PPR), an algorithm-agnostic detector that smooths cooperative agents' return streams and applies statistical drift testing to flag environment or task changes. Evaluation in a custom Speaker-Listener environment built on the Multi-Agent Particle Environment under two non-stationarity scenarios shows PPR balances detection speed against alarm stability. It avoids the repeated alarms of a smoothed-return baseline and the missed shifts of raw-return detection, enabling MARL systems to reliably identify major changes during training.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 15:49 UTC · 11d agoAI research1

20

IBIB: A Protocol for Measuring Enterprise AI Systems by Serving Route, Not Model Identifier

IB2 protocol scores enterprise AI systems by serving route with reliability-inclusive scoring; serving-arm choice moved one score from 77.38 to 82.54.

The protocol has three parts: a gold-blind capability-binding preflight verifying a route can execute the evaluation contract, a reliability-inclusive first-pass scoring rule, and structurally score-blind adjudication. Its reference instantiation uses 128 locked tasks and 987 assertions over document, spreadsheet, chart, tool, and database work, released as procedure and schemas rather than an exposed corpus. Across eleven systems, two complete runs on identical weights later failed distinct binding-gate predicates, four of seven suites saturate within a six-system band driven by governed database work and multi-tab joins, and excluding failed responses from denominators changes the point ordering. Serving-arm choice shifted one declared revision and precision from 77.38 to 82.54, though arms differed in access mode, harness generation, and the tool-call parser.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 17:31 UTC · 6d agoAI research1

30

On the Navier–Stokes Millennium Prize Problem

OpenAI announced an AI-generated solution to the Navier-Stokes Millennium Prize Problem, including a writeup and a formal Lean proof.

OpenAI shared what it describes as an AI-generated solution to the Navier-Stokes Millennium Prize Problem, one of the Clay Mathematics Institute's seven Millennium Prize Problems concerning fluid dynamics. The announcement includes a writeup and a machine-checkable formal proof in the Lean theorem prover. Details on the model, methodology and independent verification were not provided in the announcement text.

OpenAI News·Sep 8, 10:00 UTC · 8d agoAI research

72

PACE: Perceived-Latency-Aware Cascading Service Routing and Filler Control for QoE-Efficient Retrieval-Augmented Dialogue Serving

PACE cuts perceived latency in retrieval-augmented dialogue serving via cascading routing and filler control, reaching 0.41s P95 under load.

PACE is a serving framework for retrieval-augmented dialogue that optimizes Perceived Time-to-First-Response (PTFR) under quality and cost constraints. It combines a load-adaptive cascading router, a joint path-filler controller, and volatility-aware cache admission, deployed on a humanoid-robot sales service. On 75k CarQA requests, the cascade halved pure-LLM P95 PTFR (0.29s vs 0.53s) and the adaptive controller reached 0.41s P95, 2.4x better than RAG at high load; filler calls dropped 94% and stale answers fell from 86% to 0%.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:02 UTC · 6d agoAI tools & infra

20

Guiding Worker Self-Selection in Crowdsourcing Contests: An LLM-Augmented Algorithmic Approach

Researchers introduce GRAF, a greedy framework for crowdsourcing contest self-selection, and LLMScore, an LLM-driven method that auto-designs its scoring algorithm.

The paper studies self-selection in Tullock contests (SSTC), where workers choose contests and then compete within them. GRAF is a greedy polynomial-time framework that orders workers by a score vector with zero worker regret and platform optimality guarantees in special cases. LLMScore is an LLM-driven evolutionary framework that produces human-readable, inspectable scoring code, jointly optimizing platform utility and worker satisfaction. Across 1,000 synthetic instances in four settings, GRAF with LLMScore achieves high-quality, often near-optimal outcomes with low worker regret, transferring from small training instances to larger, structurally different settings.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 16:51 UTC · 8d agoAI research1

22

CUA-Universe: A Scalable and Dynamic Environment for Hybrid GUI+CLI Agents

Researchers introduce CUA-Universe, a pipeline turning real desktop software into hybrid GUI+CLI agent environments, lifting a 9B model's OSWorld success rate.

CUA-Universe is an environment-to-data pipeline that converts real desktop applications into hybrid GUI+CLI environments, scaling to 16 applications via App-Forge, Task-Weave, and Path-Steer. Training on its harvested trajectories shifted a 9B model toward effective GUI+CLI orchestration, yielding +39.3 points on CUA-Verse, +16.8 points success rate on OSWorld, and +7.84 points on OSWorld-MCP while cutting steps and tokens by up to 57% and 60%. The work addresses the scarcity of scalable hybrid environments for computer-use agents.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 17:26 UTC · 11d agoAI research1

38

Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization

Researchers release OR-Clarify, a benchmark testing whether LLM agents ask clarifying questions before formulating optimization models from incomplete requests.

OR-Clarify evaluates pre-formulation clarification in operations research: each task gives a partial problem description, withholds structured hidden slots, and scores agents via bounded interaction with a simulated user, measuring slot recovery, stopping behavior, silent assumptions, and interaction cost. The authors also propose InterOPT, a two-stage framework that identifies formulation-critical gaps to decide when to ask or stop. In choice-based experiments InterOPT substantially outperforms all baselines in exact slot recovery and remains competitive in the open-ended setting.

Hugging Face daily papers·Sep 3, 20:00 UTC · 12d agoAI research1

35

Ambient @ EgoLongQA 2026: Distilling Long-Video perception into a Sub-2B Model

Ambient team wins EgoLongQA 2026 sub-2B division by distilling an agentic long-video perception pipeline into a 2B vision-language model.

Ambient's entry to the EgoLongQA track of the Wearable-AI Challenge at ECCV 2026 placed first in the <=2B parameter division with 0.8279 on the held-out test set. The system distills the junior perception module of a tool-using agentic pipeline into a 2B student, reaching 89% of the pipeline's accuracy with 1.1% of its parameters and lifting a 27.1% base model to 81.4%. To meet the division limit, the multilingual embedding table is pruned from 248,320 to 143,469 rows, reaching 1.9985B parameters with provably identical logits on retained rows.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research

35

Rosetta at AlexandriaX-2026: LoRA-Adapted NileChat for Context-Aware Dialectal Arabic Dialogue Translation

Rosetta ranks 4th and 5th in AlexandriaX-2026 dialectal Arabic dialogue translation using a LoRA adapter on NileChat-3B, finding limited pretraining benefit.

The Rosetta system for the AlexandriaX-2026 shared task fine-tunes a LoRA adapter on NileChat-3B for context-aware English-to-dialectal Arabic dialogue translation. The adapter was additionally pretrained on MADAR and PADIC dialect corpora for the unconstrained track. It achieved spBLEU 26.10 (4th, constrained) and 25.09 (5th, unconstrained). External dialect pretraining improved only two of thirteen dialects while slightly degrading overall performance, indicating negative transfer.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:15 UTC · 6d agoAI research1

18

The Surprising Effectiveness of Approximate Value Iteration in Self-Play

Minimal approximate value iteration self-play learns more accurate value functions than AlphaZero in Connect Four and Hex while cutting training and inference costs.

The paper trains a minimal self-play implementation of Approximate Value Iteration (AVI) without MCTS and uses ground-truth oracles for exact evaluation in Connect Four, 7x7 Hex, and synthetic games. AVI learns more accurate value functions than AlphaZero, and its one-step-lookahead greedy policies remain competitive with MCTS-based policies at substantially lower training and inference cost. Preliminary experiments on Othello and 9x9 Go show AVI trains stably on larger games, suggesting simpler approaches have become increasingly practical with modern deep-learning tools.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:37 UTC · 7d agoAI research

35

Ambient @ EgoProactive 2026 : Proactive Egocentric Assistance with Visually Grounded Supervision

ECCV 2026 challenge winner reformulates egocentric intervention timing as single-token classification, boosting macro-F1 by 0.249 over free-form generation.

The paper describes the winning submission to the EgoProactive track of the ECCV 2026 Wearable AI Challenge, ranking first in the large-model division and second in the <=2B division. The method reformulates intervention timing as single-token yes/no classification, improving macro-F1 by 0.249 and G-mean by 0.30 over free-form generation. Supervision generated by a tool-calling video agent transferred better than a narration-only dataset that was four times larger and ten times cheaper, suggesting visual grounding matters more than annotation volume.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research

22

AI models' written reasoning steps correspond to distinct internal patterns, a new study finds

KAIST and Naver AI Lab researchers show LLM reasoning steps like extraction and computation map to distinct activation patterns, strongest in middle layers.

Researchers at KAIST and Naver AI Lab defined eight recurring reasoning operations, including extraction, decomposition, formula recall, deduction, and computation, and showed they correspond to separable activation patterns in Qwen2.5-7B, Qwen3-8B, and Gemma4-31B on math tasks, with GPT-5 labeling solution segments. The separation peaks in middle layers, holds even when a computation step produces a wrong answer, and goes beyond surface-level token choice. Findings replicated on Llama-3-8B, and classifiers trained on Qwen3-8B transferred to GPQA-Diamond and MATH-500. The authors note that using internal states for error detection or mid-generation steering remains future work.

The Decoder·Sep 12, 13:39 UTC · 4d agoAI research2

42

Kiteworks expands runtime data governance with Bonfy.AI acquisition

Kiteworks acquired Bonfy.AI to add runtime, context-aware classification and enforcement of data exchanges by people, machines, and AI agents.

Kiteworks acquired Bonfy.AI to extend its Data Control Plane with inline, runtime data governance at the moment data is exchanged via email, file sharing, APIs, and AI agents. Bonfy.AI's technology evaluates sender, recipient, counterparty, channel, and business purpose to apply policy before a send completes, aiming to reduce false positives versus pattern-matching prevention tools. This is Kiteworks' eighth acquisition in under five years, with compliance framing around provable control for CMMC 2.0, HIPAA, and GDPR.

Help Net Security·updated Sep 11, 10:56 UTC · 5d ago·first Sep 11, 08:04 UTC · 5d agoIndustry 2 sources1

25

Coop – Isolated VM Environments for Running Claude Code and Codex

Trail of Bits releases Coop, running Claude Code and OpenAI Codex agents inside isolated virtual machines for safer agentic coding.

Coop, published on GitHub by security firm Trail of Bits, provides isolated VM environments for executing AI coding agents such as Claude Code and Codex. Isolation contains the filesystem and network side effects of autonomous agent actions, reducing risk from unsupervised tool use. The project drew 61 points and 16 comments on Hacker News.

Hacker News · AI·Sep 7, 04:18 UTC · 9d agoAI tools & infraHN 61↑ · 16 comments1

28

Signed Rescue Routing: Harm-Aware Cascades for Efficient LLM Inference

Signed Rescue Routing improves LLM cascade efficiency by predicting when a larger model actually corrects a smaller one rather than uncertainty.

Signed Rescue Routing (SRR) is a budgeted cascade method that separately predicts rescues and regressions when escalating from a small to a large model, ranking requests by their signed difference. The authors prove this signed conditional gain is Bayes-optimal under a fixed escalation budget and add only a lightweight two-head router needing small-model output statistics at deployment. Evaluation with Qwen3-4B and Qwen3-8B on MMLU, HellaSwag, and ARC-Challenge shows better accuracy-compute tradeoffs than entropy routing and learned error predictors.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 17:31 UTC · 8d agoAI research

22

Negative Self-Distillation: Learning to Reason by Avoiding Flaws

Researchers propose Negative Self-Distillation (NSD), a label-free LLM self-improvement method that diverges from self-generated flawed reasoning rather than imitating privileged solutions.

The authors show On-Policy Self-Distillation can degrade complex reasoning by forcing imitation of artificially confident traces built on privileged information, suppressing uncertainty and self-correction. NSD instead generates a question-specific negative condition — such as acting as a 'careless reasoner' — and pushes the model's distribution away from it without ground-truth labels. A dynamic gating mechanism isolates reasoning-critical tokens so gradient updates fix behavioral flaws without damaging foundational linguistic capabilities. NSD consistently outperforms OPSD and other label-free, self-bootstrapping reinforcement learning baselines.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research1

30