Category intelligence

Research Briefing

All 676 current items, analyzed and ranked.

Executive synthesis

Research Summary

Analysis complete. Top items selected by score.

Key Themes

AI Safety & Adversarial Attacks · 12AI Safety & Alignment · 12Language Models & Reasoning · 18LLM Training & Optimization · 8Deep Learning Theory & Optimization · 5LLM Inference Efficiency & KV Cache · 7LLM Reasoning & RLVR · 3Language Models and Reasoning · 6Autonomous Driving & World Models · 4Cognitive Science & Language Acquisition · 4

Primary evidence

All Ranked Signals

Showing 10 of 676 signals 2 remaining
Research arXiv (Artificial Intelligence) Apr 1

Trojan-Speak: Bypassing Constitutional Classifiers with No Jailbreak Tax via Adversarial Finetuning

By Bilgehan Sel, Xuanli He, Alwin Peng, Ming Jin, Jerry Wei

78 score
AI Analysis

Introduces Trojan-Speak, an adversarial fine-tuning method that bypasses Anthropic's Constitutional Classifiers with 99+% evasion while maintaining <5% capability degradation, compared to >25% in prior work. Uses curriculum learning and GRPO-based hybrid RL.

Source details
arXiv:2603.29038v1 Announce Type: cross Abstract: Fine-tuning APIs offered by major AI providers create new attack surfaces where adversaries can bypass safety measures through targeted fine-tuning. We introduce Trojan-Speak, an adversarial fine-tuning method that bypasses Anthropic's Constitutional Classifiers. Our approach uses curriculum learning combined with GRPO-based hybrid reinforcement learning to teach models a communication protocol that evades LLM-based content classification. Cruci
AI SafetyAdversarial AttacksAlignmentRed Teaming
Research arXiv (Artificial Intelligence) Apr 1

On the Mirage of Long-Range Dependency, with an Application to Integer Multiplication

By Zichao Wei

75 score
AI Analysis

Challenges the conventional understanding that integer multiplication is hard for neural networks due to long-range carry chain dependencies. Shows this is a 'mirage' of representation choice—a 2D outer-product grid collapses operations to 3x3 local neighborhoods, enabling a 321-parameter neural cellular automaton to achieve perfect length generalization up to 683x training range.

Source details
arXiv:2603.29069v1 Announce Type: cross Abstract: Integer multiplication has long been considered a hard problem for neural networks, with the difficulty widely attributed to the O(n) long-range dependency induced by carry chains. We argue that this diagnosis is wrong: long-range dependency is not an intrinsic property of multiplication, but a mirage produced by the choice of computational spacetime. We formalize the notion of mirage and provide a constructive proof: when two n-bit binary integ
Deep Learning TheoryNeural ArchitectureGeneralizationRepresentation Learning
Research arXiv (Artificial Intelligence) Apr 1

Aligned, Orthogonal or In-conflict: When can we safely optimize Chain-of-Thought?

By Max Kaufmann, David Lindner, Roland S. Zimmermann, and Rohin Shah

75 score
AI Analysis

Proposes a framework for predicting when CoT training will degrade monitorability. Models post-training as RL where reward decomposes into output-dependent and CoT-dependent terms, classifiable as aligned, orthogonal, or in-conflict.

Source details
arXiv:2603.30036v1 Announce Type: cross Abstract: Chain-of-Thought (CoT) monitoring, in which automated systems monitor the CoT of an LLM, is a promising approach for effectively overseeing AI systems. However, the extent to which a model's CoT helps us oversee the model - the monitorability of the CoT - can be affected by training, for instance by the model learning to hide important features of its reasoning. We propose and empirically validate a conceptual framework for predicting when and w
AI SafetyAlignmentChain-of-ThoughtInterpretability
Research arXiv (Artificial Intelligence) Apr 1

Theory of Mind and Self-Attributions of Mentality are Dissociable in LLMs

By Junsol Kim, Winnie Street, Roberta Rocca, Daine M. Korngiebel, Adam Waytz, James Evans, Geoff Keeling

72 score
AI Analysis

Investigates whether suppressing LLM self-attribution of mental states (via safety fine-tuning) degrades Theory of Mind capabilities. Finds these are behaviorally and mechanistically dissociable, but notes safety-tuned models under-attribute mind to non-human animals and suppress spiritual beliefs.

Source details
arXiv:2603.28925v1 Announce Type: cross Abstract: Safety fine-tuning in Large Language Models (LLMs) seeks to suppress potentially harmful forms of mind-attribution such as models asserting their own consciousness or claiming to experience emotions. We investigate whether suppressing mind-attribution tendencies degrades intimately related socio-cognitive abilities such as Theory of Mind (ToM). Through safety ablation and mechanistic analyses of representational similarity, we demonstrate that L
AI SafetyAlignmentTheory of MindLanguage Models
Research arXiv (Artificial Intelligence) Apr 1

From Density Matrices to Phase Transitions in Deep Learning: Spectral Early Warnings and Interpretability

By Max Hennick, Guillaume Corlouer

72 score
AI Analysis

Introduces the '2-datapoint reduced density matrix' from quantum chemistry to study phase transitions during deep learning training. Derives spectral heat capacity for early warning of phase transitions and participation ratio for measuring reorganization dimensionality.

Source details
arXiv:2603.29805v1 Announce Type: cross Abstract: A key problem in the modern study of AI is predicting and understanding emergent capabilities in models during training. Inspired by methods for studying reactions in quantum chemistry, we present the ``2-datapoint reduced density matrix". We show that this object provides a computationally efficient, unified observable of phase transitions during training. By tracking the eigenvalue statistics of the 2RDM over a sliding window, we derive two co
Training DynamicsEmergent CapabilitiesTheory of Deep LearningPhase Transitions
Research arXiv (Machine Learning) Apr 1

Strategic Candidacy in Generative AI Arenas

By Chris Hays, Rachel Li, Bailey Flanigan, Manish Raghavan

72 score
AI Analysis

Analyzes how AI model producers can game arena-style rankings (like Chatbot Arena) by submitting multiple model variants to artificially boost their top models' rankings. Establishes theoretical conditions for exploitation and proposes algorithmic solutions to make rankings manipulation-resistant.

Source details
arXiv:2603.26891v1 Announce Type: new Abstract: AI arenas, which rank generative models from pairwise preferences of users, are a popular method for measuring the relative performance of models in the course of their organic use. Because rankings are computed from noisy preferences, there is a concern that model producers can exploit this randomness by submitting many models (e.g., multiple variants of essentially the same model) and thereby artificially improve the rank of their top models. Th
AI EvaluationGame TheoryLLM Benchmarking
Research arXiv (Machine Learning) Apr 1

From Pixels to BFS: High Maze Accuracy Does Not Imply Visual Planning

By Alberto G. Rodriguez Salgado

70 score
AI Analysis

Continuing our coverage from yesterday, Introduces MazeBench (110 procedurally generated mazes) and reveals that multimodal models solve mazes by converting to text grids and enumerating paths (1,710-22,818 tokens) rather than genuine visual planning. GPT-5.4 solves 91% but fails on hard mazes.

Source details
arXiv:2603.26839v1 Announce Type: new Abstract: How do multimodal models solve visual spatial tasks -- through genuine planning, or through brute-force search in token space? We introduce \textsc{MazeBench}, a benchmark of 110 procedurally generated maze images across nine controlled groups, and evaluate 16 model configurations from OpenAI, Anthropic, Google, and Alibaba. GPT-5.4 solves 91\% and Gemini 3.1 Pro 79\%, but these scores are misleading: models typically translate images into text gr
Multimodal ReasoningVisual PlanningBenchmarkingLanguage Models
Research arXiv (Artificial Intelligence) Apr 1

The Model Says Walk: How Surface Heuristics Override Implicit Constraints in LLM Reasoning

By Yubo Li, Lu Zhang, Tianchong Jiang, Ramayya Krishnan, Rema Padman

68 score
AI Analysis

Shows that LLMs systematically fail when salient surface cues conflict with unstated feasibility constraints. Introduces the Heuristic Override Benchmark (HOB) with 500 instances demonstrating that no model exceeds 24% accuracy under strict evaluation, revealing fundamental reasoning limitations.

Source details
arXiv:2603.29025v1 Announce Type: cross Abstract: Large language models systematically fail when a salient surface cue conflicts with an unstated feasibility constraint. We study this through a diagnose-measure-bridge-treat framework. Causal-behavioral analysis of the ``car wash problem'' across six models reveals approximately context-independent sigmoid heuristics: the distance cue exerts 8.7 to 38 times more influence than the goal, and token-level attribution shows patterns more consistent
LLM ReasoningBenchmarksLanguage Models
Research arXiv (Artificial Intelligence) Apr 1

Generative AI in Action: Field Experimental Evidence from Alibaba's Customer Service Operations

By Xiao Ni, Yiwei Wang, Tianjun Feng, Lauren Xiaoyan Lu, Yitong Wang, Congyi Zhou

68 score
AI Analysis

Large-scale field experiment at Alibaba assessing generative AI assistant impact on customer service workers. Finds AI improves service speed but agents retain discretion to adopt, modify, or ignore suggestions.

Source details
arXiv:2603.29888v1 Announce Type: cross Abstract: In collaboration with Alibaba, this study leverages a large-scale field experiment to assess the impact of a generative AI assistant on worker performance in e-commerce after-sales service. Human agents providing digital chat support were randomly assigned with access to a gen AI assistant that offered two core functions: diagnosis of customer issues and solution proposals, presented as text messages. Agents retained discretion to adopt, modify,
AI DeploymentHuman-AI CollaborationField Experiments
Research arXiv (Artificial Intelligence) Apr 1

Tucker Attention: A generalization of approximate attention mechanisms

By Timon Klein, Jonas Kusch, Sebastian Sager, Stefan Schnake, Steffen Schotth\"ofer

68 score
AI Analysis

Proposes Tucker Attention as a generalized view of attention approximation methods (GQA, MLA), using Tucker decomposition to provide a unified framework for understanding and constructing parameter-efficient attention mechanisms.

Source details
arXiv:2603.30033v1 Announce Type: cross Abstract: The pursuit of reducing the memory footprint of the self-attention mechanism in multi-headed self attention (MHA) spawned a rich portfolio of methods, e.g., group-query attention (GQA) and multi-head latent attention (MLA). The methods leverage specialized low-rank factorizations across embedding dimensions or attention heads. From the point of view of classical low-rank approximation, these methods are unconventional and raise questions of whic
Attention MechanismsEfficient TransformersLanguage ModelsTheory