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

Last updated just now...

πŸ“„ Logos: An Agent Harness on a Cross-Process Bus
πŸ—“οΈ Published: 8/28/2026
πŸ”— http://arxiv.org/abs/2608.28553v1
πŸ‘₯ Authors: Hanzhang Jia, Liheng Zeng, Hao Cheng (possible past Tencent (China) affiliation), Yi Gao (possible past Google (United States) affiliation), Bo Ma
Abstract

Modern agent systems assemble capabilities at runtime, and this dynamic composition has recently received a complete formal treat ment in the spatiotemporal-composability calculus, in which a capability is a component carrying a tracked inverse, and agents are assembled as plugins. This plugin form is carried by a single process sharing one context, a carrier that places all components in one physical failure domain, a fault suspends every component at once, and process death interrupts every se...

πŸ“„ InstructMesh: Selective Refinement of Generative 3D Models for Fabrication
πŸ—“οΈ Published: 8/28/2026
πŸ”— http://arxiv.org/abs/2608.28534v1
πŸ‘₯ Authors: Faraz Faruqi, Ahmed Katary, Demircan Tas, Theresa Hradilak, Ning Zhang (possible past University Of California, Berkeley affiliation), Jiaji Li, Fabian Manhardt (possible past Google (United States) affiliation), Martin Nisser, Vrushank Phadnis, Ruofei Du (possible past Google (United States) affiliation), Federico Tombari (possible past Google (United States) affiliation), Megan Hofmann, Stefanie Mueller
Abstract

Recent advances in generative AI allow users to create 3D models from text or images. However, these models prioritize visual plausibility over geometric accuracy, often generating results with flaws that compromise their intended use post-fabrication. We present InstructMesh, an interactive post-generation refinement tool that enables selective repair of generative 3D models through region selection and targeted operations, such as opening or sealing voids, or adjusting local thickness. Users c...

πŸ“„ Learning to Allocate Incentives for Incentivized Advertising via Offline Model-Based Reinforcement Learning
πŸ—“οΈ Published: 8/28/2026
πŸ”— http://arxiv.org/abs/2608.28065v1
πŸ‘₯ Authors: Zilin Zhao, Han Yang (possible past Eth Zurich affiliation), Tianpei Yang, Fangsheng Huang, Yanfei Cui, Kan Peng, Yi Li (possible past University Of Washington affiliation), Yiming Zong, Hao Zhang (possible past Tencent (China) affiliation), Yinsong Xue
Abstract

Complete your ad view and grab a 5-cent bonus! In incentivized advertising, a platform promises users a bonus before observing downstream ad revenue, encouraging them to click and complete ads. It must balance the incentive promised in advance against the revenue realized afterward: insufficient incentives forfeit monetization opportunities, whereas excessive incentives reduce net profit. Because current incentives may also shape user expectations and future engagement, incentive allocation is a...

πŸ“„ Automated Analysis Framework for Multilingual Climate-Health Literature Based on Multi-Agent Large Language Model
πŸ—“οΈ Published: 8/28/2026
πŸ”— http://arxiv.org/abs/2608.27998v1
πŸ‘₯ Authors: Yuze Sun, Shihui Zhang (possible past Tsinghua University affiliation), Jiancheng Pan, Yunjia Ye, Wentao Luo, Jiahao Li, Quan Zhang, Wenjia Cai (possible past Tsinghua University affiliation), Xiaomeng Huang
Abstract

The rapid proliferation of interdisciplinary and multilingual scientific literature has left traditional manual analysis and single-algorithm methods plagued by low efficiency, poor scalability, and insufficient domain adaptability. Targeting the literature analysis needs of the typical interdisciplinary climate-health field, this study proposes a multi-agent large language model automated analysis framework for multilingual scientific literature, which realizes full-process automation covering ...

πŸ“„ openJiuwen: Beyond Static Harnesses for Long-Horizon Coding Agents
πŸ—“οΈ Published: 8/28/2026
πŸ”— http://arxiv.org/abs/2608.27969v1
πŸ‘₯ Authors: Openjiuwen Team, Tao Yu (possible past University Of Washington affiliation), Xinyu Zhang (possible past Baidu (China) affiliation), Qianqian Chen, Xiaoneng Xiang, Chia Kwangyang, Xingchen Huang, Ran Chen, Yangkai Ding, Zheng Wang, Yeo Boon Hong, Bingzheng Gan, Enrui Hu, Shuo Cheng, Deyang Li, Ruifeng Shi, Hongbo Wang, Qi Ye, Xuefeng Jin, Zhangchun Zhao
Abstract

Long-horizon coding agents operate over evolving repository states while increasingly relying on heterogeneous capabilities, delegated agents, and multi-agent coordination. These trends pose two complementary challenges for the agent harness. First, developers need to compose capabilities, reconfigure execution logic, and scale increasingly complex agent systems without repeatedly rebuilding orchestration. Second, complex coding tasks continuously produce new evidence---such as semantic diagnost...

πŸ“„ HyQuant: Hybrid-Precision Quantization for LLM Attention
πŸ—“οΈ Published: 8/28/2026
πŸ”— http://arxiv.org/abs/2608.27875v1
πŸ‘₯ Authors: Jiatong Ding, Bingxin Xing, Yu Zhang (possible past Google (United States) affiliation), Dian Ding, Xiaodong Yi, Xianbin Ouyang, Feihu Zhou, Kun Zhang (possible past Google (United States) affiliation), Zhenyu Guo, Hao Pan, Guangtao Xue, Yiming Zhang
Abstract

Quantization has been widely adopted in LLM training and inference to reduce cost and improve efficiency. However, low-bit quantization of the \emph{attention} module often introduces large errors at very low bit-widths, causing performance degradation. Existing methods mainly rely on smoothing techniques to handle outliers, while we propose a hybrid quantization design to better balance accuracy and efficiency. Specifically, we propose \textbf{HyQuant}, an efficient hybrid quantization framewor...

πŸ“„ WikiSkill: Compiling Agent Experience into Persistent Knowledge for Skill Evolution
πŸ—“οΈ Published: 8/27/2026
πŸ”— http://arxiv.org/abs/2608.27454v1
πŸ‘₯ Authors: Liyan Tang, Cyrus Rashtchian, Chun-Sung Ferng, Andrew Tomkins (possible past Google (United States) affiliation), Da-Cheng Juan (possible past Google (United States) affiliation), Tu Vu
Abstract

Agent skills package specialized knowledge and workflows into reusable resources that extend AI agent capabilities. Recent work automatically discovers such skills from agent experience, which enables agents to progressively adapt through interaction. However, the insights that guide skill development typically remain scattered across optimization histories, limiting their systematic reuse across iterations. We introduce WikiSkill, a framework that co-evolves agent skills with a persistent knowl...

πŸ“„ PAWBench: How Far Are We from Probabilistically Aligned World Modeling?
πŸ—“οΈ Published: 8/27/2026
πŸ”— http://arxiv.org/abs/2608.27345v2
πŸ‘₯ Authors: Yuandong Pu, Le Zhuo, Sayak Paul, Gabriel Jorge Menezes, Avram ĐorΔ‘eviΔ‡, Shiyang Li, Yifan Zhou, Bin Fu (possible past Tencent (China) affiliation), Wenlong Zhang, Junjun He, Yu Qiao (possible past Shanghai Artificial Intelligence Laboratory affiliation), Yihao Liu, Jinbo Xing, Xi Chen (possible past University Of California, Berkeley affiliation)
Abstract

Recent video generation models are increasingly framed as world models. Many physical processes can unfold in more than one valid way. Therefore, a world model should reproduce not only a plausible trajectory, but also the distribution of possible behaviors under the same initial observation and action. We call this distribution-level requirement probabilistic alignment. However, existing evaluations largely assess individual-video plausibility and do not test whether repeated generations recove...

πŸ“„ What Makes Good Agentic Data? An ACE Lens on Data Generation for LLM Agents
πŸ—“οΈ Published: 8/27/2026
πŸ”— http://arxiv.org/abs/2608.27260v1
πŸ‘₯ Authors: Xingshan Zeng, Zishan Xu, Boju Zhang, Yuzhou Wu, Lingzhi Wang, Jianghao Lin, Liangyou Li, Yasheng Wang, Lifeng Shang, Xin Jiang, Weinan Zhang (possible past Shanghai Jiao Tong University affiliation), Yong Yu (possible past Shanghai Jiao Tong University affiliation), Qun Liu (possible past Huawei Technologies (China) affiliation), Weiwen Liu
Abstract

LLM agents increasingly rely on generated interaction data to learn how to interact with external environments. Agentic data generation must maintain consistency among environments, tasks, interactions, and success signals while producing experience that is useful rather than merely abundant. Existing work spans many agent domains, but domain-centered organization and heterogeneous evaluation often obscure common generation mechanisms and conflate candidate construction with verification and sel...

πŸ“„ HARTS: Efficient Agentic Reinforcement Learning for Hybrid-Attention Models over Arbitrary Rollout Trees
πŸ—“οΈ Published: 8/28/2026
πŸ”— http://arxiv.org/abs/2608.28158v1
πŸ‘₯ Authors: Boyuan Meng, Peihua Bao, Hong Liu (possible past Google (United States) affiliation), Xiaowei Zhu, Chao Wang (possible past Google (United States) affiliation), Gen Li (possible past University Of Edinburgh affiliation), Zhenxuan Pan
Abstract

Agentic reinforcement learning (RL) often produces irregular rollout trees with shared histories. Training root-to-leaf trajectories independently recomputes these shared prefixes. Existing systems primarily target full-attention models and lack dense, differentiable hybrid-attention execution compatible with activation recomputation. We present HARTS (Hybrid-Attention RL over Tree Structures). HARTS jointly plans microbatches, data-parallel (DP) replica assignments, and microbatch-slot schedule...

πŸ“„ Temporal Memory-Aware Online Test-Time Adaptation on Dynamic Graphs
πŸ—“οΈ Published: 8/28/2026
πŸ”— http://arxiv.org/abs/2608.27948v1
πŸ‘₯ Authors: Bo Li (possible past Tencent (China) affiliation), Xin Zheng, Ming Jin, Can Wang (possible past Tsinghua University affiliation), Shirui Pan
Abstract

Test-time adaptation (TTA) on graphs aims to adapt a graph neural network (GNN) that is well-trained on the training graph to the test graph, which involves potential distribution shifts that may harm model generalization and test-time inference. While recent efforts have investigated TTA on static graphs, there is still a research gap on dynamic graphs learned with dynamic GNN (DGNN) models, where both structural connectivity and node semantics evolve continuously over time. This makes adapting...

πŸ“„ Rethinking Message Passing as Retrieval for Text-Attributed Graph Learning
πŸ—“οΈ Published: 8/27/2026
πŸ”— http://arxiv.org/abs/2608.26732v1
πŸ‘₯ Authors: Jintang Li, Yuhong Chen, Ruofan Wu, Binli Luo, Jiayi Ji, Hui Li (possible past Baidu (China) affiliation), Rongrong Ji (possible past Tencent (China) affiliation)
Abstract

Graph neural networks (GNNs) are typically conceptualized as message-passing neural networks, yet it remains unclear why neighborhood aggregation reliably outperforms node-wise multilayer perceptrons (MLPs). Despite its empirical success, this paradigm can be computationally expensive and sensitive to imperfect graph structures. In this work, we present a retrieval-augmented view of GNNs: each layer makes predictions by applying an MLP to a node representation together with a permutation-invaria...

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