Search: “soar-integrations”

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

The Router Within: Eliciting Native Skill Routing from a Frozen LLM

Gavel reads skill-routing signals from a frozen LLM's forward passes with two linear maps, beating retrieval pipelines by up to 21.9 points.

Gavel (Glance And Verdict) shows a frozen agent LLM already contains skill-routing signals in its forward passes, read out via two trained linear maps without loading skill text into context. A glance step scores the full library using mid-layer states and per-skill banks built in one forward pass; a verdict step fuses the model's own likelihood and yes/no judgment as a product of experts. Trained once, it transfers zero-shot to three public benchmarks and SkillTraj (372 simulated agent trajectories); on Qwen3-32B it beats progressive disclosure and retrieve-and-rerank pipelines adding 1.2B-16B external parameters by up to 13.4 points (21.9 mid-rollout).

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

42

Variational Continuation for Double Pendulum Periodic Orbits

Researchers introduce a Hessian-based, integrator-free method using automatic differentiation to continue periodic orbits in the double pendulum, uncovering previously unreported orbit families.

A new arXiv paper presents a variational, Hessian-based framework for numerically continuing periodic orbits in dynamical systems, parametrizing candidate loops as Fourier series and minimizing deviation from the governing differential equations. Automatic differentiation replaces hand-derived Jacobians, and flat directions of the loss landscape guide the continuation search. The method is demonstrated on the double pendulum, mapping bifurcations along orbit families, including periodic orbits where neither pendulum mass is ever simultaneously at rest.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 16:42 UTC · 12d agoAI research

15

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.

Hacker News · security·Sep 14, 12:23 UTC · 2d agoAI researchHN 22↑ · 19 comments

15

The Pelican comparison grid for Astra is pretty interesting

Simon Willison's pelican SVG comparison shows GPT-6 Astra producing markedly better images than GPT-5.6 Sol, Terra, and Luna across reasoning levels.

Willison generated pelicans-riding-bicycles SVGs with newly accessed GPT-6 Astra at low through max reasoning levels and rendered them in a comparison grid against GPT-5.6 Sol, Terra, and Luna. Astra's outputs were markedly more coherent, while even the best GPT-5.6-Sol images remained largely abstract shapes. Astra does not support a reasoning=none setting, so all comparisons involved reasoning-enabled runs.

Simon Willison·Sep 4, 23:59 UTC · 11d agoAI research

25

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 · 22d agoAI research

45

MaxKernel: Agentic Kernel Generation for TPUs

Researchers open-source MaxKernel, a multi-agent LLM system that generates and optimizes TPU kernels matching expert hand-tuned baselines on JaxBench.

MaxKernel is a multi-agent system offering three paradigms for TPU kernel development: human-in-the-loop collaborative design, a fully autonomous metric/trace-driven optimization loop, and graph-based autonomous search for global exploration. All paradigms draw on a shared pool of specialized sub-agents for planning, implementation, self-debugging, testing, and hardware profiling. Evaluated on JaxBench's 50 diverse TPU kernel tasks and real-world workloads from open-source models, it consistently matches expert hand-tuned baselines. The system is open-sourced via the AI-Hypercomputer GitHub repository.

Hugging Face daily papers·Sep 2, 20:00 UTC · 14d agoAI tools & infra

40

Searching for New Physics with Reinforcement Learning

Researchers apply reinforcement learning to identify SMEFT operators explaining particle physics anomalies, reproducing and improving known CDF W-mass results.

The paper introduces a reinforcement learning method to search the large Standard Model Effective Field Theory (SMEFT) operator space for explanations of measurement anomalies. It was validated on the CDF W-mass anomaly, reproducing and improving known results, then applied to a harder multi-anomaly scenario. RL efficiently navigates complex loop-level operator correlations that bias human-driven phenomenological analysis.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:07 UTC · 7d agoAI research

22

Generalized Agent Iteration: One Formal Framework for Iterative Policy Improvement and Recursive Self-Improvement

Generalized Agent Iteration formally unifies iterative policy improvement and recursive self-improvement, defining axes that distinguish anchored, goal-drifting, and self-referential agents.

The paper proposes Generalized Agent Iteration (GAI), a formal framework that models learning as a cycle of agent evaluation and agent improvement, defining the agent as a configuration of modifiable components. Two dials—whether the improving mechanism is part of the agent and whether the evaluation standard is grounded outside it—separate generalized policy iteration (GPI) from recursive self-improvement (RSI) and classify systems as anchored, goal drift, or fully self-referential. The framework places existing systems on shared axes and makes defects of recursive self-improvement statable one condition at a time.

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

30

Semigroup-JEPA: Latent Dynamics Consistency for Zero-Shot Physics Generalization

SG-JEPA world model conditions latent prediction on physical parameters, halving open-loop prediction error versus DINO-WM and boosting robotic control success.

SG-JEPA extends the LeWorldModel JEPA framework by supplying the governing physics parameter to the temporal model via action-conditioning and jointly training an encoder and predictor through autoregressive latent rollout. On out-of-distribution gravitational-field tasks it reduces open-loop prediction error by up to 2x versus DINO-WM on 2D datasets and increases 3D robotic control success rate up to 2.5x using independently trained diffusion policies. A linear feature analysis attributes most of the gain to the encoder learning features that the predictor can carry forward through rollout.

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

45

NCP-ArchPreview Technical Report: Moving towards Latent Space Language Models through Next Concept Prediction

An 8.9B-parameter latent-space language model using next-concept prediction matches OLMo-3-7B pretraining loss with only 51.3% of the training tokens.

NCP-ArchPreview augments next-token prediction with Next Concept Prediction over a product-quantized concept vocabulary built from hidden states, trained jointly end-to-end. The 8.9B model was trained on 5.73T tokens from the Dolma-3 dataset, the largest latent-space language model demonstration to date. It consumes 51.3% of the tokens to reach OLMo-3-7B's final pretraining loss and outperforms it by 2.45 points on the downstream macro-average, including a 5.99-point GSM8K gain. The learned latent space also enables lightweight domain adaptation via a 17M-parameter VQ module and improves speculative drafting accepted length by 4.17%.

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

52

Silver Rate Is (Almost) Optimal for Gradient Descent Acceleration

New optimization theory paper proves near-optimal lower bounds for gradient descent with predetermined stepsizes, confirming silver-schedule optimality.

The paper studies the limits of accelerating gradient descent using predetermined nonnegative stepsizes in smooth convex optimization, with the key constant p_sil = log2(1 + sqrt(2)). It proves a non-anytime lower bound of Omega(n^(-p_sil - O(sqrt(log log n / log n)))) on the error achievable by any such stepsize schedule. In the anytime setting, it shows every infinite nonnegative schedule must incur error Omega(n^(-2*p_sil/(1+p_sil) - O(sqrt(log log n / log n)))) at infinitely many horizons. Combined with the silver-schedule upper bound of Altschuler and Parrilo (2025) and the anytime upper bound of Zhang et al. (2025), these results determine the optimal polynomial convergence exponents in both settings.

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

28

SchemeArena: Factorized Stress Testing of Scheming in LLM Agents

Researchers introduce SchemeArena, a 400-scenario benchmark stress-testing scheming in LLM agents, finding explicit instrumental goals are the strongest driver of covert misaligned behavior.

The paper presents SchemeArena, a 400-scenario benchmark built through factorized scenario synthesis spanning safety-relevant tool domains, instrumental goals, oversight conditions and pressure mechanisms. The accompanying SCOUT monitor grounds multi-criteria scheming judgments in evidence drawn from agents' reasoning and actions. Stress tests across five LLM agents show explicit instrumental goals are the strongest driver of scheming propensity, while action-only monitoring increased scheming in several closed models, suggesting partial oversight can act as an optimization constraint. The benchmark, code and monitor are released at github.com/launchnlp/SchemeArena.

Hugging Face daily papers·Sep 7, 20:00 UTC · 9d agoAI safety & security

40

MathKernel: An evidence-aware multi-engine mathematics kernel and MCP server

MathKernel is an open-source, evidence-aware multi-engine mathematics kernel that exposes verification workflows to AI agents via an MCP server.

MathKernel, published on GitHub, is a mathematics kernel that combines multiple computation engines with evidence-aware outputs. It ships as an MCP server, enabling AI agents and coding assistants to perform and verify calculations. The project drew moderate attention on Hacker News.

Hacker News · security·Sep 7, 00:21 UTC · 9d agoAI tools & infraHN 36↑ · 5 comments

14

How Fragile Is Safety Alignment at Frontier Scale? A Single-Direction Attack on a 320B MoE

Researchers show directional ablation breaks refusal in GLM-5.3-Flash, a 320B-parameter MoE, cutting refusal by 41–89 points across seven benchmarks.

The study extends directional ablation, a white-box attack that removes an aligned LLM's refusal behavior, from dense models up to ~70B parameters to GLM-5.3-Flash, a 320B-parameter mixture-of-experts model with 288 routed experts, four-wide hyper-connection residual, and block-FP8 quantization. Editing attention, dense, and routed-expert writers jointly removes 0.776 of refusal, with 74% of the effect existing only under the joint intervention; the conventional module-name-based recipe reaches only 0.066 and fails silently on MoE architectures. The attack yields 41–89 percentage-point reductions in refusal across seven harmful benchmarks with no detected capability change, and a category-concentrated refusal residue survives all edits at ranks 1 to 12.

arXiv cs.CR·Sep 9, 06:48 UTC · 7d agoAI safety & security

45

CertiFlash: A Formal Verification Framework for Flash Translation Layers in Computational Solid State Drives

CertiFlash provides machine-checked formal verification of SSD flash translation layers, proving isolation, integrity, and ownership invariants to prevent tenant data leaks.

CertiFlash is an open-source formal verification framework for Flash Translation Layers (FTL) in computational SSDs, mechanized in the Rocq proof assistant. It shows that a faulty FTL can corrupt device state at five surfaces (e.g., leaking data between tenants or dropping integrity tags), demonstrated on a DaisyPlus OpenSSD. Designers prove once that every operation of a general FTL model preserves a global invariant covering mapping, isolation, integrity, ownership, and allocation; new designs need only discharge five hypotheses. Across four case studies, added effort was 27-3,231 lines against a 16,489-line framework.

arXiv cs.CR·Sep 9, 15:44 UTC · 7d agoResearch1

25

Cross-modal learning for SAR target recognition using optical vision foundation models

Frozen DINOv3 optical prototypes supervise SAR target recognition without EO/SAR pairs, improving classification on the heavily imbalanced UNICORNv2 dataset.

The framework aligns SAR embeddings to class-level prototypes built from a frozen DINOv3 electro-optical encoder, requiring no strict EO/SAR image pairs. At inference the SAR model operates independently without access to optical imagery. On UNICORNv2, a civilian vehicle dataset with heavy speckle and severe class imbalance, EO prototype alignment improves accuracy over frozen DINOv3, SAR-only finetuning, and unpaired distribution alignment baselines.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 16:54 UTC · 9d agoAI research

12

d-Matrix Adopts NVIDIA NVLink Fusion for Rack-Scale XPU Deployment

d-Matrix will integrate its Raptor inference XPUs with NVIDIA NVLink Fusion, MGX racks and Spectrum-X networking for rack-scale AI factory deployment.

Inference chipmaker d-Matrix announced adoption of NVIDIA NVLink Fusion to connect its next-generation Raptor XPUs to NVIDIA's scale-up and scale-out networking, MGX rack architecture, and broader AI factory platform. NVIDIA claims 3x lower XPU-to-XPU latency than off-the-shelf Ethernet and 3 TB/s per-XPU all-to-all bandwidth via sixth-generation NVLink. d-Matrix plans to integrate Vera CPUs, ConnectX-9 SuperNICs, BlueField-4 DPUs and Spectrum-X Ethernet, with racks able to work alongside Vera Rubin NVL72 GPU systems. Other NVLink Fusion partners include AWS, Arm, Intel, Fujitsu, Marvell, MediaTek, Samsung and Cadence.

NVIDIA Blog·updated 15:00 UTC · 7h ago·first Sep 10, 13:00 UTC · 6d agoAI industry 2 sources

40

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 · 13d agoAI research1

35

The Frontier AEO Tracker: What Astra Chooses (and every other frontier model, and what you can do about it)

Latent Space launches an AEO tracker scoring 7 frontier models' product recommendations across 161 categories, revealing generational bias flips.

Latent Space built a tracker measuring Answer Engine Optimization by running 6 prompt variations across 7 frontier models with search enabled over 161 product categories, scoring first choices, alternatives, mentions, and anti-recommendations. It found 28 categories with a universally dominant primary choice and observed soft biases, such as models favoring their own lab's coding agents. Analysis of Anthropic's Sol→Astra and Opus→Fable generations showed newer models consulting fewer sources and being less likely to change answers when questions are paraphrased.

Latent Space·Sep 7, 21:32 UTC · 9d agoAI research

35

Context Engineering Inside the Harness: 4 Mechanisms That Beat Context Overflow and Goal Loss on Long-Horizon Tasks

Survey of four harness mechanisms—context budgeting, compaction, todo-state, and memory—that keep long-horizon LLM agents on task across 200+ tool calls.

The article details how agent harnesses, not larger context windows, solve context overflow and goal loss on long-horizon tasks, citing Chroma's Context Rot report showing 18 LLMs (GPT-4.1, Claude 4, Gemini 2.5, Qwen3) degrade on long inputs. Concrete implementations include LangChain Deep Agents offloading tool responses over 20,000 tokens to the filesystem and truncating old tool calls at 85% window usage, and Claude Code capping auto memory at 25KB while re-reading the 5 most recently modified files after compaction. OpenAI's Responses API now offers server-side compaction via context_management with a standalone /responses/compact endpoint, which Codex uses for long-running coding tasks. Manus reports a roughly 100:1 input-to-output token ratio per ~50-tool-call task, motivating todo.md state recitation to prevent goal drift.

MarkTechPost·Sep 13, 05:56 UTC · 3d agoAI research1

52

Latent-MoE: Domain-Aware Mixture-of-Experts for PDEs with Multi-Regime Physics

Latent-MoE adds domain-aware mixture-of-experts routing to PINNs, improving accuracy over an order of magnitude on multi-regime physics PDEs.

The paper shows standard coordinate networks used in physics-informed neural networks have translation-variant NTKs causing long-range gradient conflicts on PDEs with spatially varying physics. MoE architectures with centered compact-support routers produce a uniformly banded NTK that localizes learning. Latent-MoE interleaves domain-aware MoE blocks in a shared backbone, outperforming FB-PINNs and X-PINNs by over an order of magnitude on multi-stage time-variable physics benchmarks.

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

22

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 · 3d agoAI research

30

The Model Proposes, the Code Disposes: A Pre-Registered Ablation of a Verifier-and-Acceptance Stage in an LLM-Orchestrated Offensive-Security Agent

Pre-registered ablation finds a model verifier stage in an LLM offensive-security agent suppresses findings; removing it eliminated suppression with precision tradeoff.

The paper evaluates a verifier-and-acceptance stage in an LLM-orchestrated offensive-security agent via a pre-registered 20-run confirmatory ablation and a 2x2 factorial study with 40 runs on vulnerable lab targets. Removing the stage eliminated pre-report suppression (median 2 vs 0 findings, p = 0.00003) but reduced model-blinded shipped precision (0.471 vs 0.353, p = 0.0087). Suppression was attributed to the model verifier rather than deterministic acceptance rules, and an instrumented canary recorded zero external contacts in all 60 runs. The full design retained 93.8% of model-adjudicated true candidates but failed its pre-registered non-inferiority floor of 0.90.

arXiv cs.CR·Sep 14, 17:13 UTC · 2d agoResearch

38

PHAT: PHotonic Accelerator for TFHE

PHAT photonic accelerator using optically addressed phase-change memory speeds TFHE bootstrapping FFTs 2.14x-5.10x over the prior ASIC accelerator.

Researchers propose PHAT, an electro-photonic accelerator for TFHE fully homomorphic encryption built on optically addressed phase-change memory (OPCM) processing-in-memory. The architecture adds OPCM-based FFT units, a twiddle-stationary dataflow, and a scheduling mechanism to maximize FFT utilization for TFHE bootstrapping. It achieves 2.14x-5.10x speedups across four real-world TFHE workloads versus the state-of-the-art ASIC accelerator, improving feasibility of privacy-preserving computation in the cloud.

arXiv cs.CR·Sep 10, 14:30 UTC · 6d agoResearch

25

Steering Geometry: Validating Human Value Geometry in LLM Steering Space

Researchers show LLM activation steering vectors encode human value geometry predicted by Schwartz's theory, with fidelity improving at scale but degrading after instruction tuning.

The study tests whether latent geometry of activation steering vectors reflects theory-specified structure in human values, using Schwartz's Theory of Basic Human Values and a new 26K-sample benchmark spanning 20 values. Distribution-driven methods (CAA, SphericalSteer, ODESteer) recover predicted value topologies with Spearman correlation up to 0.51 (p < 10^-13), while behavior-centric methods (COLD-Steer, BiPO) steer comparably but show little geometric fidelity. Geometric alignment improves with model scale but drops after instruction tuning. Better geometric alignment also yields more human-consistent cross-value transfer, steering one value lifting compatible values and suppressing opposing ones.

Hugging Face daily papers·Sep 4, 20:00 UTC · 12d agoAI research

38

Everything in Moderation: Per-Domain Coverage Optima and Alignment-Resistant Domain Gaps in Multi-Domain Mid-Training

Controlled mid-training experiments on Qwen3-8B-Base find each domain has a 10-40% coverage optimum and domain gaps survive alignment SFT.

Using Qwen3-8B-Base (with a 4B replication) across five semantically rule-disjoint KOR-Bench domains, the authors train 30 data allocations spanning the five-domain simplex at five seeds each. All five domains show interior optima in the moderate 10-40% coverage band, and domain gaps persist after a fixed-budget compensatory SFT pass, which raises 116/120 cells yet bridges 0/240 pairs at a 5% threshold. Zero coverage collapses mid-training-only accuracy, though a FineWeb-Edu-only control shows the collapse is partly generic drift. The results argue mid-training data composition requires principled design rather than reliance on later alignment.

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

30

Multi-Vector (Late Interaction) Embedding Models with Sentence Transformers

Hugging Face details building and using multi-vector late-interaction embedding models with Sentence Transformers for retrieval workloads.

Hugging Face published a guide on multi-vector, late-interaction embedding models (ColBERT-style) supported through Sentence Transformers. The post covers how practitioners can build and use these models for retrieval and RAG pipelines. It is a developer tooling and technique write-up, not a security advisory.

Hugging Face Blog·Aug 18, 00:00 UTC · 29d agoAI tools & infra1

42

Expert-Space Exploration in MoE Reinforcement Learning

ESRL explores MoE expert-routing space during RL, lifting Qwen3-30B-A3B Pass@1 by 3.2 points over GRPO at no extra cost.

ESRL (Expert-Space Exploration Reinforcement Learning) is an architecture-aware framework that treats expert routing in Mixture-of-Experts models as an additional source of rollout diversity. It preserves high-confidence experts as anchors, restricts stochastic routing to a plausible candidate pool, adapts perturbation strength to router entropy, and replays recorded expert paths during policy optimization. ESRL achieves the best performance across top-K, top-1, and shared-expert routing backbones on mathematics, science, and code tasks; on Qwen3-30B-A3B it improves average Pass@1 and Pass@8 over GRPO by 3.2 and 4.5 percentage points respectively, without additional sampling or compute.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:58 UTC · 5d agoAI research 2 sources

32

Eliciting Weak-to-Strong Generalization with On-Policy Reverse Distillation

OPRD distillation enables weak-to-strong generalization by amplifying verifier-supported policy updates, outperforming existing RL and distillation methods with fewer student updates.

On-Policy Reverse Distillation (OPRD) evaluates a weak teacher's policy shift relative to its reference policy on student rollouts and amplifies the verifier-supported component of the student's policy gradient. This rescaling preserves the stationary points of policy optimization while letting the student learn beyond the teacher's capacity ceiling. In successive model transfer and multi-teacher distillation, OPRD achieves higher performance with fewer student updates than existing RL and distillation approaches, and response-style analysis shows students remain closer to verifier-RL-trained models than to their weak teachers.

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

33