Category intelligence

Research Briefing — June 9, 2026

1128 current items analyzed and ranked.

Executive synthesis

Research Summary

Today's research is anchored by a landmark, scientist-in-the-loop evaluation showing contemporary AI lacks the imagination to diverge or negate in science. Authors of 121,640 preprints judged LLM follow-up ideas from their own papers across 25,139 rating sets, exposing a creativity ceiling with major implications for autonomous research agents.

Safety and alignment dominate, spanning theory, attacks, and multilingual failures:

  • When Behavioral Safety Evaluation Fails formalizes the audit gap between behavioral and representation-level robustness, building dissociated models that pass safety tests yet remain internally unsafe.
  • A first large-scale multilingual sycophancy study benchmarks six models across 1.1 million instances, showing alignment degrades across languages and topics.
  • Hiding in Plain Floats transports prompt-injection payloads as structured float parameters, evading text-centric detectors.

Theory and foundations advance with an information-theoretic definition of open-ended learning (via the bit-equivalent metric) and Explaining Data Mixing Scaling Laws, which grounds empirical multi-domain mixing in Kaplan/Chinchilla-style theory.

Agents, scaling, and embodiment round out the set:

Key Themes

AI Safety · 16AI Safety & Alignment · 26Evaluation & Benchmarks · 16AI Safety and Alignment · 35LLM Agents · 12Agents · 28AI Safety and Security · 39Robotics & Embodied AI · 14Theory & Foundations · 6Reasoning & RL · 12

Primary evidence

Top Ranked Signals

Research arXiv (Artificial Intelligence) Jun 9

Contemporary AI lacks the imagination to diverge or negate in science

By Honglin Bao, Siyang Wu, Xiao Liu, Sida Li, Shiyun Cao, James A. Evans

80 score
AI Analysis

This large-scale study invited authors of 121,640 preprints to judge LLM-generated follow-up ideas from their own papers, collecting 25,139 rating sets from 6,749 scientists. It finds contemporary AI lacks imagination to diverge or negate in science, with non-reasoning LLMs collapsing into convention.

arXiv:2606.08251v1 Announce Type: cross Abstract: Bold projections that artificial intelligence will accelerate scientific discovery have raced ahead of evidence from working scientists, and the field still lacks large-scale, scientist-in-the-loop tests of these claims. Here we mount the largest such evaluation to date and map what AI cannot yet do for science. We invited authors of 121,640 recent preprints across biology, medicine, chemistry, and the social sciences to judge follow-up ideas th
AI for ScienceCreativityLanguage ModelsEvaluation
Research arXiv (Artificial Intelligence) Jun 9

When Behavioral Safety Evaluation Fails: A Representation-Level Perspective

By Enyi Jiang, Anders Gj{\o}lbye, Yibo Jacky Zhang, Sanmi Koyejo

74 score
AI Analysis

This work formalizes the audit gap between behavioral safety evaluations and representation-level robustness, constructing dissociated models that appear safe but remain vulnerable in latent space. It introduces intervention-based evaluation via harmful fine-tuning and latent perturbations.

arXiv:2606.08044v1 Announce Type: cross Abstract: Large Language Model (LLM) safety has often been evaluated at the behavior level, which provides limited evidence of internal robustness, as these evaluations target outputs rather than representation-level vulnerability under intervention. We formalize this discrepancy as the audit gap: the difference between behavioral safety and robustness under intervention. To study this gap, we construct dissociated models that preserve safe outward behavi
AI SafetyInterpretabilityAlignmentRobustness
Research arXiv (Artificial Intelligence) Jun 9

An Information-Theoretic Definition for Open-Ended Learning

By Wanqiao Xu, Yifan Zhu, Benjamin Van Roy

73 score
AI Analysis

This paper introduces an information-theoretic definition of open-ended learning based on the bit-equivalent, the information required to attain each reward level, defining open-endedness as linear growth in bit-equivalent. It shows classical bandits are not open-ended, constructs one that is, and provides an algorithm achieving open-ended learning.

arXiv:2606.08369v1 Announce Type: cross Abstract: A growing body of work points to the great promise of AI systems that can continually expand their capabilities as they operate in an open-ended environment. But yet there is no coherent definition of open-endedness or theory about how an agent ought to explore an open-ended environment. We introduce an information-theoretic definition based on a new concept -- the ${\textit bit-equivalent}$ -- which quantifies the information required to attain
Reinforcement LearningOpen-Ended LearningInformation TheoryTheory
Research arXiv (Artificial Intelligence) Jun 9

SWE-Marathon: Can Agents Autonomously Complete Ultra-Long-Horizon Software Work?

By Rishi Desai, Jesse Hu, Joan Cabezas, Neel Harsola, Pratyush Shukla, Roey Ben Chaim, Adnan El Assadi, Omkaar Mukund Kamath, Fenil Faldu, Prannay Hebbar, Jiankai Sun, Yiyuan Li, Pramod Srinivasan, Ishan Gupta, Christopher Settles, Daniel Wang, Derek Chen, Pranav Raja, Albert Liu, Marek \v{S}uppa, Nevasini Sasikumar, Luyang Kong, Erik Quintanilla, Xiangyi Li, Ivan Bercovich, Steven Dillmann

72 score
AI Analysis

SWE-Marathon is a benchmark of 20 ultra-long-horizon software engineering tasks, each with executable environments, reference solutions, and multi-layer verification, where logged agent attempts average over 27 million tokens. It targets measuring agent planning, long-context, and memory capabilities far beyond typical short-task benchmarks.

arXiv:2606.07682v1 Announce Type: cross Abstract: AI agents are increasingly expected to complete long-horizon workflows that require sustained progress over hours, millions of tokens, and complex environments. Yet current agent benchmarks largely evaluate short-form tasks, such as single pull requests, small tickets, or 5-10 minute exercises, limiting our ability to measure agents' capabilities in planning, long-context understanding, and memory use. We introduce SWE-Marathon, a benchmark of 2
AI AgentsBenchmarkingSoftware EngineeringLong-Horizon Reasoning
Research arXiv (Artificial Intelligence) Jun 9

Explaining Data Mixing Scaling Laws

By Rui Dai, Shuran Zheng

71 score
AI Analysis

This paper provides a theoretical framework explaining empirical data mixing scaling laws, extending Kaplan/Chinchilla perspectives to multi-domain settings. It identifies capacity competition and skill overlap as key factors governing domain losses under different data mixtures.

arXiv:2606.08167v1 Announce Type: cross Abstract: Recent research has established empirical scaling laws to predict model performance on multi-domain data mixtures. However, a theoretical understanding of these model loss behaviors remains absent. In this work, we propose a unified framework to explain the underlying mechanics of data mixing. Our approach extends theoretical perspectives originally developed for standard neural scaling laws (e.g., Kaplan and Chinchilla) to the multi-domain sett
Scaling LawsLanguage ModelsPretrainingTheory
Research arXiv (Artificial Intelligence) Jun 9

Hiding in Plain Floats: Steganographic Carriers for Indirect Prompt and Content Injection

By Mudit Sinha, Sanika Chavan

71 score
AI Analysis

This work demonstrates an indirect prompt-injection attack where payloads caught in plain text evade detectors when transported as structured float parameters and reconstructed as fragmented telemetry. Across 14,400 trials on three commercial LLM APIs, the float-array carrier preserves 94.3% leakage attack success under strong dual-layer text-classifier defenses.

arXiv:2606.08403v1 Announce Type: cross Abstract: Text-centered prompt-injection defenses assume that the malicious signal is visible in one of the inspected text views. We study a reproducible LLM01-style indirect prompt/content-injection failure mode where that assumption breaks: a payload caught in plain English slips past the same detector when it is transported as structured float parameters and reconstructed only as fragmented telemetry. Across 14,400 attacked real-model trials on three c
AI SecurityPrompt InjectionAdversarial AttacksAI Safety
Research arXiv (Artificial Intelligence) Jun 9

Sycophancy as a Multilingual Alignment Failure: How Safety Degrades Across Languages, Topics, and Models

By Arya Shah, Himanshu Beniwal, Mayank Singh, Chaklam Silpasuwanchai

71 score
AI Analysis

This paper presents the first large-scale multilingual study of LLM sycophancy, benchmarking six instruction-tuned models across 1.1 million instances spanning 38 languages and 33 topics. It finds a consistent resource-tier effect where sycophancy spikes in low-resource and zero-shot language settings, topic-agnostically.

arXiv:2606.08451v1 Announce Type: cross Abstract: Safety-aligned large language models often exhibit sycophancy, which is the tendency to affirm users' opinions regardless of factual accuracy. Although well-studied in English, its manifestation in other languages remains largely unexamined, leaving billions of non-English speakers potentially vulnerable to model-validated misinformation. We present the first large-scale, multi-model evaluation of cross-lingual sycophancy, benchmarking \textbf{s
SycophancyAlignmentMultilingual NLPAI Safety
Research arXiv (Artificial Intelligence) Jun 9

Scaling Participation in Modular AI Systems

By Shangbin Feng, Yike Wang, Weijia Shi, Luke Zettlemoyer, Yejin Choi, Yulia Tsvetkov

70 score
AI Analysis

This work proposes scaling participation, a paradigm where modular AI systems are built bottom-up from many small stakeholder-trained models that collaborate compositionally, reportedly outperforming monolithic LLMs by up to 15.4% across 15 tasks. It challenges centralized model development with a participatory alternative.

arXiv:2606.07812v1 Announce Type: new Abstract: Humanity is a mosaic of multifaceted talents and needs, and any truly intelligent AI must reflect that richness. Yet the LLMs used by all are built by the few -- a centralized market of monolithic AI models structurally ill-suited to capture the diversity of human knowledge, reasoning, and values. Here we introduce scaling participation, a new paradigm in which modular AI systems are built from the bottom up through the contributions of diverse st
Modular AILanguage ModelsParticipatory AI
Research arXiv (Artificial Intelligence) Jun 9

Ego-Pi: VLA Fine-Tuning for Ego-Centric Human and Robot Data

By Ji Woong Kim, Ke Wang, Zipeng Fu, Sirui Chen, Cong Zhao, Jeff Lai, Chelsea Finn

70 score
AI Analysis

Ego-Pi investigates fine-tuning VLA models (built on pi_0.5) across human and humanoid embodiments with dexterous hands, showing egocentric human data enables robots to learn new task semantics and compose skills without corresponding robot data. It addresses robotics data scarcity by leveraging easily-collected human demonstrations.

arXiv:2606.08107v1 Announce Type: cross Abstract: Robotics faces a fundamental challenge of data scarcity. Unlike language or vision research, there is no internet-scale dataset for robotic manipulation. A promising path forward is to leverage egocentric human data, which can be collected more easily, with greater breadth, and at a larger scale. Towards this end, we investigate key design choices for learning across human and humanoid embodiments equipped with dexterous five-finger hands, using
RoboticsVision-Language-ActionCross-Embodiment LearningImitation Learning
Research arXiv (Artificial Intelligence) Jun 9

Beyond Additivity: Causal Discovery in Location-Scale Noise Models with Hidden Variables

By Mariyam Khan, Shohei Shimizu, Thong Pham

70 score
AI Analysis

This paper proves identifiability for causal discovery in location-scale noise models with hidden variables, where causes modulate both mean and variance of effects. It establishes the first identifiability result for causally insufficient models beyond additive noise and provides a sound two-stage algorithm.

arXiv:2606.08196v1 Announce Type: cross Abstract: We study causal discovery from observational data when some variables are hidden and the data-generating process follows a location-scale noise model (LSNM). Existing methods that handle hidden confounders typically assume additive noise, but in practice, causes often modulate not just the mean but also the variance of their effects. We prove that acyclic directed mixed graphs (ADMGs) satisfying a bow-free condition are identifiable under LSNM w
Causal InferenceTheoryMachine Learning
Research arXiv (Artificial Intelligence) Jun 9

Sparrow: Sparse Rollout for Stable and Efficient Long-context RL of Large Language Models

By Yang Zhou, Ranajoy Sadhukhan, Zhaofeng Sun, Zhuoming Chen, Souvik Kundu, Saket Dingliwal, Sai Muralidhar Jayanthi, Aram Galstyan, Haizhong Zheng, Beidi Chen

70 score
AI Analysis

Sparrow accelerates long-context RL with verifiable rewards by using sparse attention during rollout generation, navigating the stability-efficiency tradeoff via analysis of sparse-to-dense actor-policy mismatch. It observes that most sparse tokens align with dense even under aggressive sparsity, enabling selective sparsification.

arXiv:2606.08446v1 Announce Type: cross Abstract: Despite being powerful, reinforcement learning with verifiable rewards (RLVR) induces extremely long COT, making it computationally expensive. Since RLVR per-step cost is dominated by long-context rollout generation, sparse attention offers a promising way to accelerate dense rollout. However, sparse rollouts require a delicate stability-efficiency tradeoff: overly aggressive sparsity causes collapse, while overly lenient sparsity gives insuffic
Reinforcement LearningEfficiencyLong-ContextLanguage Models
Research arXiv (Artificial Intelligence) Jun 9

Reinforcement Learning for Flow-Matching Policies with Density Transport

By Boshu Lei, Kostas Daniilidis, Antonio Loquercio

70 score
AI Analysis

RLDT is an online RL algorithm for fine-tuning flow-matching policies by viewing policy improvement as transport of action densities toward high-reward regions, constructing a transport field from a maximum-entropy objective using Stein Variational Gradient Descent. It avoids biased gradients and preserves multimodal modeling capacity unlike distillation approaches.

arXiv:2606.08602v1 Announce Type: cross Abstract: We present an online reinforcement learning (RL) algorithm for fine-tuning flow-matching policies in continuous-control problems. Our key insight is to view RL-based policy improvement as a transport of action densities towards regions of high reward, which naturally aligns with the transport formulation of flow matching models. Prior methods either approximate the current or optimal policy distribution or resort to distillation, which introduce
Reinforcement LearningFlow MatchingRoboticsContinuous Control