Automated AI newsroom

AI News

High-signal AI developments, independently scored, summarized and organized for fast reading.

Live intelligence

Editor-selected AI developments

773 updates
Research Editor selected

DrawOffer: Evidence-Grounded Longitudinal User-State Modeling for Career Support

DrawOffer is a system that separates language-model observation extraction from deterministic inference over source-linked records to maintain uncertain ability estimates and revisable issues in career-support assistants. Evaluated on 102 fictional personas with 580 scored checkpoints, it passes 169/210 checkpoints on test personas with issue precision of 0.875 and recall of 0.636. Ablation studies show that removing answer-evidence requirements reduces passes and precision, highlighting the importance of evidence sufficiency. The work is an exploratory systems contribution with limitations in generalization and reproducibility.

Why it matters: Offers a concrete, evidence-grounded approach to improving reliability of AI career assistants, with clear evaluation metrics and ablation studies.

AI for career supportevidence-based reasoninglongitudinal user modeling
Research Editor selected

SelfImprove-Bench: Evaluating Generalization in Self-Improving Agents

SelfImprove-Bench is a new evaluation framework for recursively self-improving (RSI) agents, organizing tasks into three core capabilities—Exploring, Planning, Reasoning—using controllable game environments. It introduces a generalization ladder (G0–G4) to measure how well capability gains transfer beyond training conditions. Experiments show that existing RSI methods achieve inconsistent generalization across these levels, highlighting the need for more robust self-improvement strategies.

Why it matters: Provides a rigorous, standardized benchmark for measuring generalization in self-improving AI systems, a critical gap in current RSI research.

recursive self-improvementAI evaluationgeneralization
Research Editor selected

Analysing the Narrative Paradox through Formal Models and Properties in Interactive Narrative

This paper introduces a formal framework for modelling the narrative paradox—the tension between player autonomy and narrative control—in interactive narratives. It extends state-transition systems to represent player actions and system events, formalizing properties like player agency, EM controllability, author intent, and robustness. Quantitative indicators derived from simulated plans enable comparison of Experience Manager strategies, with a case study revealing trade-offs and compromise zones.

Why it matters: Provides a reusable, formal analysis framework for a core challenge in interactive narrative, enabling systematic comparison of management strategies.

interactive narrativenarrative paradoxformal modelling
Research Editor selected

OmniOPD: Stable On-Policy Distillation for Joint Audio-Video Generation

Researchers propose OmniOPD, a modality-wise on-policy distillation framework that stabilizes joint audio-video generation by addressing cross-modal interference and token imbalance. The method uses asymmetric noise scheduling to provide richer visual cues for the audio teacher, grouped multi-noise sampling to expand audio supervision, and timestep-wise importance weighting to stabilize training. Evaluations on JavisBench and VBench show that OmniOPD preserves audio quality while significantly enhancing video generation.

Why it matters: Presents a concrete technical solution to a known instability problem in multimodal generative AI, with clear methodology and benchmarks.

OmniOPDjoint audio-video generationon-policy distillation
Research Editor selected

Creating Hybrid Interactive Narrative Systems with LLM: From Formal Description to Evaluation

The paper introduces an LLM-based narrative platform where interchangeable Experience Managers operate over a shared symbolic world model of facts, operations, and goals. It defines four evaluation properties—player agency, EM controllability, author intent, and robustness—and compares three managers (open generation, Monte Carlo repair, autonomous characters) on a Little Red Riding Hood scenario. Results show no single manager dominates, providing a principled basis for selecting managers based on author priorities.

Why it matters: Provides a formal framework and comparative evaluation for hybrid LLM-based interactive narrative systems, directly useful for researchers and designers of narrative AI.

interactive narrativelarge language modelshybrid AI systems
Research Editor selected

Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment

Researchers introduce a reinforcement learning-based approximate dynamic programming method to optimize Walker-type satellite constellation deployment under uncertainties like launch failures and satellite malfunctions. The approach uses offline approximate value iteration with linear function approximation and action pruning to reduce computational demands. Preliminary results show lower expected costs and deployment times compared to a rolling-horizon baseline, demonstrating a novel application of approximate dynamic programming in space logistics.

Why it matters: Presents a concrete, novel RL application to a real-world space logistics problem with measurable improvements over baselines.

reinforcement learningspace logisticssatellite deployment
Research Editor selected

Predictive Safety Guardrails Do Not Always Make LLM Agents Safer

A systematic study of world-model-driven predictive safety guardrails for LLM agents finds that stronger prediction involvement does not guarantee safety gains and can reduce task completion while increasing inference cost. Predictions become unreliable over longer horizons, and safety gains can persist even under corrupted predictions, revealing a fundamental prediction-to-action gap. The findings challenge the assumption that predictive foresight alone reliably improves agent safety.

Why it matters: Provides critical empirical evidence that current predictive guardrails may not work as intended, informing future safety research.

LLM safetypredictive guardrailsworld models
Research Editor selected

SAGE: LLM-guided framework discovers hierarchical governing equations for community-structured network dynamics

Researchers introduce SAGE, a self-reflective LLM agent framework that discovers shared community-level governing laws and individual-specific dynamical variations from observational data on complex networks. The method iteratively identifies common structures, resolves residual dynamics, and adaptively expands its candidate library when needed. Tests on synthetic and real-world networks (mobile communication, brain electrophysiology, power grids, urban rail transit) show SAGE recovers compact, interpretable equations and outperforms baselines, even under incomplete observations.

Why it matters: Demonstrates a novel, practical use of LLM agents for automated scientific discovery in complex systems, with strong empirical validation.

complex network dynamicsLLM-guided scientific discoveryhierarchical modeling
Research Editor selected

RxnMiner: A Multimodal Agent for Structured Reaction Data Extraction from Chemistry Figures

RxnMiner is a multimodal agent that combines an expert-informed extraction procedure with a chemistry toolbox to recover structured reaction records from chemistry figures. It handles molecular recognition, shared-template evidence, substituent tables, product grids, and reconstruction of indirectly specified participants. The authors also introduce ChemRxn-Bench, containing 603 reaction figures and 8,547 manually annotated records. With Qwen3.8-Flash-Next as backbone, RxnMiner raises stereochemistry-aware reaction macro-F1 from 21.0% under direct prediction to 71.0%, versus 25.0% for the strongest existing extraction system, and produces 88,202 source-linked records from 10,107 figures without human intervention.

Why it matters: It presents a concrete multimodal extraction system and benchmark that could substantially reduce manual effort in building chemistry reaction datasets for AI models.

RxnMinerChemRxn-Benchchemical reaction extraction
Research Editor selected

Think with Skills: Pseudocode Planning Before Execution for Advanced Reasoners

The paper introduces Think with Skills, a method that trains reasoning models to convert relevant skill descriptions into task-specific pseudocode plans before execution. The pseudocode explicitly represents operations, conditions, intermediate results, and dependencies, bridging declarative skill descriptions and agent actions. Training combines supervised fine-tuning on tasks, skills, pseudocode plans, and execution trajectories with Group Relative Policy Optimization. On SkillsBench, the method raises task success from 35.0% to 62.0%.

Why it matters: It presents a concrete training approach that substantially improves how language-model agents proceduralize and coordinate expert-written skills.

LLM agentsplanningreasoning models
Research Editor selected

OmniQ and Residual Agents: A self-improving AI scientist for computational quantum research

The paper introduces OmniQ, a virtual research environment that converts published computational quantum science papers into executable reproduction tasks, and evaluates five agentic systems across 59 papers. It finds that current AI scientists frequently fail to reproduce published results due to a mismatch between paper content and agent requirements. The authors develop Residual Agents (RA), a quantum-tailored self-improving AI scientist that distills verified workflow repairs, boosting DeepSeek V4.1 Flash from 68% to 85% accuracy at one-third the cost of Claude Code with Opus 5.

Why it matters: Provides a concrete, reproducible framework and a cost-effective solution to the reproducibility gap in AI-driven scientific research, with clear performance benchmarks.

AI for sciencecomputational quantum researchautonomous discovery
Research Editor selected

CARE: Grounded Recursive Self-Improvement for Production Customer-Service Agents

The paper introduces CARE, a framework for recursive self-improvement (RSI) in production customer-service agents. It replaces a frontier proprietary model with an in-house mid-sized model that learns from its own failures after deployment. A 24/7 inspection process identifies failures, attributes them to model or component errors, and uses on-policy self-distillation with privileged diagnosis information to update the model. Candidates are validated via simulation tests and offline inspection before promotion, requiring parity with the deployed version and human approval.

Why it matters: Provides a concrete, technically detailed approach to continuous model improvement in production, addressing a practical challenge in deploying AI agents.

CARE frameworkrecursive self-improvementcustomer service AI
Research Editor selected

Math Foundation Formalization Agent: A General-Purpose Approach to Formalizing Mathematical Foundations

The paper introduces MFF-Agent, a general-purpose intelligent agent that combines large language models with the Rocq proof assistant to automate the formalization of mathematical theories. It handles task classification, tool-assisted execution, verification feedback, and state-based task management for generating and verifying formal proofs. Case studies across Morse-Kelley set theory, real numbers, propositional logic, and axiom of choice equivalences demonstrate its applicability to diverse foundational domains. The results show the feasibility of a unified operational framework while clarifying the gap toward a fully integrated mathematical foundation.

Why it matters: Offers a concrete, novel approach to automating mathematical formalization across multiple foundational domains, with practical case studies and clear insights into current limitations.

formal verificationlarge language modelsmathematical foundations
Research Editor selected

SpecOPD: Branch-Parallel On-Policy Distillation for Speculative Decoding

SpecOPD introduces a branch-parallel framework for on-policy distillation in speculative decoding, enabling draft models to be trained without sequential draft-and-verify rollouts. By packing independent branches into proposal trees and using tree masks, sparse attention, and indexed state replay, the method achieves up to 41.45% higher mean acceptance length and 16.09× supervised-token throughput over sequential-rollout OPD. Experiments across 8B to 125B parameter targets and multiple architectures show up to 3.56× generation speedup over autoregressive decoding.

Why it matters: Offers a concrete, high-impact technique to accelerate LLM inference, directly relevant to practitioners working on model deployment and efficiency.

speculative decodinglarge language model inferenceon-policy distillation
Research Editor selected

TLAPS-Bench: Benchmark for AI-Driven Formal Verification of Real-World Systems

TLAPS-Bench is a new benchmark and execution harness for using AI agents to construct machine-checked proofs of real-world system specifications in TLA+. It includes 265 proof targets from 95 specifications covering cache coherence, Byzantine consensus, and write-ahead logs. Frontier models like GPT-6.1 Sol proved 44.3% of a subset of 70 targets, revealing both progress and remaining challenges in end-to-end proof development.

Why it matters: Provides a concrete, reproducible benchmark for measuring AI capabilities in formal verification of complex systems, a key area for AI safety and reliability.

TLA+formal verificationAI for mathematics
Research Editor selected

Value-Conditioned Proposal Acquisition for Test-Time Reasoning

The paper introduces ValueFormation, a test-time policy that decides after each primary-model draw whether to stop, continue sampling, or acquire a proposal from a heterogeneous reasoning specialist. The policy uses a cost-regularized value scale learned from vote-state features, which is frozen across tasks and primary models. On MATH-500, a single Llama-fitted calibration improves accuracy by over 15 points for three 8B primaries and transfers to Qwen3-14B without retraining. Ablations show that removing acquisition drops accuracy by 20.43 points, confirming the benefit of state-conditioned acquisition over mere specialist access.

Why it matters: Provides a practical, transferable method for improving test-time reasoning with heterogeneous specialists, backed by strong empirical results on math and code benchmarks.

test-time reasoningLLM inferencevalue-conditioned acquisition
Research Editor selected

KAN vs. MLP Benchmark on Clinical Tabular Data Shows Trade-offs in Precision vs. Efficiency

A rigorous benchmark compares nine KAN variants against MLPs and Random Forest across seven medical datasets. Results show KANs (especially TabKAN and ReLUKAN) improve minority-class detection on imbalanced data but require 1.2x–1.48x longer inference and up to 12.5x more parameters. StandardMLP remains the efficiency Pareto frontier, while KANs are viable when precision on rare positive cases is the priority.

Why it matters: Provides the first large-scale, statistically rigorous comparison of KANs vs. MLPs on clinical tabular data, offering actionable guidance for practitioners.

Kolmogorov-Arnold NetworksMulti-Layer Perceptronsclinical tabular data
Research Editor selected

Integrating Domain Adaptation and Retrieval-Augmented Generation for Saline-Alkali Land Reclamation Planning

This paper presents Wenyao, an agricultural decision-support system that combines domain adaptation with retrieval-augmented generation for saline-alkali land reclamation planning. Using a bilingual corpus of 8,664 research papers and a QwQ-32B model fine-tuned via low-rank adaptation, the system achieves 95.83% accuracy on domain-specific multiple-choice questions and strong expert ratings. The study demonstrates complementary benefits of adaptation and retrieval in literature-informed planning.

Why it matters: Provides a concrete, rigorously evaluated example of combining domain adaptation and RAG for a specialized agricultural planning task.

domain adaptationretrieval-augmented generationagricultural AI