Automated AI newsroom

AI News

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

Live intelligence

Editor-selected AI developments

762 updates

Research Editor selected

Ask on Demand: Targeted Peer Communication for Parallel Agentic Systems

Researchers propose Ask on Demand (AOD), a communication framework that lets parallel LLM agents request targeted assistance from peers only when specific information needs arise. A lightweight gate trained on team outcomes decides when such requests are worthwhile. Experiments on AppWorld and WebShop show AOD improves task performance over independent execution while reducing inference cost compared to existing sharing methods.

Why it matters: Offers a practical, cost-efficient approach to multi-agent collaboration that adapts to agents' evolving information needs.

arxiv4d agoScore 85

multi-agent collaborationLLM agent communicationtargeted information sharing

Research Editor selected

From prediction error to sparse events: Biologically inspired signed-dyadic coding for Mandarin keyword spotting

The paper introduces Predictive Signed-Dyadic Coding (PG), a bio-inspired method that transmits events only when prediction residuals exceed a learned threshold, using signed power-of-two magnitudes. Applied to Mandarin keyword spotting, PG achieves 90.00% accuracy while reducing SRAM reads by 33.87% and inference cycles by 32.77%. The approach offers a hardware-friendly interface for low-power continuous speech processing and event-based sensory systems.

Why it matters: Provides a novel, biologically plausible method that significantly reduces computational cost for keyword spotting, valuable for edge and low-power AI applications.

arxiv4d agoScore 85

keyword spottingpredictive codingevent-based processing

Research Editor selected

Online Evidence-Containment Prediction over Text Spans under Distinct Queries

The paper formalizes Online Evidence-Containment Prediction (OECP) for nested text spans in evidence-grounded NLP systems. It shows that span containment corresponds to a triangular 2D product order, enabling distinct-query online isotonic regression with near-linear regret for multiple targets and optimal logarithmic regret for a single fixed target. Experiments on Natural Questions demonstrate deductive and learned gains, while the Expected Search-space Reduction (ESR) method localizes evidence with fewer verifier calls, outperforming selectors on SciFact, ERASER, and DPR hierarchies.

Why it matters: Provides a principled theoretical framework and practical method for efficient evidence verification in NLP, with strong empirical results and regret guarantees.

arxiv4d agoScore 88

evidence containmentonline isotonic regressionNLP verification

Research Editor selected

ProSearch: Benchmarking Multi-Constraint Protocol Retrieval in Experimental Science

ProSearch is a new benchmark designed to evaluate multi-constraint protocol retrieval in experimental science, featuring 1,515 queries across six domains. It incorporates realism, complexity, and diagnosticity with 3-5 explicit constraints per query. Experiments with 19 retrievers show the best achieves nDCG@10 of 0.290, improving to 0.474 with reranking, identifying joint constraint binding as a key bottleneck.

Why it matters: Provides a systematic testbed for evaluating scientific retrieval systems under realistic multi-constraint conditions, highlighting current limitations and guiding future improvements.

arxiv4d agoScore 85

ProSearchmulti-constraint retrievalexperimental science

Research Editor selected

Cross-Interface Authorization for AI Computer-Use Agents

The paper introduces a profile-bounded protocol for authorizing AI computer-use agents across graphical, command-line, API, script, and Model Context Protocol interfaces. It formalizes effect-bearing routes and durable sinks, using a prepare-commit mechanism with multi-point verification to prevent bypass and state tampering. Formal proofs establish resistance to route laundering and commit-time safety, while empirical evaluation with 3,464 traces and mutant testing confirms robustness.

Why it matters: Provides a formal security framework for AI agents operating across diverse interfaces, addressing a critical gap in authorization.

arxiv4d agoScore 85

AI agent securityauthorization protocolsformal methods

Research Editor selected

Distilling Knowledge from Search: Decoder Model Factory for Quantum LDPC Codes

The paper introduces GraphMP, a learning-based message-passing decoder for quantum low-density parity-check codes that generalizes across code families, sizes, error rates, and noise models without fine-tuning. It uses beam search guided by the decoder's predictions to refine error patterns, and a decoder model factory paradigm that distills knowledge from earlier decoding runs to train successive models. This approach enables continuous improvement and adaptation to evolving quantum hardware through a coupled quantum-classical architecture.

Why it matters: Presents a novel machine learning approach to quantum error correction that is scalable and adaptive, offering practical value for advancing quantum computing.

arxiv4d agoScore 88

quantum error correctionmachine learning for quantumdecoder model factory

Research Editor selected

scAnyOmics: Foundation-Model Distillation for Any-to-Any Completion of Multi-omics Virtual Cells

scAnyOmics is a generative framework that distills knowledge from a frozen single-cell foundation model into a multimodal student model, enabling cross-modal prediction and reconstruction of missing modalities from scRNA-seq, protein-marker measurements, and scATAC-seq. Evaluated on 690,880 cells from six studies, it outperforms baseline methods on held-out donor data. Applications include cell-type annotation, perturbation-response prediction, and biological age estimation.

Why it matters: Offers a concrete, validated method for integrating incomplete multi-omics data using foundation model distillation, with clear performance gains and practical applications.

arxiv4d agoScore 85

single-cell genomicsmulti-omics integrationfoundation models

Research Editor selected

When Safety Checks Become Privacy Risks: A Privacy-Preserving Paradigm for LLM Agent Safety Auditing

The paper proposes a privacy-preserving paradigm for safety auditing of LLM agents, separating audit computation from plaintext access and execution authority. It introduces SealCall, a framework combining learned audit representations with CKKS-based encrypted similarity computation, achieving a mean F1 score of 0.840 on 1,252 public binary candidates. Encrypted scoring completes in 0.176 seconds per operation, preserving plaintext audit decisions in all measured cases. This addresses the risk of exposing sensitive user data during external safety checks.

Why it matters: Offers a concrete, evaluated solution to a critical privacy issue in LLM agent auditing, with measurable performance metrics.

arxiv4d agoScore 85

LLM safetyprivacyhomomorphic encryption

Research Editor selected

CryoAtlas: A Large Curated Dataset and Unified Benchmark for Cryo-EM Atomic Model Building

CryoAtlas is a rigorously curated dataset and unified benchmark for density-guided atomic model building of protein chains from cryo-EM maps. It provides 17,809 map-model-sequence entries, including a curated training split, and a 618-target benchmark with a shared evaluation protocol assessing structural accuracy, model-to-map fit, and stereochemical validity. The benchmark is used to evaluate state-of-the-art learning-based methods against Phenix and AlphaFold3, and retraining the ModelAngelo CNN component on CryoAtlas improves performance. This resource offers an open, reproducible foundation for future cryo-EM atomic model building research.

Why it matters: Provides a large, high-quality dataset and standardized benchmark that addresses a critical gap in cryo-EM atomic model building, enabling reproducible evaluation and advancement of deep learning methods.

arxiv4d agoScore 90

cryo-electron microscopyprotein structure predictiondeep learning

Research Editor selected

SparseGDN: Chunk Sparse in Linear Attention

SparseGDN introduces a hardware-aware framework for Gated Delta Networks that reduces computation and memory traffic by combining structured intra-chunk approximation with input-dependent recurrent-event selection. Evaluated on Qwen3.5 models across context lengths up to 128K, it retains about 29% of recurrent events while achieving 1.50-1.94x prefill speedups over native FLA kernels.

Why it matters: Provides a practical method to accelerate long-context sequence modeling with linear attention, offering significant speedups without sacrificing output quality.

arxiv4d agoScore 85

efficient transformerssequence modelinghardware-aware algorithms

Research Editor selected

BlindToChange: AI Agents Fail to Proactively Search for Recent Events

A new benchmark, BlindToChange, reveals that AI agents often fail to proactively search for recent real-world events that affect their responses, even though they can find changes when explicitly asked. The benchmark uses requests where an obvious candidate is invalidated by a recent event, and shows a performance gap of up to 27.5 points when the event is not mentioned. Over half of failures stem from agents not directly verifying relevant facts. This work highlights a new axis for progress in agentic systems.

Why it matters: Provides a concrete, measurable benchmark exposing a critical blind spot in AI agent behavior, directly relevant to improving real-world reliability.

arxiv4d agoScore 85

AI agentsbenchmarkproactive information seeking

Research Editor selected

Evidence-Guided Recovery for AI Agents with Ambiguous Tool Outcomes and Partial Execution

A new arXiv paper introduces an evidence-guided framework for AI agents to recover from ambiguous tool outcomes and partial execution. The approach uses approved obligations, provider capabilities, and public evidence to determine safe completions, with a shared admissibility check and terminal certificate. In a study of 37 assignments, the method certified 28 completions, and a preregistered comparison across 58 paired units showed a 36.2-percentage-point advantage over evidence prompting.

Why it matters: Provides a concrete, formal method for improving AI agent reliability in real-world tool-use scenarios, with experimental validation.

arxiv4d agoScore 82

AI agent reliabilitytool outcome ambiguitytask recovery

Research Editor selected

EvoMCP: Co-evolving MCP agents and training data

EvoMCP is a framework that enables Model Context Protocol (MCP) agents to improve through a closed loop of task evolution, trajectory evolution, and supervised fine-tuning. It assesses the student's capabilities from rollout feedback, translates learning targets into executable tasks by adapting seed tasks, and uses reusable skills to recover failed teacher rollouts. Experiments on Toolathlon, MCPMark, and MCP-Atlas show absolute gains of 16.5%, 10.2%, and 12.6% respectively over the initial student.

Why it matters: Introduces a novel agent-data mutual evolution method that adapts training data to the student's evolving capabilities, addressing a key limitation of static supervised fine-tuning for MCP agents.

arxiv4d agoScore 88

Model Context Protocolagent trainingdata evolution

Research Editor selected

KEEPER: Learning Control-Sufficient Textual Memory for Long-Horizon LLM Agents

The paper introduces KEEPER, a framework that analyzes auxiliary objectives for recursive textual memory in LLM agents, identifying self-consistency bias where incorrect claims persist in memory. It compares four supervision targets and finds reward-related prediction achieves the highest task performance before and after offline reinforcement learning. A claim-level analysis reveals error persistence despite corrective observations, motivating evaluation of error persistence and valid-information retention alongside task outcomes.

Why it matters: Provides a concrete, recent research contribution addressing a critical failure mode in long-horizon LLM agent memory, with practical implications for agent reliability.

arxiv4d agoScore 85

LLM agentsmemory managementreinforcement learning

Research Editor selected

Sparse Text Diffusion under Dual Budgets: Context Connectivity and Expert Activation

The paper introduces DualBudget, a sparse text diffusion method that separately budgets attention graph edges and expert activations. It combines local, dilated, and global attention with conditional expert computation. Experiments show gains over baselines up to 16K context length with a 20% cost reduction, though performance degrades at longer lengths.

Why it matters: Provides a principled approach to balancing efficiency and quality in long-context diffusion models.

arxiv4d agoScore 85

sparse text diffusiondual budgetslong-context modeling

Research Editor selected

Specification-Guided Generation for Large Language Models

A new neuro-symbolic decoding framework enforces formal specifications during LLM generation, not just syntax. It offers a forward-only variant guaranteeing specification satisfaction and a backtracking variant that revises earlier choices to avoid forcing unsuitable values. The method is model-agnostic, requires no retraining, and reduces repeated inference compared to rejection sampling on configuration and constraint-solving benchmarks.

Why it matters: Introduces a practical, model-agnostic approach to enforce formal specifications in LLM outputs, improving reliability for structured generation tasks.

arxiv4d agoScore 88

large language modelsconstrained generationneuro-symbolic AI

Research Editor selected

ORION: An Outcome-Driven LLM Advisor for RL-Based Multi-Domain 6G Slice Placement

ORION introduces a hierarchical orchestrator that uses two LLM agents to translate service intents and generate abstract placement plans for 6G network slices across administrative domains. A cooperative multi-agent RL coordinator selects cross-domain partitions while per-domain agents handle function placement. The key innovation is an outcome-driven episodic memory that records network conditions, proposed plans, and verified feasibility outcomes, feeding successes and failures back to the planner. In controlled experiments, this memory improves admission rates by 4.6–11.5 percentage points over the same planner without memory.

Why it matters: Provides a concrete, measurable improvement in 6G network orchestration by combining LLM planning with RL and a novel outcome-driven memory mechanism.

arxiv4d agoScore 88

ORION6G slice placementoutcome-driven memory

Research Editor selected

Verify–Backtrack Loop: Structured Precondition Recovery for Long-Horizon Language Agents

The paper introduces the Verify–Backtrack Loop (VBL), a training-free extension of ReAct that uses a bounded goal stack and dual-horizon verification to diagnose and recover from precondition failures in long-horizon tasks. VBL jointly checks whether an active goal contributes to the terminal goal and whether it is feasible in the current state, then triggers explicit operations like Push, Pop, retry, or BacktrackTo. Evaluated on AppWorld, ALFWorld, and ScienceWorld with Qwen3.5-9B, GPT-4o, and DeepSeek-V3.2, VBL improves task success by up to 22.07 percentage points over ReAct, and ablations confirm that both verification and diagnosis are complementary.

Why it matters: Provides a structured, training-free method for improving failure recovery in language agents, with strong empirical gains across multiple benchmarks and backbones.

arxiv4d agoScore 88

language agentstask decompositionfailure recovery