📄 Notable* Recent AI/ML arXiv Papers

Last updated just now...

📄 OpenVLHarness: Real World Visual Agentic Tool-Use with Multimodal Memory
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26860v1
👥 Authors: Yu Zhou, Cheng-Fu Yang, Rui Sun, Di Wu, Sibo Peng, Mingyang Zhang (possible past Google (United States) affiliation), Zhen Yang (possible past Tsinghua University affiliation), Ruiyi Zhang, Nanyun Peng, Zhe Gan (possible past Microsoft (United States) affiliation), Kai-Wei Chang
Abstract

Multimodal large language models (MLLMs) have made rapid progress on visual reasoning, yet many tasks require evidence that is difficult to obtain through internal reasoning alone: our controlled study on 22 benchmarks shows that simply increasing the inference budget of the base model yields only modest gains. Such tasks demand grounded perception, external knowledge, and numerical measurements obtained through heterogeneous tools, whose outputs must be made interpretable to the model and retai...

📄 Where is Physical RSI capability from? An Observational Scaling Law of LLM-as-policy
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26848v1
👥 Authors: Zekai Li, Jiayi Yu, Jinlu Zhang, Luyang Niu, Zekun Qi, Jun Zheng, Xuchuan Chen, Dairu Liu, Yintianrun Zhang, He Wang (possible past Stanford University affiliation), Li Yi (possible past Stanford University affiliation)
Abstract

In this paper, we systematically investigate the mechanisms, scaling behavior, and generalization of physical Recursive self-improvement. We introduce PhysRSI-eval to quantify physical RSI through a five-axis metric: First-Attempt Performance, Efficiency, Success, Budget and Improvement from failure. Different VLMs are evaluated on 18 manipulation tasks under a fixed interaction budget. The analysis of experimental results motivates the Physical Barrel Hypothesis: different capabilities may cons...

📄 Train An Imaginative Agent
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26845v1
👥 Authors: Jiaxin Ge, Junyi Zhang, Tianning Chai, Hanjun Yoo, Chenyang Wang, Xiuyu Li, Weijia Shi, Xudong Wang, Sewon Min (possible past University Of Washington affiliation), Luke Zettlemoyer (possible past University Of Washington affiliation), Trevor Darrell (possible past University Of California, Berkeley affiliation), Haiwen Feng
Abstract

A seemingly reasonable push in Sokoban can make the puzzle unsolvable. To avoid such mistakes, an agent has to anticipate the consequences of its actions before execution, especially when feedback from the real environment is sparse or actions are irreversible. We introduce Agentic Imagination (Agima), a training framework that trains an agent to imagine before acting, i.e. to be imaginative. Agima trains a single omni model to propose actions, generate images of their outcomes, and then reason ...

📄 Agent World Model in the Wild: Computer-Use Agent Environment Synthesis
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26828v1
👥 Authors: Zhaoyang Wang, Qianhui Wu, Haorui Wang, Simon Yu, Baolin Peng, Canwen Xu, Hao Cheng (possible past Tencent (China) affiliation), Wenlin Yao, Boyi Liu, Yite Wang, Jianfeng Gao (possible past Microsoft (United States) affiliation), Huaxiu Yao
Abstract

Agent learning is shifting from learning from human data toward learning through interaction with the world. However, scaling such learning directly in real-world computer systems is challenging and can introduce substantial security risks. We therefore propose Agent World Model in the Wild (WildAWM), a scalable pipeline for synthesizing controllable environments and tasks for training general computer-use agents (CUAs). Whereas existing approaches typically specialize in a single agent interact...

📄 Next Best Action: Causal Constrained Offline RL for Business Action Targeting
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26817v1
👥 Authors: Surya Ramachandiran, Yiming Li (possible past Tsinghua University affiliation), Juan Mancilla-Caceres, Tao Ye, Jun Liu (possible past Tencent (China) affiliation)
Abstract

Next Best Action (NBA) systems must select among customer interventions (e.g., discounts, promotions, and lifecycle actions), maximize long-term economic value, satisfy complex operational constraints, and remain causally grounded. Existing approaches lack a rigorous framework for meeting these requirements jointly. We address this gap by formulating NBA as a Constrained Markov Decision Process (CMDP). We then integrate off-policy causal correction of the estimated customer dynamics directly int...

📄 Mise-en-Video: Fine-Grained 3D Control for Multi-Shot Video Generation
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26801v1
👥 Authors: Yingshuang Zou, Xiaoyu Shi, Yawen Luo, Ziang Li, Qinghe Wang, Mengfei Li, Chengfeng Zhao, Xintao Wang (possible past Tencent (China) affiliation), Pengfei Wan, Kun Gai, Yuan Liu (possible past Google (United States) affiliation)
Abstract

Recent advances in text-to-video generation have enabled high-fidelity single-shot synthesis, yet practical storytelling creation requires multi-shot videos with both strong inter-shot consistency and fine-grained controllability. Existing multi-shot video generation approaches achieve strong consistency but still fall short in controllability. In this paper, we propose Mise-en-Video (MeV), a highly controllable multi-shot video generation framework that allows video creators to conduct staging ...

📄 TokenGate: Adapting LLMs for Fast and Memory-Efficient Prefill with Learned Token Pruning
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26754v1
👥 Authors: Liana Patel, Rishabh Ranjan, Ion Stoica (possible past University Of California, Berkeley affiliation), Matei Zaharia (possible past University Of California, Berkeley affiliation), Carlos Guestrin
Abstract

Expert human readers process large inputs (e.g., code repositories and long documents) by skimming to closely read only what matters. On the other hand, language models process all input tokens through each model layer, resulting in significant processing costs for long-context inputs. We introduce TokenGate, a small, drop-in component that extends existing trained models to enable end-to-end learnable token pruning over long-context inputs for fast and memory-efficient prefill. To enable end-to...

📄 WhatIf-Bench: Benchmarking Intervention-Aware Time Series Forecasting
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26582v1
👥 Authors: Arjun Ashok, Mihir Parmar, Palash Goyal, Bhavana Dalvi Mishra (possible past Carnegie Mellon University affiliation), Chun-Liang Li, Irina Rish (possible past Deepmind (United Kingdom) affiliation), Alexandre Drouin, Jinsung Yoon (possible past Google (United States) affiliation), Tomas Pfister (possible past University Of Oxford affiliation)
Abstract

Recent time series foundation models (TSFMs) can consume covariates in-context, extending zero-shot forecasting to problems driven by external factors. This enables scenario analysis: forecasting how a target responds to events that set covariates to chosen future values. Whether they can do this reliably is an open question. We introduce WhatIf-Bench, a benchmark measuring how well forecasters use covariates to forecast a target's response to future events. WhatIf-Bench is semi-synthetic: time ...

📄 MCDA: Multi-View Graph Contrastive Learning with Dynamic Topology Augmentation for Functional MRI Analysis
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26322v1
👥 Authors: Hao Zhang (possible past Tencent (China) affiliation), Xiaoyun Liu, Shuo Huang, Yue Ma, Liang Cao, Mingxia Liu, Li Zhang (possible past University Of Oxford affiliation)
Abstract

Resting-state fMRI (rs-fMRI) is a vital non-invasive tool for diagnosing brain disorders and uncovering pathological mechanisms. However, existing graph contrastive learning (GCL) methods often underexploit augmentation histories across training epochs and the relationships among different augmented views. In this paper, we introduce a topology-guided Multi-view graph Contrastive learning framework with Dynamic graph topology Augmentation (MCDA) for fMRI analysis. Unlike traditional GCL that use...

📄 GeoEdit: Adversarial De-Evidencing for Silent Geoprivacy Protection via Image Editing
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26194v1
👥 Authors: Yu Yan, Shengjia Cheng, Fei Ma, Zhe Wang (possible past Deepmind (United Kingdom) affiliation), Peng Chen (possible past Tencent (China) affiliation)
Abstract

Recent efforts have demonstrated the strong capabilities of Multimodal Large Reasoning Models (MLRMs) in geographic reasoning. By jointly analyzing subtle visual cues, these models can infer the locations of photos, thus enabling doxing even by non-expert adversaries. Existing defense methods struggle to balance the shareability of photos with effective protection, and often fail to sufficiently disrupt the implicit geo-evidence chains embedded in scene semantics. To this end, we propose GeoEdit...

📄 Nash-MOPD: Optimizing Task Trade-offs in Multi-Teacher On-Policy Distillation
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26124v1
👥 Authors: Siyuan Gan, Bo Yang (possible past Tencent (China) affiliation), Linjian Meng, Boyan Wang, Xiaolong Qi, Jing Huo, Yang Gao (possible past Tencent (China) affiliation)
Abstract

Multi-teacher on-policy distillation (MOPD) aggregates the capabilities of multiple domain-expert teachers into a single student model. However, all domains in MOPD share the student's finite budget of optimization steps and rollouts. Fixed uses constant domain sampling ratios based on corpus sizes; by contrast, D$^3$-MOPD adjusts the ratios using the teacher-student reverse-KL divergence and its recent decrease. However, favoring large recent decreases can direct more training toward domains th...

📄 TimesJev: Thinking Fast on Time Series with System 1 Sufficiency
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26002v1
👥 Authors: Chenghao Liu, Wei Fan (possible past Tencent (China) affiliation), Jindong Han, Dongjie Wang, Aniket Mahanti, Pengyang Wang, Hao Liu (possible past Tencent (China) affiliation)
Abstract

Large language models (LLMs) have recently shown strong potential for time series reasoning, while models that reason over time series are usually with long chains of thought. However, this process often consumes thousands of tokens, directly leading to substantial latency during inference. In contrast, System 1 models such as Jev make decisions instantly and can naturally be an alternative, but raw time series are not compatible with the embedding space of these models, thus hindering the reaso...

📄 Auditor-Assisted Summary-Channel Verification for Hosted LLM Identity Substitution
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.25982v1
👥 Authors: Ziyi Zhang, Ziyao Wang, Guoheng Sun, Ang Li (possible past Google (United States) affiliation), Jian Li (possible past Tencent (China) affiliation)
Abstract

Hosted LLM services increasingly expose model identity as a product claim, but external users and auditors often cannot inspect which model configuration served a request. We study an auditor-assisted regime in which a trusted auditor enrolls claimed identities and prepares verification material before deployment, while audit-time verification uses only the claimed identity and released output, without runtime access to model internals, inference logs, routing decisions, or provider metadata. We...

📄 Behavioral Probes for Information Flow in LLM Swarms
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.25966v1
👥 Authors: Junhui Chen, Yu Zhang (possible past Google (United States) affiliation), Lantian Li, Dong Wang (possible past Tsinghua University affiliation)
Abstract

Most existing approaches to LLM swarm optimization are utility-driven, focusing on final task utility while leaving the processing, integration, and reliance of information within individual interactions largely implicit. To address this, we study LLM swarm interactions from an information-flow-based view and introduce behavioral probes to quantify information flow patterns. Specifically, we repurpose External Context Score (ECS) and Parametric Knowledge Score (PKS)---originally designed for hal...

📄 AdaExploreBench: Benchmarking LLM Agents for Proactive Exploration and Test-time Adaptation in Evolving Environments
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.25950v1
👥 Authors: Rui Wang (possible past Tencent (China) affiliation), Zishen Lai, Jiayu Liu, Cheng Qian, Jeonghwan Kim, Heng Wang, Xuejun Zhang, Jiateng Liu, Bingxuan Li, Shujin Wu, Qing Zong, Tianshi Zheng, Chunyang Li, Qihan Lin, Chen Li (possible past Tencent (China) affiliation), Dadi Guo, Xiusi Chen (possible past Peking University affiliation), Yangqiu Song (possible past Tsinghua University affiliation)
Abstract

Large Language Model (LLM) agents are increasingly deployed in unfamiliar and evolving environments, requiring them to proactively explore, understand, and adapt to environmental dynamics. However, existing benchmarks rarely test whether agents can proactively discover how an environment works and adapt as it evolves. To address this gap, we introduce AdaExploreBench, a benchmark for proactive exploration and test-time adaptation in evolving environments. By instantiating environmental dynamics ...

📄 Where RL Breaks: Localizing and Repairing Failures via Targeted Continued Pretraining
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.25836v1
👥 Authors: Xinyi Wang (possible past Carnegie Mellon University affiliation), Danqi Chen (possible past Stanford University affiliation)
Abstract

Reinforcement learning with verifiable rewards (RLVR) is widely used to improve reasoning in language models, yet growing evidence suggests that it mostly sharpens what the base model can already do. This raises a practical question: when RL fails, what is the base model missing? We look inside the RL policy's own rollouts and find that failures are localized: whether a rollout fails is strongly predicted by a small set of characteristic n-grams, ranging from reflection phrases such as "let's re...

📄 Cognitively Decoupled Meta-Induction for Out-of-Distribution Generalization
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.25749v1
👥 Authors: Yuqian Wang, Yuanzheng Wang (possible past Baidu (China) affiliation), Chaojun Xiao, Ke Xu, Bingxiang He, Jinghan Tan, Zijun Chen (possible past Google (United States) affiliation), Lu Chen, Yi-Xin Huo, Maosong Sun (possible past Tsinghua University affiliation)
Abstract

In-context learning (ICL) tackles downstream tasks conditioned on demonstrations. This paradigm relies heavily on neighbor-based matching between queries and demonstrations, limiting out-of-distribution (OOD) performance. For better generalization, rule-based inductive reasoning derives task-level regularities, which we term task-level inductive representations (TIR), before directly answering. However, existing methods lack generalizable inductive ability across diverse tasks. Inspired by meta-...

📄 Text-to-Image Generative Modeling Without Language Pretraining
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26863v1
👥 Authors: Keshigeyan Chandrasegaran, Yue Zhao, Armin W. Thomas, Ehsan Adeli, Jiajun Wu (possible past Massachusetts Institute Of Technology affiliation), Juan Carlos Niebles (possible past Stanford University affiliation), Li Fei-Fei (possible past Stanford University affiliation), Michael Poli
Abstract

Modern text-to-image (T2I) systems use internet-scale language pretraining for text-conditioned image generation. We ask whether language pretraining is necessary for strong T2I generation. We introduce Halcyon, a family of early-fusion multimodal autoregressive models pretrained entirely from scratch on GPIC, a dataset of 100M image-text pairs. Halcyon-0.52B outperforms LlamaGen-XL/8 (48.0 vs. 63.3 gFD) with 18.2$\times$ less pretraining compute. Further, Halcyon-1.6B outperforms JiT-T2I-XXL/8+...

📄 MemT-1.0: Towards Memory-Native Evolution
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26825v1
👥 Authors: Zhiyu Li, Zeyu Zhang, Linyun Liu, Yiwei Bu, Chenyang Xi, Xichong Zhang, Yi Yu, Yu Yu, Zhichen Liu, Yuxiao Yi, Chunyu Li, Haoran Liu, Zhenkai Ding, Le Zhou, Juncheng Zhang, Boyu Chen, Zehao Lin, Guorui Li, Renyu Fu, Ji Li, Youyang Xia, Jiajun Shen, Harvey Li, Jingsong Zhou, Helan Hu, Tong Shen, Tianxiao Xu, Chenye Han, Weijie Li, Zhongquan Zhou, Hongming Xu, Yuekeng Li, Erenkai Zhu, Peng Yu, Wenhao Li, Jingyi Kang, Xixuan Hao, Xuzhou Zhu, Can Chen, Jiawei Liu, Chen Jiang, Tao Jiang (possible past Alibaba Group (China) affiliation), Fangwei Xiang, Zepeng Yao, Kai Chen (possible past Shanghai Jiao Tong University affiliation), Guang Yang, Mingfei Lu, Chunhui Li, Zhengxuan Jiang, Bo Tang, Shiyu Zhan, Yihang Sun, Jie Chu, Wenjun Xiong, Zhenxiang Hua, Chen Lin, Detong Su, Dongyu Deng, Qiuping Ding, Guofeng Ding, Si Chen, Guohua Wen, Xu Chen (possible past Tencent (China) affiliation), Zhi-Qin John Xu, Ying-Cong Chen, Ningyu Zhang (possible past Tencent (China) affiliation), Haofen Wang, Muning Wen, Haotian Chen, Wentao Zhang (possible past Mila - Quebec Artificial Intelligence Institute affiliation), Xuanhe Zhou, Rita Zhang, Junchi Yan (possible past Shanghai Jiao Tong University affiliation), Feiyu Xiong
Abstract

Memory-native evolution requires making memory an intrinsic capability of foundation models, enabling them to continuously accumulate and utilize information. To this end, we introduce MemT-1.0, a new architecture of memory foundation models that internalize memory as part of model computation. Building on Metis, MemT-1.0 employs Gated DeltaNet-2 with a stable token-level memory update mechanism within each turn. We further introduce Mixture-of-Storage to scale native memory capacity. Following ...

📄 Which Model for Which Role? Cost-Efficient Pareto Recommendation for LLM Agentic Workflows
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26676v1
👥 Authors: Qian Xie, Wenyue Hua, Yueli He, Sripad Karne, Armaan Agrawal, Nikos Pagonas, Eugene Wu (possible past University Of California, Berkeley affiliation), Kostis Kaffes (possible past Stanford University affiliation), Tianyi Peng, Nairen Cao
Abstract

LLM agentic workflows increasingly employ different models for specialized roles. Users may prefer different trade-offs between task quality and deployment cost, sometimes also considering latency. Finding good assignments incurs a separate search cost from evaluating multiple candidates. We introduce Cost-Coupled Gittins (CC-Gittins), a multi-objective extension of single-objective cost-aware Gittins search for Pareto recommendation. It exploits the coupling between evaluation and deployment co...

📄 LeakBench: Auditing Reward Hacking through Prediction-Time Leakage in Clinical Modeling Agents
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26088v1
👥 Authors: Xiaoyuan Bao, Jingsi Jiang, Jiao Shan, Yulong Cao, Haoyu Wang (possible past Tencent (China) affiliation), Zida Liu, Jun Gao (possible past Nvidia (United States) affiliation)
Abstract

Autonomous clinical-modeling agents can optimize predictive performance while violating conditions that make a model usable. We introduce LeakBench, an executable, guideline-derived audit suite that tests agent decisions for prediction-time leakage, calibration, site-level evaluation, support awareness, and decision-curve net benefit. LeakBench combines a synthetic task with known failure structure and two real-data settings: MIMIC-IV (430k admissions) and governed multi-hospital inpatient recor...

📄 Truncate or Not? A Scaling Study of Looped Transformers with Truncated Backpropagation
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26030v1
👥 Authors: Xuyuan Xiong, Siyu Chen, Zihan Shao, Yue Su, Weiyang Jin, Ping Luo (possible past Shanghai Artificial Intelligence Laboratory affiliation), Zhuoran Yang, Xihui Liu (possible past University Of California, Berkeley affiliation)
Abstract

Looped transformers reuse a shared block of layers to increase computational depth without increasing the number of trainable parameters. They are trained with backpropagation through time (BPTT). To save training compute, BPTT is often truncated to the last few loops, although this may weaken the benefit of looping. To study this tradeoff systematically, we jointly vary model size, training tokens, and forward and backward loop counts across nearly 600 training runs and fit a unified scaling la...

📄 ProtGlycanDock: Towards Accurate Protein-Glycan Docking with Tailored Dataset, Benchmark and Model
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.26009v1
👥 Authors: Minghao Xu (possible past Shanghai Jiao Tong University affiliation), Jiaze Song, Jinyu Wang, Wentao Zhang (possible past Mila - Quebec Artificial Intelligence Institute affiliation)
Abstract

Performing accurate protein-glycan docking is critical to understanding protein-glycan interactions which govern many biological processes. However, this important task is hampered by the lack of tailored datasets, benchmarks and models for protein-glycan docking. To fill this blank, we first curate a standard benchmark ProtGlycanDock for training and evaluating protein-glycan docking models under both protein and glycan generalization settings. On this benchmark, we evaluate ten models in three...

📄 TempoMoE: Identifying and Steering Fast-Slow Thinking Experts for Efficient Multimodal Reasoning
🗓️ Published: 10/19/2026
🔗 http://arxiv.org/abs/2610.25999v1
👥 Authors: Xiyue Zhang, Keru Zhou, Ziyi Wang, Bing Hu (possible past Meta (United States) affiliation), Li Wang (possible past Tesla (United States) affiliation)
Abstract

Multimodal Mixture-of-Experts (MoE) reasoning models rely on long chain-of-thought (CoT) for complex tasks, yet often overthink easy inputs, increasing token cost and latency, and sometimes degrading accuracy. Existing methods optimize reasoning length during training or impose external control at inference, but leave the underlying reasoning mechanism a black box. We find that fast and slow thinking exhibit distinct expert-routing patterns: holding the input fixed and varying only the prompted ...

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