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

Last updated just now...

πŸ“„ FrontierPhysics: Evaluating Agents for End-to-End Physics Research
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06910v1
πŸ‘₯ Authors: Bingran You, Wenjun Ke, Ria Rosenauer, Bo Liu (possible past Meta (United States) affiliation), Wenbo Chen, Min Chen, Shuqi Xu, Yue Ma, Jiechao Feng, Bo Chen (possible past Tencent (China) affiliation), Xiangkai Sun, Jiarui Liu, Jinen Guo, Zeyu Zhou, Xu Huang, Zhuohan Li, Haoyu Li, Heguang Lin, Lijie Ding, Yadong Zeng, Kangqi Zhang, Xinge Liu, Hanwen Liu, Zhenghong Li, Alexander Von Recum, Yuchen Zhu, Felix Schwarzfischer, Yizhou Zhao, Jicheng Wang, Binxu Li, Qian Yu (possible past Google (United States) affiliation), Chan Li, Cheng Dai, Di Wang, Haoyu Zhang, Jiankai Sun, Kaituo Feng, Mian Qin, Ruihong Yin, Yiqun Luo, Weiwei Wu, Shihong Pan, Tsung Yeh Hsieh, Xiao Huang, Yan Zhang, Sihan Li, Zirui Ren, Zengji Tu, Kyoung Whan Choe, Ke Sun, Vincenzo Galia, Vaisakhi Mishra, Jiashu He, Hongyang Wang, Zhiheng Yang, Shubham Gaur, Yifan Gu, Shuyi Wang, Zihao Zuo, Steven Dillmann, Yiyou Sun, Xinyang Han, Hanchung Lee, Molei Tao, Yue Zhao, Shilong Liu, Yuchen Wu (possible past Google (United States) affiliation), Xuandong Zhao, Xiangyi Li, Florian Brand, Gerbrand Ceder, Hartmut Haeffner
Abstract

AI agents are playing an increasingly important role in physics research. However, existing physics benchmarks only evaluate fixed questions, isolated sub-tasks, or paper reproduction with given solutions, and rarely check research quality alongside correctness. We introduce FrontierPhysics, an end-to-end benchmark with 56 tasks made by 42 physicists based on their own research, covering nine domains across theoretical, computational, and experimental physics. Each task requires agents to review...

πŸ“„ Perceptive Humanoid Motion from Simulation
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06908v1
πŸ‘₯ Authors: Siyuan Hu, Abulikemu Abuduweili (possible past Baidu (China) affiliation), Yue Meng, Shipeng Liu, Quentin Leboutet, Chen Chen (possible past Tencent (China) affiliation), Matthias MΓΌller, Vladlen Koltun
Abstract

Humanoid robots have the potential to automate a wide range of physical tasks. Progress toward generalist humanoid autonomy, however, remains constrained by a data bottleneck: mapping pixels and free-form language to low-level joint commands requires paired supervision, and no corpus of such data exists at sufficiently large scale. Some approaches rely on human teleoperation and wearable capture devices, which require at least an hour of human time to produce an hour of data. We present HALO, a ...

πŸ“„ LifeVal: Evaluating AI Model Performance on Personalized Agentic Consumer Tasks
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06687v1
πŸ‘₯ Authors: Jenny Yang, Elizabeth Proehl, Anjan Bharadwaj, Emily Fan, Charlotte Cole, James Kim, Noam Brown (possible past Meta (United States) affiliation), Phoebe Thacker, Amelia Glaese (possible past Deepmind (United Kingdom) affiliation), Tejal Patwardhan
Abstract

We introduce LifeVal, a benchmark evaluating AI model performance on personalized agentic consumer tasks. LifeVal covers the most valuable life tasks that a personalized digital superassistant could automate, representing over 1.7 trillion US dollars in annual willingness-to-pay across 148 consumer task categories (e.g., managing finances, moving apartments, searching for a job, finding childcare). To construct our activity distribution, we conducted a new survey of willingness-to-pay for a digi...

πŸ“„ Interactive World Simulation with Cosmos for Physical AI
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06627v1
πŸ‘₯ Authors: Nvidia, :, Anis Ahmad, Jon Allen, Malik Aqeel Anwar, Jesse Archer, Maciej Bala, Piotr Barejko, Aarti Basant, Dan Blick, Taras Bolzhelarskyi, Henry Che, Jin Chen, Yukang Chen, Tae Eun Choe, Yuzhu Dong, Nat Duca, Liang Feng, Francesco Ferroni, Xiao Fu, Mohit Gambhir, Vivek Goel, Rony Goldenthal, Aryaman Gupta, Ali Hassani, Nathan Hayes-Roth, Yong He, Michael Honke, Shengyu Huang, Wei Huang (possible past Google (United States) affiliation), Delesley Hutchins, Suneel Indupuru, Pooya Jannaty, Jingyi Jin, Janmesh Kalra, Ashna Khetan, Xin Kong, Aleksandr Korovko, Hui Kuang, Zhengfei Kuang, George Kurian, Jean-Francois Lafleche, Jayjun Lee, Justin Leung, William Lew, Xiang Li, Zhaoshuo Li, Chen-Hsuan Lin (possible past Nvidia (United States) affiliation), Ming-Yu Liu (possible past Nvidia (United States) affiliation), Xiangyu Lu, Yuhang Lu, Martin Ding Ma, Qianli Ma, Aditya Mahajan, Miguel Martin, Janarbek Matai, Jonathan Mccaffrey, Qing Miao, Ashkan Mirzaei, Mustafa Munir, Sangmin Oh, David Pankratz, Trung Pham, Marilyn Reeb, Gavriel State, Jiaxiang Tang, Shitao Tang, Yue Tang, Tolou Tavakkoli, Alexander Temirov, Hweimi Tsou, Sergei Vasilev, Thomas Volk, Andrew Z. Wang, Hao Wang (possible past Tsinghua University affiliation), Shijie Wang, Zhonghao Wang, David Wehr, Shumian Xin, Mengyao Xu, Yao Xu, Shuai Yang, Sophia Zalewski, Pengcuo Zeren, Cindy Zha, Jing Zhang (possible past University Of Washington affiliation), Yuliya Zhautouskaya, Kaiwen Zheng, Andrew Zhu, Rick Zhuang
Abstract

We present a shared framework that adapts Cosmos world foundation models for real-time interactive world simulation in Physical AI. By streaming visual observations in response to actions and scene controls, the framework enables users and embodied agents to interact with evolving virtual environments. It supports both predicting the visual consequences of actions and generating observations from physical state maintained by an external simulator. We demonstrate this approach across camera navig...

πŸ“„ AmbiHTMLBench: A Benchmark for HTML-based Visually Rich Document parsing
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06449v1
πŸ‘₯ Authors: Boyu Niu, Yingjie Xiong, Shurui Li, Linhan Pang, Yuntong Zhang, Han Wang (possible past Peking University affiliation), Hao Wu (possible past Tencent (China) affiliation), Kai Zuo, Xu Tang (possible past Baidu (China) affiliation), Xuanhe Zhou, Fan Wu
Abstract

Traditional document parsing systems use Markdown as their output representation, which is effective for linear text but does not fully preserve fine-grained spatial structure, table geometry, visual hierarchy, or rendering semantics. We show that HTML is advantageous for heterogeneous and layout-sensitive documents whose representations must remain editable, inspectable, and reusable, and introduce AmbiHTMLBench to systematically study this setting. In this benchmark, given a real-world documen...

πŸ“„ Prism: Bidirectional Self-Teaching for Unified Multimodal Models
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06343v1
πŸ‘₯ Authors: Peng Zhang, Qian Chen (possible past Shanghai Jiao Tong University affiliation), Xianyin Zhang, Yimin Tian, Ruite Fei, Dongyi Lv, Lifan Guo, Chi Zhang (possible past Peking University affiliation), Shuai Liu
Abstract

Unified Multimodal Models (UMMs) aim to support visual understanding and generation within a single model. Existing post-training methods either use understanding as a fixed teacher to improve generation, or rely on ground-truth trajectories to supervise both understanding and generation. Prism instead derives bidirectional supervision from self-generated interleaved rollouts, constructing training targets according to the reliability of their text and image chains. We propose Prism, a bidirecti...

πŸ“„ Rubric Curriculum RL: Exploiting the Generation-Verification Gap in Non-Verifiable Domains
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06244v1
πŸ‘₯ Authors: Sumeet Ramesh Motwani, Tejas Krishnan, Alistair Letcher, Charles London, Suhaas Bhat, Huitian Jiao, Philip Torr (possible past University Of Oxford affiliation), Riashat Islam, Christopher Summerfield (possible past University Of Oxford affiliation), Jakob Foerster (possible past University Of Oxford affiliation), Christian Schroeder De Witt (possible past University Of Oxford affiliation), Qilong Gu, Shital Shah
Abstract

Reinforcement learning with verifiable rewards (RLVR) has led to significant gains in math and code generation. Extending these gains to open-ended domains remains challenging: ground-truth verification is unavailable, human annotation is expensive, and learned reward models are prone to reward hacking. The generation-verification gap, where judging good outputs is easier than producing them, offers a potential path to improvement. However, rubric-based judges are often imprecise and stationary,...

πŸ“„ Editing Large Language Models with Geometry-Aware Regularization
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06185v1
πŸ‘₯ Authors: Bingqing Liu, Wei Liu (possible past Tsinghua University affiliation), Jun Wang (possible past Tencent (China) affiliation), Xiaobo Sun, Yuhua Li, Ruixuan Li
Abstract

Knowledge editing has become a key technique for updating knowledge in large language models. However, existing methods neglect the geometric structure of the knowledge representation space, leading to two key limitations: they cannot distinguish which pre-trained knowledge should be preferentially preserved (core vs. non-core) nor which new edits are inherently difficult (hard vs. easy). To address this, we propose GEdit, a geometry-aware framework built on a Low-Rank Plus Diagonal (LR+D) facto...

πŸ“„ ModalSearcher: Weaving Visual Evidence into Autonomous Cross-Modal Deep Search
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06131v1
πŸ‘₯ Authors: Zhihan Yin, Ruyi Li, Chengyu Fang, Yifeng Yao, Nonghai Zhang, Pengfei Xiong (possible past Tencent (China) affiliation), Terry Zhang, Huishuai Zhang, Dongyan Zhao (possible past Peking University affiliation)
Abstract

Static and incomplete parametric knowledge limits the performance of multimodal large language models on novel-knowledge and knowledge-intensive tasks, especially those requiring multi-hop evidence acquisition. Existing multimodal agentic search methods often fix visual evidence at the input or a predefined trajectory position, making it difficult for agents to select search modalities as their information needs evolve and to handle complex real-world queries. We define this capability as autono...

πŸ“„ Ab Initio Accuracy Beyond the Cutoff: Distributed Message-Passing Equivariant Attention at Tens-of-Millions-of-Atom Scale
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06122v1
πŸ‘₯ Authors: Allex Kan, Ji Zhang (possible past Nvidia (United States) affiliation), Hao Yin, Hao Li (possible past Tsinghua University affiliation), Owen Fu, Xunxing Chen, Lin Huang, Zion Wang, Lucas Li, Jiajun Cheng, Arthur Jiang, Junping Zhao, Jia Zhang
Abstract

Molecular dynamics predicts molecular motion from atomic forces and trajectory integration. Density functional theory (DFT) provides first-principles forces, but its $O(N^3)$ cost limits simulations to thousands of atoms; empirical force fields scale to millions but miss bond breaking and charge transfer. Equivariant message-passing Transformers learn the ab initio potential at linear cost. Stacked layers propagate information beyond a single cutoff, giving four layers a receptive field up to 23...

πŸ“„ Beyond Risk Cues: A Mechanism-Level Benchmark and Verifiable Debate for Scam Video Detection on the Web
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06110v1
πŸ‘₯ Authors: Yifan Wang (possible past Stanford University affiliation), Junyu Lu, Shun Zhang, Chaozhuo Li, Fanliang Bu, Rong Yin, Lingbin Bu, Changrong Min, Peng Chen (possible past Tencent (China) affiliation)
Abstract

Online scam videos pose significant threats to individuals and society. Existing studies primarily focus on binary classification, offering limited insights into how scams work and the reasoning behind detection decisions. Moreover, they often overlook the challenge of distinguishing scam videos from superficially similar non-scam content, such as advertisements, and the robustness of detection models against misleading arguments. These limitations hinder reliable scam video detection. To addres...

πŸ“„ Reglos: A Self-Evolving Personal Memory Agent with Recursive Self-Improvement
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06049v1
πŸ‘₯ Authors: Sen Yang (possible past Tencent (China) affiliation), Jiaduo Lin, Zehong Huang, Wen Liu (possible past Tencent (China) affiliation)
Abstract

Personal agents draw on past conversations to tailor their responses to each user. Their memory systems store and update what each user says, and coding agents now also rewrite the harness that turns this memory into the model's context. Such patches risk overfitting, because one tested only on the failures it targets can fix those cases and help nowhere else. We present Reglos, a training-free personal memory agent that tests whether harness changes help beyond the failures they were written to...

πŸ“„ Autonomy and Coordination in Intelligent Manufacturing: A Recursive Autonomous Agent Framework
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.05828v1
πŸ‘₯ Authors: Yuning Chen, Hongda Zhang, Linqiang Hu, Ziqing Zhou, Yi Liu (possible past Google (United States) affiliation), Zhao Huang, Ding Zhou (possible past Meta (United States) affiliation), Haining Xu
Abstract

Intelligent production requires systems to make decisions and organize work according to production goals and operating conditions. It also requires continuous adjustment through feedback. This paper analyzes intelligence in human production organizations from a complex adaptive systems (CAS) perspective. The analysis identifies two coupled mechanisms: individual autonomy and collective coordination. Individual autonomy enables actors to form local decisions using available information. Collecti...

πŸ“„ PersonaCodeBench: Evaluating Coding Agents in Persona-driven Human-Interactive Sessions
πŸ—“οΈ Published: 11/3/2026
πŸ”— http://arxiv.org/abs/2611.05739v1
πŸ‘₯ Authors: Haixin Wang, Jianheng Hou, Hongyu Shen, Wenzhe Fan, Wei-Chieh Huang, Qianyu Zhu, Weichen Li, Taoran Li, Yuhang Yao, Ruohan Wang, Zhejian Peng, Wanting Jiang, Yifan Chen, Shushu Liang, Haoming Li, Defu Cao, Xu Hu, Siyang Wu, Chen Yang (possible past Tencent (China) affiliation), Haodi Hu, Haichao Zhang (possible past Baidu (China) affiliation), Cong Wang, Zhiyuan Yu, Weizhi Zhang, Yifan Wang (possible past Stanford University affiliation), Jintao Huang, Yizhou Sun, Yijun Wang, Yuexing Hao, Xiaomin Li
Abstract

Coding agents must deliver correct software while respecting users' expertise, preferences, and working conditions. Existing benchmarks increasingly incorporate interaction, yet personalized requirement fulfillment remains underexplored. We introduce PersonaCodeBench, which turns user characteristics into verifiable obligations in persona-driven multi-turn coding sessions. Our persona pool spans roles, technical abilities, interaction preferences, and practical constraints, yielding task-grounde...

πŸ“„ Route to Remember: Adaptive Memory Selection for LLM Agents
πŸ—“οΈ Published: 11/3/2026
πŸ”— http://arxiv.org/abs/2611.05636v1
πŸ‘₯ Authors: Zeyu Fang, Jun Yin, Yongsheng Mei, Xu Han (possible past Tsinghua University affiliation), Chaitali Joshi, Zhongkai Sun, Jie Hao (possible past Tencent (China) affiliation), Bin Guo, Chengyuan Ma, Benjamin Z. Yao, Chenlei Guo
Abstract

The memory of production agents is increasingly becoming a bottleneck and is built almost exclusively from text: key points are extracted from out-of-limit context and retrieved into context at query time. Therefore, every new query incurs an additional cost that grows with the accumulated history. Weight memory is a complementary alternative that internalizes knowledge into model parameters and answers with no context at all, and has recently proven effective in self-evolving agents for interna...

πŸ“„ Suppressing Misaligned Behaviors in Language Models, Durably
πŸ—“οΈ Published: 11/3/2026
πŸ”— http://arxiv.org/abs/2611.05358v1
πŸ‘₯ Authors: Luxi He, Pengcheng Jiang, Jifan Zhang, Jiawei Han (possible past Google (United States) affiliation), Danqi Chen (possible past Stanford University affiliation)
Abstract

Undesired model behaviors can emerge or re-emerge at any stage of training. Once observed, how effectively can we suppress them? To study this question, we first construct two model organisms--language models deliberately trained to exhibit a specific misalignment--that differ in what triggers the behavior. The narrow-trigger organism misbehaves only when the prompt contains a specific cue: it cheats on multiple-choice questions by following a planted hint that points to a wrong answer, and beha...

πŸ“„ SecureGARD: Dynamic Ontology-Guided Governance for Secure Tool-Using LLM Agents
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06682v1
πŸ‘₯ Authors: Guoqin Xiong, Shengtao Wen, Xiang Chen (possible past Tencent (China) affiliation), Xinyi Zeng, Zhaoxin Fan, Wei Ye (possible past Meta (United States) affiliation), Xiaofeng Cao, Sheng-Jun Huang
Abstract

Tool-using large language model (LLM) agents translate model outputs into consequential actions, turning indirect prompt injection into an execution-security problem. Existing defenses constrain tool calls, trajectories, or information flows, but often leave action semantics, state dependencies, and evidence relations implicit, limiting generalization across heterogeneous tools and complicating safe updates. We present \ours{}, a dynamic ontology-guided governance framework. \ours{} grounds hete...

πŸ“„ Graph Foundation Models Can Become Effective Multivariate Time Series Anomaly Detectors
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06441v1
πŸ‘₯ Authors: Zhuangyan Hu, Zhuoxuan Liang, Wei Li (possible past Peking University affiliation), Xiaohua Jia, Moustafa Youssef, Sumi Helal (possible past Google (United States) affiliation)
Abstract

Multivariate time series anomaly detection (MTSAD) relies on modeling both temporal dynamics and inter-sensor dependencies to identify complex system faults. Although graph-based detectors explicitly model sensor topologies, they train task-specific networks from scratch on limited target-domain data, remaining vulnerable to spurious correlations and unable to reuse transferable priors. While pretrained Graph Foundation Models (GFMs) offer transferable topological priors and anomaly discriminabi...

πŸ“„ KolTa: A Physics-Informed Active Learning Framework for Formulation Discovery with Limited Data
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06394v1
πŸ‘₯ Authors: Boyong Tang, Tao Wang (possible past Stanford University affiliation), Lei Yang (possible past Google (United States) affiliation)
Abstract

Finding high-performing formulations is difficult when few have been measured and experimental budgets are limited. We propose KolTa, an active learning framework that selects batches to discover the top 5% of formulations at a target temperature under a fixed query budget. KolTa combines a three-stage predictor of component contributions, role-conditioned interactions, and anchored temperature response with task-specific soft physics constraints. Its Physics-Residual-Calibrated Upper Confidence...

πŸ“„ Consistent Submodular Maximization with Full Foresight
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.06223v1
πŸ‘₯ Authors: Eric Balkanski, Paul DΓΌtting, Federico Fusco, Silvio Lattanzi (possible past Google (United States) affiliation), Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam (possible past Massachusetts Institute Of Technology affiliation)
Abstract

Online algorithms with bounded recourse face three intertwined obstacles: uncertainty about the future, computational limits, and a limited budget for changes. We ask a fundamental question that separates consistency from the other two: what does solution stability cost when the entire future is known and computation is unlimited? We answer this question for monotone submodular maximization, where an algorithm must maintain a solution of at most $k$ arrived elements, with a constant number of ...

πŸ“„ Decouple to Reuse: Fine-Grained Knowledge Augmentation for Time Series Foundation Models
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.05993v1
πŸ‘₯ Authors: Yuqian Wu, Qingxiang Liu, Yuxin Guo, Weifeng Su, Jian Li (possible past Tencent (China) affiliation), Pengfei Xu, Xi Chen (possible past University Of California, Berkeley affiliation), Yutao Yue, Yuxuan Liang
Abstract

Time series forecasting is critical for demand prediction and resource management in modern Web services, yet applying pretrained Time Series Foundation Models (TSFMs) to downstream tasks remains challenging due to domain shifts. Existing retrieval-augmented approaches typically retrieve coarse-grained window contexts and may introduce context-specific noise. To address this problem, we argue that temporal patterns should be reused at a decomposition level, as effective trend and seasonal dynami...

πŸ“„ On the Design of Hyper-Connections: Simplification, Stability, and Scalability
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.05984v1
πŸ‘₯ Authors: Xiangdong Zhang, Xiaohan Qin, Sunan Zou, Tuo Dai, Bizhao Shi, Zhuo Xia, Yebin Yang, Yizhou Chen, Yuliang Liu, Yu Cheng (possible past National University Of Singapore affiliation), Junchi Yan (possible past Shanghai Jiao Tong University affiliation)
Abstract

Hyper-Connections (HC) architectures are increasingly adopted in frontier language models, yet their components remain insufficiently understood and introduce non-negligible training overhead. In this work, we systematically study the HC architecture to understand its components and identify simpler, more efficient designs. We find that learned read/write gating without mixing and unconstrained mixing with fixed gates form two effective interaction groups: either alone achieves performance compa...

πŸ“„ WayPOP: A Panoramic Open-Set Panoptic Tracking Benchmark
πŸ—“οΈ Published: 11/4/2026
πŸ”— http://arxiv.org/abs/2611.05801v1
πŸ‘₯ Authors: Rohit Mohan, Maximilian Luz, Swarnava Chowdhury, Yao Lu (possible past Google (United States) affiliation), Florian Drews, Thomas NΓΌrnberg, Yakov Miron, Federico Tombari (possible past Google (United States) affiliation), Stefano Gasperini, Abhinav Valada
Abstract

Holistic perception for autonomous agents requires reliably segmenting and associating scene elements across time and camera views, including objects outside a fixed semantic taxonomy. Existing open-set panoptic benchmarks focus on individual images or views, while panoramic tracking benchmarks assume closed-set taxonomies. Consequently, these benchmarks do not evaluate whether unknown objects can be consistently segmented and tracked across synchronized multi-camera sequences. We introduce WayP...

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