πŸ“„ Notable* Recent AI/ML arXiv Papers

Last updated just now...

πŸ“„ Reinforcement Learning-driven Diffusion Models: Language, Vision, and Beyond
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21539v1
πŸ‘₯ Authors: Zhiyuan Ma, Jiabao Wei, Tianyu Wang, Hanqing Wang, Jiadong Pan, Haowen Xu (possible past Tsinghua University affiliation), Liangliang Zhao, Ruixun Liu, Yuhan Wang (possible past Tencent (China) affiliation), Yuwei Zhang, Liang Feng, Junhao Xiao, Kaiyan Zhang, Xuekai Zhu, Daizong Liu, Biqing Qi, Yihao Liu, Ganqu Cui (possible past Tsinghua University affiliation), Ning Ding (possible past Tsinghua University affiliation), Linfeng Zhang, Jianjun Li, Kun He, Xiang Bai, Bowen Zhou
Abstract

Diffusion models (DMs) have steadily demonstrated outstanding performance in high-fidelity, controllable generation across diverse scenarios, following the "pretraining-finetuning" paradigm established in LLMs. Despite these advances, conventional DMs still face critical limitations in sophisticated reasoning, autonomous exploration of generation pathways, and adaptability to complex, human-aligned objectives. Inspired by RLHF's success in LLMs, RL has recently emerged as a pivotal post-training...

πŸ“„ Functional Subnetwork Localization for Efficient Continual Learning in Large Language Models
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21537v1
πŸ‘₯ Authors: Shuoran Jiang, Wentao Zhu (possible past Nvidia (United States) affiliation), Yang Xiang, Dongfeng Li, Yunan Zhang, Mengchen Zhao, Yuhui Guo, Kai Chen (possible past Shanghai Jiao Tong University affiliation), Youcheng Pan, Xiangping Wu, Qingcai Chen
Abstract

Biological intelligence continually adapts to new information while retaining prior skills through localized plasticity. In contrast, continual learning in large language models (LLMs) remains vulnerable to catastrophic forgetting. A promising direction is to identify functionally specialized subnetworks within LLMs that enable targeted and resource-efficient adaptation. Using gradient-attribution profiling, we localize cognition-associated functional subnetworks exhibiting extremely low mutual ...

πŸ“„ QREF: Improving DeepSearch Agents by Aligning Search with Reasoning via Query Refinement and Evidence Filtering
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21512v1
πŸ‘₯ Authors: Yujia Chen, Yuhui Wang, Junzhe Wang, Shihan Dou, Di Liang, Yujiong Shen, Yuhao Zhou, Zhiheng Xi, Ming Zhang (possible past Peking University affiliation), Senjie Jin, Jiayi Chen, Dingwei Zhu, Yajie Yang, Yuan Hua, Chenyao Lu, Tao Gui, Qi Zhang (possible past Tencent (China) affiliation), Xuanjing Huang
Abstract

DeepSearch agents achieve strong performance on complex information-seeking tasks through iterative search and reasoning. However, they often issue intent-misaligned, under-constrained, or redundant search queries, resulting in poor evidence coverage and accumulating retrieval noise. To mitigate these limitations, we propose QREF, a plug-and-play Query Refiner and Evidence Filter. Specifically, the Query Refiner rewrites search queries according to the current reasoning intent while ensuring com...

πŸ“„ MetaExp: Learning to Self-Improve through Experience via Verifiable Cross-Task Environment Scaling
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21492v1
πŸ‘₯ Authors: Renhao Li, Xinjie Shen, Yang Su, Jianhong Tu, Derek F. Wong (possible past Tencent (China) affiliation), Dayiheng Liu, Min Yang (possible past Baidu (China) affiliation)
Abstract

Language-model agents can accumulate interaction feedback, but reliably turning that feedback into reusable experience remains challenging. Existing methods either optimize external experience scaffolds or train experience-related behavior on specific task distributions, leaving open whether experience learning itself can become a transferable model capability. Training such a capability calls for supervision beyond isolated tasks, which mainly support in-episode problem solving rather than reve...

πŸ“„ Trajectory-Level Speculation with Semantic Verification for Tool-Using Agents
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21463v1
πŸ‘₯ Authors: Zilin Wang, Yinhong Liu, Chao Chen (possible past Tencent (China) affiliation), Qun Liu (possible past Huawei Technologies (China) affiliation), Zhijiang Guo
Abstract

Large language model agents solve tasks through long sequences of tool calls, and the prevailing design has a single strong model generate every step, although many steps are routine enough for a much smaller model. Existing ways of sharing this work keep the strong model as the generator: routers and collaborative agents decide which model handles each query or step, and speculative methods check a small model's drafts one step at a time, usually against the strong model's own action. We introd...

πŸ“„ Incentivizing Tool-Use Reinforcement Learning for Post-Arrival Emergency Care Prediction
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21449v1
πŸ‘₯ Authors: Pengfei Hu (possible past Tencent (China) affiliation), Chenwei Wu, Qiao Jin, Jun Deng, Zhiyong Lu, Liyue Shen (possible past Stanford University affiliation), Yue Ning
Abstract

Large language models (LLMs) can reason over both structured measurements and free-text records, which makes them attractive for emergency department (ED) prediction. However, most existing LLMs still fall short of conventional ML methods like trees on EHR-based prediction tasks. Our controlled analysis traces this gap to two weaknesses: LLMs do not select informative features, and they misjudge what numerical values imply for risk even when given the right features. We propose TIR-EC, a tool-in...

πŸ“„ Learning from Interaction Experience via Localized Context Distillation
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21427v1
πŸ‘₯ Authors: Zhezheng Hao, Yongkang Yang, Xilin Xia, Jiarui Yu, Yi Liu (possible past Google (United States) affiliation), Fanjunduo Wei, Peijie Dong, Tianfu Wang, Qiang Lin, Can Wang (possible past Tsinghua University affiliation), Hande Dong, Jiawei Chen (possible past Tencent (China) affiliation)
Abstract

Learning from interaction experience is essential for enabling large language models to continually improve during deployment. Context distillation offers a promising path: privileged information extracted from experience is provided to a teacher, whose behavior is then distilled into a student model that has no access to it. However, both existing forms of context distillation have limitations. Off-policy context distillation trains the student on teacher-generated trajectories and thus suffers...

πŸ“„ JevAgentHarness: Benchmarking, Deploying and Training Decision Models That Share Control with LLMs
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21412v1
πŸ‘₯ Authors: Kunlun Zhu, Tao Feng, Xu Han (possible past Tsinghua University affiliation), Heng Wang, Ling Yang, Xiangru Tang (possible past University Of Cambridge affiliation), Jiaxuan You, Heng Ji
Abstract

Large language model (LLM) agents now fix software, operate computers and serve customers, but their harnesses, the programs that run them, call a large LLM at every step, which makes long tasks slow and costly. Most of these calls end in a multiple-choice decision, such as which tool to call next. Decision models such as Jev answer these questions directly, at a fraction of an LLM call's time and price. We ask how a harness can delegate these decisions to a decision model with little loss of su...

πŸ“„ ARGUS: An Agenda-Driven Framework for Reliable User Simulation
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21346v1
πŸ‘₯ Authors: Hang Zheng, Nan Jiang (possible past Stanford University affiliation), Zichen Zhu, Zixu Yang, Zhiyang Tang, Shuai Fan, Lu Chen, Xiaobao Wu, Kai Yu (possible past Baidu (China) affiliation)
Abstract

High-fidelity user simulators are essential for evaluating and training agents in interactive environments. However, current LLM-based simulators struggle with reliability issues, such as goal omission and policy non-compliance. We propose ARGUS (Agenda-dRiven Goal-oriented User Simulator), a neuro-symbolic framework that maintains the user's goal state using a dynamic agenda stack manipulated via symbolic operations. By rigorously decoupling state tracking from natural language generation, ARGU...

πŸ“„ Mallea: Building, Steering, and Memorizing Worlds with Coding Agent
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21283v1
πŸ‘₯ Authors: Xuanyi Liu, Ruiqi Li (possible past Tsinghua University affiliation), Siwei Ma (possible past Peking University affiliation)
Abstract

Code world models represent world dynamics through explicit state and executable rules. We investigate how to coordinate object representations, behavioral revisions, and visual memory within this formulation. We present Mallea, a system for building, steering, and memorizing worlds from text. A coding agent infers object interaction requirements from the prompt and jointly plans object structure, properties, and rules, favoring compact representations that support those requirements. The world ...

πŸ“„ TRACER: A Multimodal Harness for Patient Care in Hospitals
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21266v1
πŸ‘₯ Authors: Zane Durante, Paul Tang, Keshigeyan Chandrasegaran, Amit Kaushal, Shrinidhi Kowshika Lakshmikanth, Feolu Kolawole, Yu Jun Zheng, Yifan Geng, Shobhit Agarwal, Kevin Schulman, Juan Carlos Niebles (possible past Stanford University affiliation), Ehsan Adeli, Arnold Milstein, Li Fei-Fei (possible past Stanford University affiliation)
Abstract

Continuous video and clinical records provide complementary information for understanding how patient behavior evolves over a hospital stay. A central challenge is how to represent behavior across the entire stay while preserving access to fine-grained visual and clinical evidence. We introduce TRACER, a training-free multimodal harness that constructs minute-level action records from video and combines them with clinical records into hourly reports. The harness equips an LLM agent with tools to...

πŸ“„ Planning Commitment of LLM under Partial Observability
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21108v1
πŸ‘₯ Authors: Cassie Huang, Zhanwei Cao, Yeawon Lee, Nathalia Gomez, Zhuoyi Yang, Ian G. Harris, Tiffany Do, Jiayuan Mao (possible past Tsinghua University affiliation), Li Zhang (possible past University Of Oxford affiliation)
Abstract

LLM-based planning agents commit to plans of different lengths before interacting with a partially observable environment. Some aggressively commit to a long plan based on assumptions about unobserved states, while others conservatively plan only over what they have observed. Both behaviors emerge implicitly in pre-trained models, whether the LLM outputs a plan directly or generates a PDDL formulation for a classical solver. Aggressive commitment risks costly failures, while conservative commitm...

πŸ“„ MemComposer: Learning to Assemble Memories for LLM Agents via Reinforcement Learning
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21091v1
πŸ‘₯ Authors: Yixuan Xie, Xueqiang Xu, Xinyi Fan, Xinxi Lyu, Tao Feng, Xing Fan, Chenlei Guo, Jie Hao (possible past Tencent (China) affiliation), Shaowen Wang, Jiashuo Sun, Jiawei Han (possible past Google (United States) affiliation)
Abstract

Agent memory enables large language model (LLM) agents to reuse past experiences without updating their parameters. However, semantic similarity alone does not guarantee memory usefulness: downstream performance depends on how memories are selected and presented to the agent. We propose MemComposer, a memory composer that jointly examines the current query and retrieved candidates to decide which experiences to include, how many to select, and how to order them. We train the composer using Exper...

πŸ“„ Probe-and-Resume: When and How to Evaluate Agent Execution
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21088v1
πŸ‘₯ Authors: Jiakai Xu, Tiancheng Ge, Tujie Guan, Yusheng Li, Rohan Timmaraju, Eugene Wu (possible past University Of California, Berkeley affiliation), Kostis Kaffes (possible past Stanford University affiliation)
Abstract

Test-time search can improve agent performance by exploring alternative actions and using a critic to select promising branches. We study this approach in terminal-based computer-use environments, which expose only a partial view of a large underlying state, and find that the Monte Carlo tree search (MCTS) configuration we evaluate does not significantly improve task success. We identify two sources of poor critic performance: the agent's observations omit environment state needed for evaluation...

πŸ“„ MAI-Gym: An Open All-in-One Platform for GUI Agent Evaluation and RL Training across Mobile and Computer Environments
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20939v1
πŸ‘₯ Authors: Panrong Tong, Quyu Kong, Pengxiang Li, Tianyu Xia, Hanzhang Zhou, Lei Wang (possible past Baidu (China) affiliation), Chenglin Cai, Long Li, Long Chen (possible past Tencent (China) affiliation), Jianan Zhang (possible past Google (United States) affiliation), Zhengwen Zeng, Xu Zhang (possible past Tencent (China) affiliation), Gongjie Zhang, Yue Wang, Steven Hoi
Abstract

Online reinforcement learning (RL) with verifiable rewards has driven rapid progress in mathematics, coding, and tool use, but scaling this success to GUI agents remains challenging due to the high cost of interactive environments and the scarcity of realistic training tasks. We introduce MAI-Gym, an open all-in-one platform that unifies GUI agent evaluation, data collection, and online RL training across mobile, computer, and web environments. Through a shared rollout pipeline, MAI-Gym ensures ...

πŸ“„ SkillNEO: Non-Elitist Evolutionary Optimization of Agent Skills
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20926v1
πŸ‘₯ Authors: Enze Ma, Chunyu Miao, Yankai Chen, Jie Yang (possible past Shanghai Jiao Tong University affiliation), Liancheng Fang, Kening Zheng, Hanrong Zhang, Muyao Xu, Xinle Yu, Chengze Li, Wei-Chieh Huang, Ziwei Ren, Yunhao Du, Zhixiang Shen, Xue Liu, Philip S. Yu (possible past Tsinghua University affiliation), Zhen Wang
Abstract

Agent skills turn procedural knowledge into reusable artifacts, allowing LLM agents to accumulate and refine expertise through experience. Building on this, skill evolution iteratively improves skills using execution feedback. However, improvement may require several interdependent edits, so low-reward versions can still be worth developing. Requiring immediate reward gains can discard useful partial repairs before their benefits emerge. Non-elitist evolution allows new versions to receive furth...

πŸ“„ Defining and Generating Compositional Structure
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20922v1
πŸ‘₯ Authors: Eric Elmoznino, Tejas Kasetty, Blaise AgΓΌera Y Arcas (possible past Google (United States) affiliation), Yoshua Bengio (possible past Mila - Quebec Artificial Intelligence Institute affiliation), Guillaume Lajoie
Abstract

Compositional structure is pervasive in nature and across scales: atoms combine into molecules, molecules into cells, and cells into organisms, while further compositional hierarchies appear within each level. More broadly, compositionality, the reuse and recombination of parts into novel structures, is a fundamental source of interesting complexity in both natural and artificial systems. Yet despite its importance, and despite our apparent ease in recognizing it, mathematical accounts capturing...

πŸ“„ SHRED: Self-Play for Heterogeneous Road-Users without Expert Demonstrations
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20866v1
πŸ‘₯ Authors: Wei-Jer Chang, Zhouchonghao Wu, Akshay Rangesh, Weixin Li, Masayoshi Tomizuka (possible past University Of California, Berkeley affiliation), Wei Zhan (possible past University Of California, Berkeley affiliation)
Abstract

Realistic traffic simulation and autonomous planning both depend on modeling interactions among heterogeneous road users whose dynamics, constraints, and behaviors differ fundamentally. Existing approaches predominantly learn realistic interaction behavior from large-scale human driving demonstrations. In this work, we ask whether such behavior can instead emerge purely through self-play. We present SHRED, a framework that jointly trains vehicles, pedestrians, and cyclists through large-scale he...

πŸ“„ ReasonUni: Reasoning-Augmented Reconstruction Advances Unified Multimodal Models
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20781v1
πŸ‘₯ Authors: Feize Wu, Zhiyuan Yan, Yuhuan Hong, Yuwei Niu, Zongjian Li, Zheyuan Liu, Bin Lin, Jinbo Yan, Jie Qin (possible past Inception Institute Of Artificial Intelligence affiliation), Xudong Mao, Limeng Qiao, Guanglu Wan, Li Yuan (possible past National University Of Singapore affiliation)
Abstract

Image-to-text (I2T) understanding and text-to-image (T2I) generation are dual tasks in unified multimodal models (UMMs). Reconstructive post-training couples these tasks, but existing reconstruction-based methods remain perception-centric and provide limited supervision for reasoning about structure, intent, and transformation. We propose ReasonUni, a reasoning-augmented reconstructive post-training framework that extends this coupling beyond perception. Given an original image and an editing in...

πŸ“„ Price of Anarchy of First-Price Auctions in Agentic Markets
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20587v1
πŸ‘₯ Authors: Shubhendu Trivedi, Jacob Eisenstein (possible past Meta (United States) affiliation), Alekh Agarwal, Ian Gemp, Michael Kaisers, Adam Fisch (possible past University Of Washington affiliation)
Abstract

An agentic market is a decentralized serving-time market where AI agents bid to claim each user prompt. An agent's bid is based on its expected value for the prompt, which is the expectation of the reward for its response minus its inference costs. First-price auctions (FPAs), in which the highest bidder pays its bid and receives the prompt, are a natural way to allocate prompts in such a market, since they are simple and transparent to run, and do not require central knowledge of private capabi...

πŸ“„ Player-1: Learning to Play from Synthetic Experience
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20584v1
πŸ‘₯ Authors: Mingyu Ouyang, Yiran Wang, Siyuan Hu, Xingyilang Yin, Huiqiang Sun, Guangzhi Wang, Junfu Pu, Cheng Cheng, Honghao Chen, Ying Shan (possible past Tencent (China) affiliation), Mike Zheng Shou (possible past National University Of Singapore affiliation), Hwee Tou Ng
Abstract

Computer-use agents have demonstrated strong capabilities in interpreting screens and executing keyboard and mouse actions. However, games, with their visually rich worlds and diverse mechanics, remain challenging and offer a demanding next step toward general digital control. Current game-agent learning pipelines often rely on large-scale demonstrations with limited coverage of dynamic game states, while scalable environments for interactive training remain difficult to obtain. We introduce Pla...

πŸ“„ Scaling Discovery Requires Forgetting
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20563v1
πŸ‘₯ Authors: Shangyin Tan, Ben Zhou, Lakshya A Agrawal, Jialin Zhang, Yilin Chen, Qiuyang Mang, Donghyun Lee, Dennis Jacob, Koushik Sen (possible past University Of California, Berkeley affiliation), Alex Dimakis, Matei Zaharia (possible past University Of California, Berkeley affiliation)
Abstract

Automated research with LLM agents has shown promising results in various domains. Through iterative refinement and scored verifiers, LLM agents are capable of discovering new ideas. There are different ways to scale automated research: let one agent iterate for longer, run several agents in parallel, or further let the parallel agents communicate and build on one another's candidates. However, we find that all three strategies eventually plateau as the agents accumulate history. Each agent beco...

πŸ“„ PrismaCoder: Pushing the Boundaries of Open Multimodal Code Intelligence through Decomposed Rubric Synthesis
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20538v1
πŸ‘₯ Authors: Qiushi Sun, Jingyang Gong, Yang Liu (possible past Tsinghua University affiliation), Qiaosheng Chen, Zhangyue Yin, Zixian Huang, Hanxu Hu, Jing Xiong, Fangzhi Xu, Haochen Tan, Haoli Bai, Lifeng Shang, Xiaoguang Li, Ben Kao, Qipeng Guo, Lingpeng Kong (possible past Google (United States) affiliation), Jiahui Gao
Abstract

Multimodal code intelligence connects the symbolic world of programs with the visual world their execution creates. Interest in this capability is burgeoning, as models are increasingly asked to produce charts, webpages, animations, and semi-structured documents. Recently, proprietary models have pushed far ahead, producing interactive artifacts even from a text description or a screenshot alone. Yet their data and training remain closed, and open progress is held back by the quantity and qualit...

πŸ“„ Counterfactual Neighborhood Risk Fields: Evidence-Grounded Selective Safety for Vision-Language Models
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20679v1
πŸ‘₯ Authors: Tianshi Wang, Jingsong Wang, Fengling Li, Jingjing Li (possible past Google (United States) affiliation), Xin Li (possible past Google (United States) affiliation), Lei Zhu
Abstract

Representation-based safety defenses for vision-language models (VLMs) often learn to separate harmful from benign inputs, but separation alone does not establish what a risk score means or when it should be trusted. We introduce Counterfactual Neighborhood Risk Fields (CNRF), an evidence-grounded framework for selective VLM safety. CNRF constructs context-matched benign-harmful counterfactual pairs, uses their representation differences as capability-related risk directions, and estimates neigh...

πŸ“„ Can Capability Enhancement be Localized?
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21294v1
πŸ‘₯ Authors: Anh Tuan Nguyen (possible past Nvidia (United States) affiliation), Anna Bair, Zico Kolter (possible past Carnegie Mellon University affiliation)
Abstract

Transformer-based language models have shown strong capabilities across many tasks and domains. However, prior work shows that, for a given task, not all attention heads matter equally. Specifically, they suggest that many \textit{redundant} heads can be safely removed with little-to-no effect, while a small set of \textit{important} heads, when ablated, severely damages the model's performance on the given task. In this work, we investigate a complementary aspect, called \textit{Capability Enha...

πŸ“„ Rethinking Learning from Label Proportions via Moment Matching
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21262v1
πŸ‘₯ Authors: Tianhao Ma, Wei Wang (possible past University Of Oxford affiliation), Yivan Zhang, Dong-Dong Wu, Takashi Ishida, Gang Niu (possible past Baidu (China) affiliation), Masashi Sugiyama
Abstract

Learning from label proportions (LLP) is a weakly supervised setting where training data are grouped into bags with only bag-level label proportions observed, and the goal is to learn a classifier that predicts labels for individual instances. Recently, a large body of methods has emerged; however, most of them rely on the assumption that instance-label pairs are sampled i.i.d. and randomly assembled into bags, an assumption often violated in real-world scenarios. Our experimental results indica...

πŸ“„ SHIP: Structured and Hierarchical Insight with Privacy
πŸ—“οΈ Published: 10/15/2026
πŸ”— http://arxiv.org/abs/2610.21048v1
πŸ‘₯ Authors: Kai Chen (possible past Shanghai Jiao Tong University affiliation), Guisi Ni, Albert Cheu, Kassem Fawaz, Yuzheng Hu, Ryan Mckenna, Peter Kairouz (possible past Google (United States) affiliation)
Abstract

Extracting insights from textual data while protecting user privacy is increasingly important. Existing methods produce private insights in diverse forms for different analytical purposes, making their utility difficult to assess and compare. In this work, we formulate differentially private (DP) insights as reusable representations for answering analytical queries, providing a common basis for utility assessment. Answering these queries, however, requires fine-grained details and cross-attribut...

πŸ“„ Can LLMs Anticipate Their Cruxes?
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.21006v1
πŸ‘₯ Authors: David Reber, James Reber, Ari Holtzman (possible past Allen Institute For Artificial Intelligence affiliation), Victor Veitch (possible past Google (United States) affiliation)
Abstract

To use language models to help us make decisions we would like to understand the rationale behind the language model's outputs. In principle, the language model provides its rationale as part of its text output. However, the sheer volume of text makes this hard to use in practice. In this paper, we are interested in extracting the cruxes that lead a model to recommend one action over another. We take a crux to be a sub-question that a model's rollouts disagree on, where changing its value may ha...

πŸ“„ A Phenomenology of Neural Geometry in Vision-Language-Action Models
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20840v1
πŸ‘₯ Authors: Mozes Jacobs, Aiden Swann, Mathilde Papillon, Siddharth Boppana, Fenil R. Doshi, Usha Bhalla, Thomas Icard, Matt Feiszli (possible past Meta (United States) affiliation), Thomas Mcgrath (possible past Google (United States) affiliation), Vasudev Shyam, Demba Ba, Leon Bergen, Nina Miolane, Owen Lewis, Jack Merullo, Ekdeep Singh Lubana, Atticus Geiger (possible past Stanford University affiliation), Matthew Kowal, Thomas Fel
Abstract

Robotic manipulation is inherently geometric, but what shape does the world take inside the policy that performs it? Prior work on vision-language-action (VLA) policies establishes that task-relevant variables are linearly readable from activations, yet readability certifies only that a variable is present and says nothing about the shape its values trace, which may be curved and multi-dimensional. Using controlled sweeps, natural rollouts, linear probes, and activation interventions, we build a...

πŸ“„ Purify Before You Align: Improving Representation Alignment for Diffusion Models
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20761v1
πŸ‘₯ Authors: Yingheng Wang, Yaoqiang Li, Yaqin Wu, Junwen Bai, Jiatao Gu (possible past Meta (United States) affiliation), Christopher De Sa, Volodymyr Kuleshov (possible past Stanford University affiliation)
Abstract

Representation alignment improves and accelerates diffusion training by encouraging intermediate features to match a pretrained visual encoder. However, standard alignment matches pretrained representations without distinguishing what information may be more useful for generation. We introduce local appearance purification (LAP), which improves generation quality and makes encoders such as MAE more effective alignment targets by removing locally predictable content and aligning to the residual. ...

πŸ“„ Generative Representation Learning for Scalable Latent Tokenization
πŸ—“οΈ Published: 10/14/2026
πŸ”— http://arxiv.org/abs/2610.20533v1
πŸ‘₯ Authors: Alan Baade, Kyle Sargent, Vincent Sitzmann (possible past Stanford University affiliation), Eric Ryan Chan, Justin Johnson (possible past Stanford University affiliation), Li Fei-Fei (possible past Stanford University affiliation), Gordon Wetzstein (possible past Stanford University affiliation)
Abstract

We introduce an approach for self-supervised representation learning designed to be used as a tokenizer for generative modeling. Our objective supervises a representation loss by factorizing the pointwise mutual information of the data, which we estimate by taking information differences between conditional predictions from a learned generative model. We justify our algorithm theoretically and empirically, demonstrating that our generative approach to representation learning avoids dimensional c...

*Notable papers are those with at least two authors from a "big" AI/ML lab.