This paper proposes a conceptual framework for AI-driven scientific discovery by treating swarms of autonomous virtual laboratories as particles in a particle swarm optimization (PSO) system. Each virtual lab—comprising LLM-based agents for planning, experimentation, and review—operates as an independent research unit that interacts with others through citation-analogous voting mechanisms. The central idea is to simulate the emergent dynamics of real scientific communities (exploration-exploitation balance, paradigm formation, natural selection of ideas) without a central coordinator. The work matters because current single-agent systems like The AI Scientist may lack the diversity and error-correction mechanisms that make human science robust.

This paper addresses the fundamental problem that correlational sentiment analysis cannot distinguish genuine economic associations from spurious statistical artifacts in financial markets. The core contribution is a refutation-validated framework for aspect-based sentiment analysis that combines net-ratio sentiment scoring with four robustness tests—placebo, random common cause, subset stability, and bootstrap validation—to filter false discoveries in high-dimensional sentiment-return analysis. This matters because investment strategies built on spurious correlations can lead to systematic losses, and regulators increasingly demand explainable AI systems with auditable validation.

This paper introduces "silent commitment failure" — a phenomenon where instruction-tuned language models produce confident, incorrect outputs with no detectable pre-commitment warning signal — and proposes "governability" as a measurable property for AI agent safety. The core claim is that 2 of 3 instruction-following models evaluated exhibit zero-warning failure modes, with profound implications for autonomous agent deployment. The work distinguishes itself from hallucination studies by focusing on detectability before commitment rather than correctness of output, and presents empirical evidence that conflict-detection signals (the "authority band") are geometric properties fixed at pretraining rather than injectable through fine-tuning.

This paper tackles SAR (Synthetic Aperture Radar) automatic target recognition under coherent speckle noise. It proposes FSCE, a framework combining frequency-domain wavelet decomposition with spatial multi-scale convolutions in a shallow feature enhancement module (DSAF), guided by online knowledge distillation from a ResNet101 teacher. The work matters because SAR imagery suffers from unique multiplicative noise that obscures target features, yet the claimed improvements appear marginal on saturated benchmarks.

SafePilot addresses a critical gap in deploying Large Language Models (LLMs) for cyber-physical systems (CPS): LLM "hallucinations" can generate plausible-sounding but unsafe plans that violate safety constraints or temporal requirements. The authors propose a hierarchical neuro-symbolic framework that combines LLM planning with formal verification—using First-Order Logic (FOL) for attribute-based constraints and Linear Temporal Logic (LTL) for temporal constraints—to ensure plans satisfy specifications before execution.

This paper proposes Riemannian Foundation Model (RFM), a vision for unifying graph learning through Riemannian geometry rather than GNN message-passing or LLM serialization. The authors argue that graphs are discrete analogs of manifolds, and that concepts like vector bundles, curvature, and parallel transport provide the proper toolkit for universal graph modeling—enabling both structural inference and generation in a way that current Euclidean GNNs and tokenized LLMs cannot achieve.

Existing adversarial-example-based fingerprinting schemes rely on empirical heuristics to set the fingerprint-to-boundary distance, risking violations of either robustness or uniqueness. This paper proposes AnaFP, an analytical approach that derives theoretical lower and upper bounds $\tau_{\text{lower}} < \tau < \tau_{\text{upper}}$ on a stretch factor controlling this distance. By formalizing robustness and uniqueness constraints and employing surrogate model pools with quantile-based relaxation, AnaFP generates fingerprints with guaranteed properties, validated across CNNs, MLPs, and GNNs.

This paper tackles the lack of shared formalism for comparing hierarchical memory systems in language agents. It proposes a unifying theory based on three operators: extraction (α) that maps raw data to atomic units, coarsening (C = (π, ρ)) that partitions and summarizes units, and traversal (τ) that selects content under a token budget. The core insight is the self-sufficiency spectrum of representatives ρ, which constrains viable retrieval strategies—an observation the authors call the coarsening-traversal (C–T) coupling.

This paper addresses the challenge of efficient failure management in LLM-based Multi-Agent Systems (MASs). Existing approaches rely on expensive per-trace reasoning with large judge LLMs, which is slow and unstable. The core contribution is EAGER, a framework that uses unsupervised reasoning-scoped contrastive learning to encode intra-agent and inter-agent dynamics into embeddings, enabling real-time step-wise failure detection and reflexive mitigation guided by historical patterns rather than costly LLM inference.

The paper addresses multi-UAV coordination under intermittent communications by proposing a Spatio-Temporal Attention enhanced MADRL (STA-MADRL) framework. It combines delay-penalized rewards to incentivize information exchange with a prediction module that recovers missing state data using temporal and spatial attention mechanisms. The authors claim 75% throughput improvements over communication-limited baselines while achieving near-ideal performance without requiring real-time global state sharing.

Preference alignment typically requires expensive weight-updating training like RLHF or DPO, which lacks mechanistic interpretability. This paper proposes DSPA, an inference-time method that dynamically steers sparse autoencoder (SAE) features based on prompt content without modifying base-model weights. By computing a sparse conditional-difference map $\mathbf{A}$ from preference triples that links prompt features to generation-control features, DSPA edits only token-active latents during decoding. The method achieves competitive open-ended generation quality with up to $4.47\times$ fewer alignment-stage FLOPs than training-based alternatives, while offering direct auditability of which features are modified and revealing that preference directions are dominated by discourse and stylistic signals.

Collaborative multi-agent LLM systems struggle with credit assignment during RL training: shared terminal rewards obscure individual contributions, encouraging free-riding and high gradient variance. This paper introduces CCPO (Counterfactual Credit Policy Optimization), which estimates each agent's marginal contribution by contrasting actual team performance with counterfactual outcomes—simulating performance without that specific agent. The method targets efficient discrete generation for LLMs and demonstrates improved reasoning accuracy across mathematical and logical benchmarks.

Machine learning models on mobile devices spend 61-86% of execution time extracting features from user behavior logs rather than running inference. This paper introduces AutoFeature, a graph-based engine that eliminates redundant operations across features and consecutive executions using directed acyclic graph optimization and intelligent caching. Tested across five industrial services including TikTok and e-commerce platforms, it achieves 1.33×-4.53× end-to-end latency reduction without accuracy loss.

This paper introduces a scalable framework to measure institutional variation in solid-organ transplant patient education materials using retrieval-augmented generation (RAG). The authors ground 1,115 patient questions across 102 handbooks from 23 U.S. centers, then classify answer pairs into a five-label taxonomy (Absent, Consistent, Complementary, Divergent, Contradictory). The work exposes critical information gaps: 96.2% of question-handbook pairs miss relevant content, and 20.8% of non-absent pairs show clinically meaningful divergence, with reproductive health nearly absent (95.1%) across all materials.

Recursive self-improvement promises sustained capability growth but faces recursive drift—the compounding of errors when models train on self-generated outputs. This paper proposes Neuro-Symbolic Recursive Self-Alignment (NSRSA), which stabilizes iterative self-training by filtering training data through symbolic verification at the reasoning step level. The core claim is that eliminating lucky guesses (correct answers with flawed reasoning) prevents recursive collapse and enables sustained improvement over multiple iterations.

Discrete diffusion models have been limited to simplistic noising schemes like uniform corruption or masking, restricting their ability to leverage semantic structure in large vocabularies. This paper introduces GDDS (Generalized Discrete Diffusion from Snapshots), a framework supporting arbitrary continuous-time Markov chain noising processes via exact uniformization-based sampling and a tractable snapshot-level ELBO. The work achieves state-of-the-art results on large-scale language modeling tasks, claiming to surpass autoregressive baselines for the first time at this scale.

The paper addresses inefficiency in task-oriented dialogue systems that recompute answers via retrieval or generation each turn, even when answers are already derivable from prior state. It proposes framing safety certification as a computational primitive where the fixed-point closure $cl(A_t)$ contains all derivable capabilities, enabling a Certified Answer Store with Pre-Answer Blocks that eliminates redundant RAG calls through formal containment checks. This matters because it reduces mean RAG calls from 13.7 to 1.31 and latency from 18.8s to 340ms while eliminating unsafe cache hits that plague embedding-based approaches.

RoboAlign addresses the modality gap between high-level language reasoning and low-level robot control in Vision-Language-Action (VLA) models. The framework first uses supervised fine-tuning to teach a multimodal LLM to generate FAST action tokens through zero-shot chain-of-thought reasoning, then applies Group Relative Policy Optimization (GRPO) to refine reasoning based on token-level action accuracy. This matters because prior work showed that improving embodied reasoning via language supervision often fails to translate into better robot performance or even degrades it.

This paper develops a differential-geometric framework for shallow neural networks that treats predictor classes rather than raw parameters as the fundamental objects. By quotienting out permutation and scaling symmetries on a regular set $\Theta_{\mathrm{reg}}$, the authors define a function-induced metric $g_\theta$ and an effective Hessian that removes spurious curvature degeneracies along symmetry orbits. The work connects implicit bias to quotient-level geometry, with concrete analysis for quadratic-activation models where parameters map explicitly to symmetric matrices $Q(\theta)=\sum_{i=1}^m a_i w_i w_i^\top$.

KG-Hopper addresses Knowledge Base Question Answering (KBQA) by training compact 7B LLMs to perform multi-hop reasoning over Knowledge Graphs in a single inference round. Unlike sequential multi-step approaches that suffer from error cascades, it embeds the entire KG traversal process into a unified "thinking" stage using reinforcement learning. The core innovation is using GRPO (Group Relative Policy Optimization) with composite rewards to teach models to autonomously invoke retrieval tools via special tokens and reason across multiple hops without predefined pipelines.