📄 Notable* Recent AI/ML arXiv Papers

Last updated just now...

📄 DrugHarness: An Evolvable Agent Harness for Computational Drug Discovery
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23791v1
👥 Authors: Yuxing Chen, Zhisheng Zhang, Cheng Tang, Wei Li (possible past Peking University affiliation), Minghui Zhang, Ziyan Huang, Shaocong Wei, Jiawei Chen (possible past Tencent (China) affiliation), Junru Hu, Hongze Zhu, Jianghan Shen, Min Cen, Xinyuan Zhu, Yaxue Zhao, Jubo Wang, Yuqiang Li, Chun-Mei Feng, Zongyuan Ge, Rui Su, Jie Xu, Yirong Chen, Xi Xu, Ming Hu
Abstract

Computational drug discovery requires agents to compose scientific operations and adapt to changing evidence and constraints. Here we introduce DrugHarness, an evolvable agent harness coupling composable scientific execution with conditional skill induction. Its environment integrates over 80 scientific operations, biomedical resources and task-specific code, preserving associations among candidates, results and artifacts. From execution trajectories and outcome feedback, DrugHarness induces act...

📄 Darwin-Claw: Environment-Adaptive Experience Consolidation for Recursively Self-Evolving Agents
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23574v1
👥 Authors: Mingze Yin, Xiaohan Wang (possible past Baidu (China) affiliation), Dian Li (possible past Tencent (China) affiliation), Longfei Luo, Jiahong Yan, Yiheng Zhu, Chang-Yu Hsieh
Abstract

While Large Language Model (LLM) agents have demonstrated remarkable capabilities across complex tasks, they predominantly operate in isolated sessions, lacking the ability to continually learn from historical interactions or adapt to user-specific environments. Existing self-evolution paradigms often indiscriminately inject raw interaction trajectories into memory or skill modules, leading to obscured behavioral patterns and compromised update controllability. Furthermore, as foundational LLM r...

📄 FlashReFocus: Interactive Image Refocusing in Seconds
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23297v1
👥 Authors: Ching-Heng Cheng, Chia-Ming Lee, Ming-Ching Chang (possible past Nvidia (United States) affiliation), Xin Li (possible past Google (United States) affiliation), Yu-Lun Liu, Chih-Chung Hsu
Abstract

Single-image refocusing changes the focal plane and depth of field of a photograph after capture. It is inherently interactive: users try many focal points and blur strengths on one image, so each edit should be fast and change only the blur. Recent generative methods, however, rerun large diffusion models for every edit. We observe that the two sub-problems differ in kind: recovering the all-in-focus image is ill-posed and needs a generative prior, whereas rendering blur is largely determined b...

📄 MGE-PO: Entropy-Aware Credit Assignment for Mathematical Reasoning
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23245v1
👥 Authors: Jihao Huang, Guangjia Chai, Zhirui Chen, Lei Wang (possible past Baidu (China) affiliation), Yao Liu, Liu Qi, Pengjie Ding, Xinyang Liu, Chengxun Jia, Ling Shao (possible past Inception Institute Of Artificial Intelligence affiliation), Hongyu Chen, Junchen Wan
Abstract

GRPO assigns the same group-relative advantage to equally rewarded responses within a question, leaving their generation uncertainty unused. We introduce MGE-PO, centered on four-quadrant (4Q) advantage shaping that combines verified correctness with rollout generation entropy. Correctness determines the sign of an additional correction, while entropy controls its magnitude: lower-entropy successes receive larger bonuses and higher-entropy failures receive larger penalties. An online entropy-bas...

📄 OfficeTown: Generative Organizations for Evolving Agent Intelligence
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23194v1
👥 Authors: Hongchen Wei, Daohong Ying, Zhi Hong, Aidan Wu, Bei Liu, Ruichun Ma, Yifan Yang (possible past Tencent (China) affiliation), Qi Dai, Kai Qiu, Rui Xu, Dongdong Chen, Zhenzhong Chen, Chong Luo (possible past Google (United States) affiliation)
Abstract

AI agents increasingly use files and software tools to produce professional deliverables. Such work draws on materials, decisions, and feedback accumulated across assignments. We introduce OfficeTown, a generative simulation framework for professional organizations in which tasks and their context arise from continuing organizational work. From a natural-language description of an organization's purpose and activities, OfficeTown initializes an organization whose members coordinate work, delegat...

📄 Tree-Aware Posterior Distillation for Long-Horizon Agentic Reinforcement Learning
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23181v1
👥 Authors: Heming Zou, Qi Wang (possible past Tsinghua University affiliation), Yixiu Mao, Yun Qu, Yuyi Guo, Zeyuan Liu, Chenglin Li, Weijie Liu (possible past Tencent (China) affiliation), Saiyong Yang, Xiangyang Ji (possible past Tsinghua University affiliation)
Abstract

Reinforcement learning with verifiable rewards has become a scalable post-training paradigm for large language models. However, training agents over long-horizon interactions presents two challenges: using only terminal rewards makes turn-level credit assignment sparse and high-variance, while sequential mini-batch updates on a fixed rollout batch introduce policy staleness as the current policy drifts from the behavior policy. Existing approaches obtain denser credit via learned critics, proces...

📄 WebCoder: Scaling General Frontend Development with Artifact-Grounded Agentic Reinforcement Learning
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23104v1
👥 Authors: Zijun Dou, Zhen Yang (possible past Tsinghua University affiliation), Xijun Liu, Dongzhuoran Zhou, Aohan Zeng, Jie Tang (possible past Tsinghua University affiliation)
Abstract

Real-world frontend development requires agents to compose reproduction, generation, modification, and repair over an evolving application state. Learning a general policy for this process requires translating heterogeneous execution feedback into task-aligned rewards and effective credit assignment across long sequences of interdependent actions. We introduce WebCoder, a general frontend development agent trained with artifact-grounded agentic reinforcement learning. Our key idea is to assess d...

📄 Rethinking GRPO for Large Reasoning Model Safety Alignment
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23085v1
👥 Authors: Jiawei Chen (possible past Tencent (China) affiliation), Yi Zhang (possible past Google (United States) affiliation), Jiawei Du, Zhonghou Lv, Tairan Chen, Junyuan Shang, Jinchang Hou, Xiao Yang (possible past Tencent (China) affiliation), Yu Tian, Chenfu Bao, Chao Yu, Zhaoxia Yin
Abstract

Large reasoning models (LRMs) exhibit strong reasoning capabilities but remain vulnerable to unsafe outputs. While Group Relative Policy Optimization (GRPO) is widely used for safety alignment, its group-relative optimization may provide insufficient safety-directed learning signals. In this paper, we identify two failure modes: advantage collapse, where homogeneous rollout groups yield vanishing advantages, and unsafe diversification, where unsafe behaviors persist and become increasingly diver...

📄 PersonaCUABench: Benchmarking Computer-Use Agents Serving Diverse Personas
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.22990v1
👥 Authors: Haoming Li, Defu Cao, Xu Hu, Yingtao Luo, Yiyang Wang, Xianghe Xu, Jiashu He, Wanting Jiang, Yifan Zhang, Yunhan Zhao, Siyang Wu, Chen Yang (possible past Tencent (China) affiliation), Haixin Wang, Zheyuan Deng, Taoran Li, Jingwen Zhang, Zhejian Peng, Shushu Liang, Yue Zhao, Bingzhe Li, Feng Chen, Yifan Wang (possible past Stanford University affiliation), Jintao Huang, Yijun Wang, Yuexing Hao, Xiaomin Li
Abstract

Computer-use agents (CUAs) are commonly evaluated against fixed task specifications, but users may omit requirements, add constraints, or require approval before consequential actions. Completing the benchmark instruction does not guarantee serving the person who asked. We introduce PersonaCUABench, which holds 74 tasks across 11 domains fixed and varies only who asks. A persona agent, playing one of 44 personas in four groups, rewrites each instruction in that user's own words and answers the C...

📄 Prism Attention: Proposal-Refined Index Sharing Mechanism for Efficient LLMs Inference
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.22985v1
👥 Authors: Zhenxu Tian, Kebin Liu, Zhengwu Yang, Yi Su, Qingqing Dang (possible past Baidu (China) affiliation), Yanlin Sha, Kaipeng Deng, Dianhai Yu (possible past Baidu (China) affiliation), Yanjun Ma (possible past Baidu (China) affiliation), Juntao Li, Min Zhang (possible past Tsinghua University affiliation)
Abstract

Long-context decoding in large language models (LLMs) is increasingly bottlenecked by the memory and computation required to attend over an ever-growing Key-Value (KV) cache at each autoregressive step. Although token-level sparse attention reduces this burden by restricting computation to a small subset of relevant past tokens, its practical gains are often offset by repeatedly recomputing layer-wise sparse indices as the context grows. A common remedy is to share sparse indices across layers b...

📄 When to Forget: Risk-Controlled Context Adaptation for Long-Horizon Agents
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.22897v1
👥 Authors: Chenle Chen, Yangbo Wei, Zhijie Zheng, Zhenyu Su, Qifan Wang (possible past Google (United States) affiliation), Junhong Qian, Chao Yao, Chen Wu (possible past Google (United States) affiliation), Lei He
Abstract

Long-horizon agents learn from failure, but the value of a failure record can change as execution progresses. We study when retaining, compressing, or removing the same history block improves subsequent execution relative to full-history KEEP. We introduce RECAP, a framework that combines matched context interventions, execution-relational prediction, and independent policy certification. Matched environment states and rollout seeds measure success and continuation prompt-cost differences; prefi...

📄 World Action Critic (WAC) Model: Joint Foresight and Criticism for Policy Learning
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.22825v1
👥 Authors: Xiangteng Zhang, Haoyuan Liu, Yang Guan, Jingliang Duan (possible past Tsinghua University affiliation), Yao Lyu, Tao Zhang (possible past Nvidia (United States) affiliation), Shuai Zhang, Kehua Sheng, Bo Zhang (possible past Tencent (China) affiliation), Shengbo Eben Li (possible past Tsinghua University affiliation)
Abstract

World models have shown considerable promise in sequential decision-making by anticipating the consequences of actions and providing predictive foresight for policy learning. However, learning to reason about counterfactual actions remains challenging, since predictive objectives may underemphasize information critical for action evaluation, while unexecuted actions lack observed futures for direct supervision. To address these challenges, we propose the World Action Critic (WAC) Model, which pr...

📄 Self-Evolving Coding Agents via Harness-Policy Optimization
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.22791v1
👥 Authors: Zhepei Wei, Wenlin Yao, Baolin Peng, Danqing Wang, Qianhui Wu, Hao Cheng (possible past Tencent (China) affiliation), Yu Meng, Jianfeng Gao (possible past Microsoft (United States) affiliation)
Abstract

Large language model (LLM) agents have shown promising potential in coding tasks, and their performance is jointly determined by the policy model and the harness that mediates their interaction with the environment. Indeed, harness and policy are mutually reinforcing and evolving only one component is suboptimal---a harness tuned for one checkpoint may not target the failure modes of an updated policy, while policy learning remains limited to the trajectories elicited by a fixed harness. In ligh...

📄 R$^2$Orch: Recursive Self-Improvement for Agent Orchestration via Self-Play within a Skill-Internalization Loop
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22740v1
👥 Authors: Mingda Zhang, Yun Huang, Qiang Huang, Yanjin Li, Rui Qian (possible past Shanghai Jiao Tong University affiliation), Qichao Zhao, Tiesunlong Shen, Na Zhao, Jian Wang (possible past Baidu (China) affiliation), Xiaoying Tang
Abstract

In recent years, agentic orchestration has been widely applied to solve complex human tasks. However, existing orchestration learning still faces key challenges, including hand-designed curricula, advantage collapse when a task's rollouts all reach the same outcome, and unreliable evaluation signals that judge each skill by one noisy score. To address these challenges, we propose R$^2$Orch, a new paradigm of Recursive Self-Play Orchestration: an inner loop of self-play that improves the orchestr...

📄 From Relevant Memories to Sufficient Evidence: Rethinking Memory Utilization in LLM Agents
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22668v1
👥 Authors: Shixuan Li, Wei Yang (possible past Tencent (China) affiliation), Peiyu Zhang, Anzhe Cheng, Heng Ping, Xiaole Zhang, Jesse Thomason (possible past University Of Washington affiliation), Xuezhe Ma (possible past Carnegie Mellon University affiliation), Yue Zhao, Paul Bogdan
Abstract

Long-term memory enables LLM agents to reuse past experiences, yet retrieving relevant memories does not necessarily provide sufficient evidence for answering a query. Essential information may remain fragmented across memory records, obscured by abstraction, or disconnected from the relations required for reasoning. We identify this relevance-sufficiency gap and propose QEMem, a framework that reformulates memory utilization as the construction of query-specific evidence sets, shifting the focu...

📄 T2-z: Test-Time Optimization of Environment Latents for Robotic World Models
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22364v1
👥 Authors: Chenyuan Zhou, Yining Hong, Huang Huang, Yunfan Jiang, Wenlong Huang, David Held (possible past University Of California, Berkeley affiliation), Vitor Campagnolo Guizilini, Yue Wang, Li Fei-Fei (possible past Stanford University affiliation), Jiajun Wu (possible past Massachusetts Institute Of Technology affiliation), Leonidas Guibas (possible past Stanford University affiliation), Yejin Choi (possible past Allen Institute For Artificial Intelligence affiliation)
Abstract

Predicting how the world responds to an action requires more than what can be seen: robots must account for environmental factors that are neither directly observable nor explicitly specified, from physical properties such as friction and mass to human-defined environmental rules. We introduce T2-Z for test-time optimization of environment latents, which augments a robotic world model with a learnable environment latent to condition world predictions. This compact latent captures underlying envi...

📄 MLExpert: Towards a Generalist Agentic Model for Autonomous Machine Learning Engineering
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22344v1
👥 Authors: Shangheng Du, Jinxin Shi, Shuaiyu Zhang, Yiming Wu, Junpeng Zhao, Shiyang Feng, Xin Li (possible past Google (United States) affiliation), Liang He, Xiangchao Yan, Bo Zhang (possible past Tencent (China) affiliation)
Abstract

Large language models (LLMs) are expanding from assisting scientific research and engineering to autonomously developing and improving AI systems, advancing AI for AI (AI4AI) as a pathway toward recursive self-improvement (RSI). Workflow-driven machine learning engineering (MLE) systems provide a practical path toward this pursuit through complex orchestration that manages long-horizon experimentation, while recent MLE systems adopt model-directed interaction, allowing models to autonomously org...

📄 KnowGPO: Knowledge-Grouped Policy Optimization for Search Agents
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22331v1
👥 Authors: Siqi Chen, Zhengxi Lu, Yuchen Yan, Xingyu Wu, Qipeng Chen, Xin Zhang (possible past Google (United States) affiliation), Aiting Liu, Chao Deng, Jie Liu (possible past Tencent (China) affiliation), Jin Ma, Weiming Lu, Jun Xiao, Yongliang Shen
Abstract

Deep search agents solve knowledge-intensive tasks through long-horizon, multi-turn interactions, where assigning credit to individual search decisions is fundamentally difficult. Outcome-based reinforcement learning provides only a single terminal reward shared across an entire trajectory. Recent process-supervision methods aim to assign credit at finer granularity, but they typically anchor credit to either surface-level trajectory states or model-internal signals, both of which become unrelia...

📄 Learning to Steer LLM Agents and Multi-Agent Systems
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22316v1
👥 Authors: Leyang Shen, Yaxin Gong, Yang Zhang (possible past Tsinghua University affiliation), Chenxiao Fan, Jiakai Wang, Dong Wang (possible past Tsinghua University affiliation), Yang Liu (possible past Tsinghua University affiliation), Fuli Feng (possible past National University Of Singapore affiliation), Chun Kai Ling, Tat-Seng Chua
Abstract

Large language model (LLM)-based agents and multi-agent systems increasingly tackle complex tasks through long-horizon tool use and inter-agent collaboration. However, these systems are prone to deviating from the overall goal as execution unfolds, which wastes execution resources and leads to undesired outcomes, a failure termed goal drift. In this work, we propose a steering agent that supervises execution on the fly and steers the system back on track when drift occurs. The steering agent obs...

📄 Librarian Agents: Training LLMs to Curate Long-Context Workspaces that Anticipate Future Queries
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22273v1
👥 Authors: Anikait Singh, Teresa Zhang, Yoonho Lee, Roshen Sanjay Nair, Aviral Kumar (possible past University Of California, Berkeley affiliation), Chelsea Finn (possible past University Of California, Berkeley affiliation)
Abstract

Reasoning over long document contexts remains a challenge for large language models (LLMs). Standard retrieval methods are inherently reactive, bottlenecking agents with complex, cross-document reasoning at inference time, while precomputed structures like knowledge graphs often fall short because they rely on rigid heuristics. Instead, can we allow agents to perform anticipatory directed curation: learning to proactively reorganize unstructured corpora prior to inference to efficiently serve di...

📄 OS-Helix: Unifying GUI Interaction and Code Execution in Native Computer-Using Agents
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22234v1
👥 Authors: Bowen Yang, Kaiming Jin, Zichen Ding, Zhenyu Wu, Zehao Li, Zhoumianze Liu, Kanzhi Cheng, Fangzhi Xu, Yanan Sun (possible past Tencent (China) affiliation), Qiushi Sun, Yu Qiao (possible past Shanghai Artificial Intelligence Laboratory affiliation)
Abstract

Real desktop automation is neither purely visual nor purely programmatic. Agents must understand user-facing interfaces while efficiently manipulating files, scripts, and system state. However, native GUI/code coordination cannot be obtained by prompt-level tool composition. In our preliminary experiments, naively adding a code tool degrades a GUI agent, revealing that GUI/code routing must be internalized through training on high-quality hybrid data. We present OS-Helix, an end-to-end trained m...

📄 GNN-Guided Local Refinement for Efficient Layout Decomposition with DSA-MP
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22214v1
👥 Authors: Yu Feng (possible past University Of California, Berkeley affiliation), Liyi Zhou, Haoyu Wang (possible past Tencent (China) affiliation), Yiming Xu, Hao Geng, Shaozhi Deng, Ningsheng Xu, Shisheng Xiong
Abstract

Multiple patterning lithography (MPL) has been widely used to improve lithography resolution in advanced nodes, but it faces cost limits as feature sizes shrink. Directed self-assembly (DSA) offers a cost-effective complement, extending the resolution of optical lithography to sub-10 nm and beyond. Integrating DSA into MPL (DSA-MP) further enhances the resolution of contact/via patterning. Nevertheless, growing design complexity exposes the limits of existing decomposition methods, which struggl...

📄 Decentralized LLM Workflows via Sequential Auctions
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22201v1
👥 Authors: Ian Gemp, Shubhendu Trivedi, Adam Fisch (possible past University Of Washington affiliation), Fantine Huot, Michael Kaisers, Mirella Lapata (possible past University Of Edinburgh affiliation), William W. Cohen (possible past Google (United States) affiliation), Alekh Agarwal, Kate Larson, Jacob Eisenstein (possible past Meta (United States) affiliation)
Abstract

We present a scalable framework for solving multi-step tasks through a decentralized market of self-interested agents. Prior theoretical work demonstrated that agents organized through sequential auctions can converge to a globally optimal policy in a Markov decision process (MDP), but relied on the restrictive assumption of the existence of perfect clones as a model of perfect competition. In reality, exact clones drive agent profit to zero, violating the natural risk-reward incentives of parti...

📄 AutoSFT: An Agentic System for Automated Data Research in Supervised Fine-Tuning
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22194v1
👥 Authors: Bingxiang He, Pengqi Sun, Shihao Peng, Shaoxuan Li, Huiyu Xiao, Hongjian Shi, Zixuan Fu, Ziqing Qiao, Yuxin Zuo, Cheng Qian, Xinqiang Yu, Jiayi Li, Xiusi Chen (possible past Peking University affiliation), Yizhen Song, Xiangyang Wang, Iofai Lei, Yudong Wang, Ning Ding (possible past Tsinghua University affiliation), Zhiyuan Liu (possible past Tsinghua University affiliation), Xiaozhi Wang, Chaojun Xiao
Abstract

Language model agents increasingly automate post-training, but when given the full training stack they converge on supervised fine-tuning and spend most effort revising training data. Existing systems give the agent one kind of control, selecting rows from a fixed pool or calling a generator, whereas a human data engineer adjusts proportions, prunes, repairs, replaces and synthesizes the data. We design a data action space for these changes and ask whether an automated system can make the full r...

📄 ECG-SDI: Single-lead Electrocardiogram Enables Continuous Sleep Depth Index Profiling and Scalable Digital Biomarkers for Sleep Health
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23727v1
👥 Authors: Donglin Xie, Qingshuo Zhao, Songchi Zhou, Haoyu Wang (possible past Tencent (China) affiliation), Jingyu Wang, Yuxi Zhou, Thomas Penzel, Shenda Hong (possible past Peking University affiliation)
Abstract

Conventional sleep staging provides a coarse-grained representation that obscures within-stage depth variation. We developed ECG-SDI, a single-lead electrocardiography (ECG) framework for continuous sleep-depth profiling and digital biomarker extraction. Using 12,392 overnight polysomnographic recordings, we trained and validated a two-stage deep learning model supervised by conventional sleep-stage labels. Correlations with ordered stages excluding rapid eye movement (REM) sleep were 0.828 in t...

📄 A Language-Informed Loss for Visual Generation
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23653v1
👥 Authors: Suchir Agarwal, Keshigeyan Chandrasegaran, Ziyu Chen, Kyle Sargent, Juan Carlos Niebles (possible past Stanford University affiliation), Li Fei-Fei (possible past Stanford University affiliation), Jiajun Wu (possible past Massachusetts Institute Of Technology affiliation)
Abstract

End-to-end visual generation with pixel-space loss has recently achieved competitive performance without the need for learned image tokenizers. In this work, we study whether language-informed supervision can provide a richer training signal than pixel loss for visual generation. We introduce LILIE (pronounced "lily"), a Language-Informed and Lossless Image Encoder. LILIE is an invertible image transform trained such that a vision-language model can recover captions from noised features. The enc...

📄 Predictable Scaling: Efficient Model Exploration via Scaling-Law Prediction
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23453v1
👥 Authors: Aishwarya Wesanekar, Sheng-Tao Yang, Jiawei Zhang, Flavio Sales Truzzi, Chen Chen (possible past Tencent (China) affiliation), Nader Beigiparast, Shengyuan Huang, Roshanak Zilouchian Moghaddam, Vitor Cid, Colin Clement, Vinayak Thapliyal, Sebastian Ament, Jihao Andreas Lin, Vincent Huang, Kai Han, Boyi Jiang, Wenlin Chen (possible past Meta (United States) affiliation), Chaorong Chen, Ashwin Kumar, Maximilian Balandat, David Eriksson, Yifei Zhang, Pan Zhong
Abstract

Evaluating candidate changes (hypotheses) to recommendation models requires full-scale training runs consuming thousands of GPU-hours, severely limiting the hypothesis space engineers can feasibly explore. We introduce Predictable Scaling (PS), a systematic framework that exploits empirically verified regularity conditions to predict full-scale model performance from small-scale proxies. PS constructs scaled-down variants via composable scaling functions along distinct resource axes, and project...

📄 Towards Looped Models Done Right, Part I: Topology, Input Injection, Recurrent-State Design
🗓️ Published: 10/16/2026
🔗 http://arxiv.org/abs/2610.23036v1
👥 Authors: Benhao Huang, Chufan Shi, Junlin Chen, Shicheng Wen, Zhengzhong Liu (possible past Tencent (China) affiliation), Eric Xing, Xuezhe Ma (possible past Carnegie Mellon University affiliation)
Abstract

Looped language models reuse physical Transformer blocks across logical depth, but established architectures entangle recurrence placement, input injection, and recurrent state organization. We isolate these axes in models trained from scratch at matched parameter scale, logical depth, and token budgets, and then test whether the resulting design principles transfer to resident- and active-parameter-matched Mixture-of-Experts (MoE) models. The prelude-recurrent block-coda sandwich architecture c...

📄 Has GPT-6-Astra Achieved Embodied Intelligence?
🗓️ Published: 10/15/2026
🔗 http://arxiv.org/abs/2610.22471v1
👥 Authors: Sensenova, Joint Research Team, :, Zhongang Cai, Ziang Cao, Tailai Chen, Han Chong Chua, Linjun Dai, Hanming Deng, Hokin Deng, Haiwen Diao, Chenjing Ding, Weichen Fan, Xiao Fu, Zerui Gong, Chenyang Gu, Zexin He, Zhi Hou, Bo Li (possible past Tencent (China) affiliation), Qinyue Li, Quanzhou Li, Xiaowan Li, Zhichao Liao, Dahua Lin, Zilong Lin, Bo Liu (possible past Meta (United States) affiliation), Chunxiao Liu, Pengfei Liu, Tianqi Liu, Ziwei Liu, Chen Change Loy, Lewei Lu, Jiapeng Luo, Yuexiao Ma, Liang Pan, Xingang Pan, Oscar Qian, Ziyi Shang, Yuyao Shao, Dawei Su, Dacheng Tao, Qingyi Tao, Quan Wang (possible past Google (United States) affiliation), Ruisi Wang, Xiaogang Wang, Ziyi Wang, Beichen Wen, Donghao Wu, Jiaxu Wu, Silei Wu, Xiaoming Wu, Zhonghua Wu, Hongcan Xiao, Weiye Xu, Atsushi Yamashita, Lei Yang (possible past Google (United States) affiliation), Zhe Yang, Baiqiao Yin, Wanqi Yin, Hanfei Zhao, Tianbo Zhong, Long Zhuo, Jing Zuo
Abstract

GPT-6-Astra demonstrates a level of competence in robotic manipulation and navigation that challenges the conventional paradigm of building specialized models for individual tasks and embodiments. In this report, we ask not only how capable GPT-6-Astra is, but what its capabilities imply for the field. First, we probe the limits of standalone GPT-6-Astra. We conduct a large-scale evaluation across 12 representative benchmarks spanning tabletop manipulation, humanoids, mobile platforms, and dexte...

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