跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 10:52 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-14 12:22 — 2026-11-15 12:22(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-15 10:52最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 23,348 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 10:50(北京时间)
首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-srw.95ACL Anthology · ACL 2026

TableMBR: Minimum Bayes Risk Table Generation Based on Structural Consistency

Daiki Yoshida Nara Institute of Science and Technology, Japan, Hiroyuki Deguchi NTT, Yusuke Sakai Nara Institute of Science and Technology, Japan, Hidetaka Kamigaito CyberAgent, Inc. and Nara Institute of Science and Technology, Taro Watanabe Nara Institute of Science and Technology, Japan

原文摘要

The text-to-table task aims to generate structured data in tabular formats from unstructured text. While the integration of large language models (LLMs) has significantly enhanced the comprehensiveness and flexibility of generation, challenges regarding inconsistent output quality persist, such as the inclusion of redundant information and numerical inaccuracies. We propose TableMBR, a robust table generation method that maintains structural consistency through minimum Bayes risk (MBR) decoding. Experimental results showed that TableMBR outperforms the baseline, achieving relative improvements of up to 15% in F1 score on Rotowire and 23% in accuracy on LiveSum.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-srw.96ACL Anthology · ACL 2026

Through the Looking Glass of Multilingual AI: Contrasting Language- and Name Script-Dependent Ethnic Hierarchies in GPT and DeepSeek

Annabella Sakunkoo Stanford University, Jonathan Sakunkoo University of Oxford

原文摘要

Large language models (LLMs) are increasingly used as evaluative tools across languages, yet bias research remains overwhelmingly Anglocentric, with most studies conducted in English using Latin-script names. It remains unclear whether bias patterns generalize across linguistic contexts. We investigate this question and introduce the stereotype perceptual map, a framework for analyzing how ethnic groups are positioned along evaluative dimensions.Using 900,000 model responses over 45,000 name variations spanning 9 ethnicities, we evaluate model behavior across prompt languages (English, Chinese, Thai), writing scripts (Latin, Chinese, Thai), evaluative domains (competence, warmth), and models (GPT, DeepSeek). We find that ethnic bias hierarchies are jointly shaped by local linguistic context and model origin and differ substantially between Western-centric and Sinocentric models.DeepSeek exhibits highly stable rankings across conditions in math competence judgments, consistently placing Chinese at the top, followed by Russian, and White, Hispanic, and Black names at the bottom. GPT, by contrast, shows strong script-dependent reordering: Latin-script conditions form one stable cluster, while native-script conditions form another, with substantially lower cross-cluster correlations. We term this script-gated bias: transliterating the same names into a non-Latin script can activate a different evaluative frame and produce rankings that are sometimes inversely correlated with Latin-script results. Warmth evaluations are less stable than competence across both models.Our findings demonstrate that multilingual bias cannot be characterized through single-language, single-script audits. For multilingual users, code-switching between languages can toggle between different bias regimes. Fairness evaluations for multilingual LLMs must therefore account for deployment language, writing system, and model origin to capture the full range of potentially harmful bias these systems exhibit.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-srw.97ACL Anthology · ACL 2026

Thesis Proposal: Auditing and Mitigating Demographic Bias in Multi-Stage Retrieval Systems for Criminal Justice Applications

Archan Dutta

原文摘要

We propose a comprehensive research agenda to detect, measure, and mitigate racial bias in Natural Language Processing (NLP) systems deployed in criminal justice contexts. Our preliminary work demonstrates that racial descriptors systematically alter embedding similarity scores and retrieval rankings across six models, with bias being race-specific and models showing rank displacements of 1.82 to 7.44 positions, on average. This empirically indicates that even small shifts in similarity scores can displace relevant records outside top-10 results, leading to systematic under-retrieval of records involving certain demographic groups.Building on these findings, this thesis proposes four research questions: (1) developing and evaluating debiasing techniques including counterfactual data augmentation, adversarial training, and fairness-constrained fine-tuning; (2) validating synthetic findings on authentic law enforcement data through IRB-approved partnerships; (3) investigating intersectional bias patterns across race, gender, and age; and (4) we extend beyond embedding-level analysis to examine how bias propagates across modern multi-stage retrieval pipelines from embeddings to cross-encoders to LLMs. Expected contributions include empirical comparisons of debiasing methods, bias benchmarks for criminal justice NLP, deployment guidelines for fairness-aware retrieval systems, and the first comprehensive analysis of multi-stage bias propagation in retrieval pipelines.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-srw.98ACL Anthology · ACL 2026

Contextual Diversity Measure (CDM) for Controllable Story Generation in Large Language Models

Richard Susilo Australian National University, Hanna Suominen Australian National University, Patrik Haslum Australian National University

原文摘要

Scenario-based text generation has broad applications across education and creative writing, but remains underexplored in controllable text generation. We introduce the Contextual Diversity Measure (CDM), a metric that quantifies semantic diversity for scenario generation under fixed abstract semantic constraints, and validate it through controlled experiments. Statistical analysis across four embedding models demonstrates that CDM successfully distinguishes between high-diversity and low-diversity text pairs, with all tests achieving statistical significance at p < 0.05 on both the manually curated and LLM-generated subsets of the dataset. Effect sizes range from small-to-medium (Cohen’s d: 0.292–0.508) on the former and medium-to-large (Cohen’s d: 0.677–1.195) on the latter. Baseline comparisons indicate that CDM achieves excellent discrimination accuracy (100% and 91.9%, respectively), with discriminative power up to 5.5\times greater than the best baseline.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-srw.99ACL Anthology · ACL 2026

Constructing a Japanese Verdict Prediction Dataset for Fact-Checking of LLM-Generated Texts

Miwa Masano, Hirokazu Kiyomaru National Institute of Informatics, Atsushi Keyaki Hitotsubashi University, Kaito Horio Waseda University, Rei Minamoto, Ribeka Keyaki Tokyo University of Technology, Kouta Nakayama NII, Tokyo Institute of Technology, Hideyuki Tachibana National Institute of Informatics and Asia University 等 9 位作者

原文摘要

The development of fact-checking systems for verifying the factuality of text generated by large language models (LLMs) has been advancing.In the verdict prediction step of such systems, the system determines whether claims in the generated text are supported by retrieved evidence, formulated as a natural language inference (NLI) task.This study extends the label set for verdict prediction to capture claim-evidence relationships that humans would commonly interpret as supported or refuted, even in the absence of strict logical entailment or contradiction.It also constructs a Japanese dataset comprising 28,147 instances from two sources based on this extended label set.We analyze the causes of annotation disagreement and find that ambiguity in the boundary of acceptable inference, interpretive characteristics of negative cases, and incomplete information in the evidence affect annotation variability.Using this dataset, we evaluate the performance of prompt-based verdict prediction methods and show that prompts that explicitly elicit chain-of-thought reasoning improve F1 by 4 percentage points compared to baseline.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-tutorials.1ACL Anthology · ACL 2026

Future of Work in the Age of LLMs

Zora Wang Carnegie Mellon University, Yijia Shao Stanford University, David Nguyen Stanford University, Diyi Yang Stanford University

原文摘要

The recent development of large language models (LLMs) has revolutionized the landscape of human work. These models possess the ability to follow complex human instructions and operate versatile computer software, enabling them to participate in, augment, or even automate realistic occupational tasks that once thought to be exclusive to humans. As LLMs are increasingly integrated into workplaces, they are already reshaping labor dynamics (Hoffmann et al., 2024; Demirci et al., 2025) and raising urgent concerns about job displacement, diminished human agency, and overreliance on automation (Hazra et al., 2025). As a result, the future of work is undergoing a profound transformation: How will human occupations and task requirements evolve over time? And what roles will LLM-based systems play, as they become increasingly capable collaborators and autonomous workers? And how can we build technological and data infrastructures to support human-AI collaboration? This tutorial will provide an overview of the future of work shaped by the interplay of LLMs and humans, examining the emerging challenges, opportunities, and ethical considerations in this dynamic landscape. We begin by examining the economic landscape of work and how NLP technologies drive automation, followed by methods for developing LLMs that augment human labor and recent advances in LLM-based agents. We then cover evaluation approaches for workplace contexts, including datasets, benchmarks, and metrics, and conclude with open questions on technical, human, and societal implications.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-tutorials.2ACL Anthology · ACL 2026

The Data Frontier for Large Language Models: Selection, Synthesis, and Tools

Lijun Wu Shanghai AI Laboratory, Wentao Zhang Peking University, Conghui He Shanghai AI Lab

原文摘要

As the development of Large Language Models (LLMs) matures, the focus of the research community is undergoing a critical shift from a purely model-centric to a data-centric paradigm. It is now evident that the quality, diversity, and composition of training data—not merely its scale—are the primary drivers of a model’s advanced capabilities, from complex reasoning to reliable instruction following. However, acquiring and curating such high-quality data remains a significant bottleneck. This tutorial provides a comprehensive and practical guide to the state-of-the-art in data research directions for LLMs. We structure the tutorial around the two core pillars of modern data strategy: intelligent data selection and advanced data synthesis. In the first part, we delve into methods for curating the most valuable information from vast, noisy datasets, covering techniques like LLM-as-a-judge for automated quality filtering and active learning for maximizing annotation efficiency. The second part explores the synthetic data revolution, detailing paradigms that range from generating complex reasoning traces (e.g., Chain-of-Thought) to deploying sophisticated multi-agent workflows that can autonomously create high-quality, diverse instruction data from raw seeds. Finally, we will conclude with a practical overview of open-source tools and platforms that facilitate these data-centric workflows, empowering researchers and practitioners to build better models through better data. Attendees will leave with a principled framework and actionable insights for designing and implementing the advanced data strategies required to build the next generation of powerful, specialized, and aligned LLMs.

cs.CL · cs.MA

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-tutorials.3ACL Anthology · ACL 2026

Towards Effective and Efficient Multi-Agent Language Model Systems: Foundations, Prospects, and Applications

Xuan Wang Virginia Tech, Shuxiang Cao NVIDIA, Yuchen Zhuang Google DeepMind, Wenqi Shi University of Texas Southwestern Medical Center

原文摘要

Multi-agent systems powered by large language models (LLMs) offer a promising paradigm for tackling complex reasoning, decision-making, and problem-solving tasks. However, achieving both effectiveness and efficiency in such systems remains a critical challenge. This tutorial introduces recent advances in building effective and efficient multi-agent LLM systems, focusing on three core components. First, we discuss the design of individual LLM agents. We present state-of-the-art techniques for enabling capable agents using efficient and compact LLMs, including model distillation, dynamic routing, and memory- and compute efficient serving, providing a foundation for scalable and responsive agent design under resource constraints. Second, we cover coordination and communication among agents, crucial for collective performance, highlighting methods for improving multi-agent reasoning and decision-making through prompt and graph optimization, sycophancy mitigation, and structured LLM-based frameworks. Last, we explore real-world applications of LLM agents in areas such as industry, healthcare, quantum computing, and various scientific domains.

cs.CL · cs.MA

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-tutorials.4ACL Anthology · ACL 2026

Current Advances in LLM Reasoning

Akhil Arora Aarhus University, Vishrav Chaudhary Meta, Julia Kreutzer Cohere Labs, Nearchos Potamitis Aarhus University, Nouha Dziri Allen Institute for AI, Niket Tandon Microsoft Research

原文摘要

As large language models (LLMs) increasingly tackle reasoning-heavy tasks, from mathematics to commonsense to multilingual understanding, researchers face three pressing questions: How well do models reason? How can we make them reason better? What are the next frontiers in LLM reasoning? This tutorial answers these questions through a unified view of LLM reasoning. This tutorial explores comprehensive evaluation strategies to assess the reasoning abilities of models and discusses two types of methods to improve models’ reasoning: advanced inference time methods, such as structured and self-improvement inference methods, and (ii) post-training methods, such as RLHF, DPO, and GRPO that aim to make LLMs think more like humans. The tutorial explores these technical discussions while maintaining a practical outlook through illustrative demos and short guided hands-on exercises. The tutorial is designed for both researchers and practitioners seeking practical insights into LLM reasoning.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-tutorials.5ACL Anthology · ACL 2026

Knowledge Control for Responsible Generative AI: Bridging Academia, Industry, and Society

Zheyuan Liu University of Notre Dame, Yixin Wan University of California, Los Angeles, Kai-Wei Chang University of California, Los Angeles, Meng Jiang University of Notre Dame, Jieyu Zhao University of Southern California, Nouha Dziri Cohere Labs, Yuning Mao Meta Superintelligence Labs, Jia-Chen Gu University of California, Los Angeles 等 9 位作者

原文摘要

Controlling the knowledge and behavior of generative AI systems, including large language models (LLMs), multimodal LLMs (MLLMs), and text-to-image (T2I) models, has become critical as they are increasingly used in safety-sensitive and socially impactful applications. These models often encode unintended, biased, or private content, leading to harmful or unethical outputs. Post-training knowledge control has thus emerged as a practical framework for selectively modifying or removing model behaviors without full retraining, offering scalable and interpretable interventions for improving safety, privacy, and fairness. This tutorial introduces the foundations of post-training knowledge control and showcases recent frontier methods, bridging research insights with real-world practices from both academia and industry. We cover: (i) key motivations and failure modes, such as harmful generation and stereotype reinforcement; (ii) core methods such as machine unlearning, knowledge editing, and inference-time interventions for targeted behavior adjustment; and (iii) evaluation protocols for balancing forgetting, retention, and fairness. Case studies will span text and vision–language generation, including privacy preservation, bias mitigation, and factual correction.

cs.CL · cs.CV

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) · 2026 · 正式发表

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-tutorials.6ACL Anthology · ACL 2026

The Interplay between Metaphors and NLP

Joanne Boisson Cardiff University, Jose Camacho-Collados Cardiff University, Elisa Sanchez-Bayona University of the Basque Country, Rodrigo Agerri University of the Basque Country

原文摘要

This tutorial will be of the type Introductory to CL/NLP topics, providing an overview of the metaphor processing field. The tutorial will discuss the influence of various metaphor theories on the creation of annotated resources and models. We will particularly focus on recent directions opened by LLMs for metaphor interpretation in multilingual and multimodal settings. Two types of audience may benefit from this tutorial: researchers in the humanities and computational social sciences interested in automatic or semi automatic metaphor analysis, and NLP researchers interested in understanding metaphor processing and improving metaphor modeling.

cs.CL · cs.CV

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 5: Tutorial Abstracts) · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7675软件学报

Int-AD: 面向提示注入攻击的攻防一体化框架

程翔, 曹晟, 陈厅, 李雄, 张小松

原文摘要

提示注入攻击(prompt injection attack)已成为大语言模型(LLM)应用日益严峻的安全威胁, 位于OWASP开放式Web应用程序安全项目10大威胁之首. 此类攻击通过在提示词中嵌入恶意内容来诱导大模型生成误导性输出, 带来信息泄露、系统滥用等严重安全隐患. 然而, 目前针对此类攻击的攻击策略评估指标仅有攻击成功率, 难以全面评估攻击效果; 在防御策略方面, 现有方法通常只能单独用于预防或检测, 两者难以兼得. 深入分析提示注入攻击和防御的特征及其对大模型输出的影响, 提出攻防一体化框架Int-AD, 包括: 采用情感增强和控制输出的提示注入攻击方法CoA (control-output attack)和同时具备预防和检测能力的防御策略UnD (universal defense). 在攻击方面, 定义两个新的攻击评价指标: 攻击干扰率(attack interference rate, AIR)与攻击误导率(attack misdirection rate, AMR), 用于在攻击结果不同时分别进行精准评估, 完善攻击评估指标. 通过情感增强和控制输出设计提示词, 将AIR和AMR与现有METEOR评估指标联合使用来评估CoA的攻击效率; 在防御方面, UnD兼具预防和检测能力, 可提高防御成功率并检测提示注入攻击的影响. 在Qwen、Llama、DeepSeek这3个主流大模型上采用squad和web_questions两个公开数据集进行实验, CoA攻击方法的平均METEOR得分为0.050, 相比当前最好方法Combine可降低42.5%; 平均AIR和AMR分别达到0.97和0.45, 相比Combine分别提升6.59%和28.57%, 表明CoA具有更强的攻击能力. UnD的平均防御成功率达80.6%, 相比当前最好方法Sandwich提高9.07%, 其平均KMR (knownanswer matching rate)为0.921, 较方法Knownanswer提升58.52%, 表明UnD具有更强的防御能力.

cs.* · cs.CL

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7678软件学报

序列推荐启发式数据增强的修复和丰富

党翌洲, 赵楚, 姜琳颖, 马连博, 郭贵冰

原文摘要

启发式数据增强通过扰动原始的用户行为序列并生成新的序列, 能够有效缓解序列推荐中的数据稀疏性. 相比于基于外部信息、利用复杂的增强规则或引入可学习生成模块的增强方法, 启发式方法通过基于人类先验知识、规则或直觉设计的简单操作来完成增强, 具备较高的效率及泛化性. 然而, 现有的启发式数据增强通常面临两个问题: 一是其产生的增强数据与原始数据相比存在语义偏差或重要用户行为丢失的问题, 导致模型学习到不准确甚至是错误的用户偏好; 二是现有方法专注于对稀疏的输入行为进行增强, 模型训练仍受限于标签行为的稀疏性和不匹配问题, 导致推荐性能提升受限. 为此, 提出一种用于修复和丰富序列推荐中启发式数据增强的框架(REDRec). 具体而言, 首先通过实证研究验证启发式推荐方法导致的序列偏好语义偏离, 并证实简单的詹森-香农散度过滤策略即可缓解这一问题. 在此基础上, 设计语义偏移程度感知的修复机制. REDRec以詹森-香农散度量化增强序列的语义偏离程度, 并为不同偏离程度的样本执行基于差异化贝塔分布的嵌入表示插值操作以实现语义修复. 为了丰富增强数据的标签, REDRec对修复后样本执行基于扰动的多轮推理, 通过自适应聚合这些推理结果生成新的软标签. 新的软标签将作为额外的数据添加到模型训练过程中. 在多个代表性骨干网络和真实世界数据集上的实验验证了REDRec的有效性和泛化性.

cs.*

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7685软件学报

SolRaceFuzz: Solana链上程序并发缺陷检测

高旭, 马辰阳, 叶盛, 李晅松, 宋巍

原文摘要

随着Solana区块链应用日益广泛, 虽有工作针对其安全弱点、生态系统、商业应用等方面进行了研究, 但Solana区块链的并发缺陷问题尚未得到足够重视. 研究发现Solana链上程序中存在两类特殊的并发缺陷类型, 分别称为交易顺序依赖缺陷与时钟控制依赖缺陷. 这些缺陷允许区块链网络中的恶意节点合法地针对并发交易交换它们之间的执行顺序, 或推迟特定交易执行到特定时间, 以干涉这些并发交易执行结果. 因此, 具有这些缺陷的Solana链上程序的并发交易可能遭受攻击者的人为控制. 针对上述问题, 分别定义Solana链上程序的交易顺序依赖缺陷和时钟控制依赖缺陷, 并提出一种基于模糊测试与符号执行的检测方法. 该方法包含这两种缺陷的检测准则, 以及针对Solana区块链特点的账本模拟方法与交易生成方法. 基于该方法实现了原型工具SolRaceFuzz, 并在3组数据集上对缺陷发现能力、效率和探索策略这3个方面进行实验, 验证所提方法的有效性.

cs.*

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7686软件学报

DLAKRS: 面向大状态SIMECK分组密码的深度学习辅助密钥恢复方案

杨亚涛, 冉小玉, 范修凤, 王彩冰

原文摘要

近年来, 深度学习为分组密码安全性分析提供了新的研究路径. 然而, 在大状态分组密码场景下, 神经区分器输入维度过高以及密钥搜索空间快速膨胀, 严重制约了深度学习辅助攻击的效率与稳定性. 针对上述问题, 提出面向大状态SIMECK分组密码的深度学习辅助密钥恢复方案DLAKRS. 该方案在训练阶段引入基于梯度的动态敏感比特选择策略, 在保证区分性能的前提下有效压缩神经区分器的输入维度; 在密钥恢复阶段, 结合错误密钥响应分布构建基于统计评分引导的搜索方法, 缓解候选密钥筛选过程中的评分波动. 基于上述方案, 针对SIMECK系列大状态轻量级分组密码构建多阶段深度学习辅助密钥恢复攻击方案. 实验结果表明, 在输入维度削减45.8%–62.5%的情况下, 区分器准确率损失控制在10%以内, 且相较于传统多阶段攻击方法显著降低了计算开销. 在SIMECK48/96的16轮攻击和SIMECK64/128的18轮攻击中, 所提方法均表现出稳定的密钥恢复性能. 研究结果表明, 该方案为大状态SIMECK分组密码的深度学习辅助密钥恢复提供了一种有效途径.

cs.*

软件学报 · 2026 · 正式发表

新论文 · v1arXiv:2606.30645Berkeley BAIR

VLK: Learning Humanoid Loco-Manipulation from Synthetic Interactions in Reconstructed Scenes

Yen-Jen Wang, Jiaman Li, Sirui Chen, Takara E. Truong, Pei Xu, Pieter Abbeel, Rocky Duan, Koushil Sreenath 等 12 位作者

原文摘要

Perception-based humanoid loco-manipulation requires connecting egocentric observations and task instructions to whole-body motion. Learning this mapping requires synchronized egocentric images, language commands, and robot-compatible kinematic trajectories, yet no existing data source provides this complete tuple at scale. We address this bottleneck by generating vision-language-kinematics (VLK) supervision synthetically in reconstructed scenes. Our pipeline leverages 3D Gaussian Splatting to reconstruct metric-scale indoor environments, synthesizes navigation and object-interaction trajectories using privileged scene information, and renders paired egocentric observations after the fact. We produce 48,000 paired trajectories with no human intervention and train a VLK policy that predicts short-horizon whole-body kinematic trajectories. A whole-body tracker converts these predictions into actions on the physical humanoid. We evaluate on the physical Unitree G1 performing navigation and single-object transport, demonstrating that synthesized interactions in reconstructed scenes provide effective supervision for sim-to-real perception-based humanoid loco-manipulation. Project Website: https://vision-language-kinematics.github.io/

cs.RO · cs.AI · cs.GR · eess.SY

版本更新 · v2arXiv:2502.18864Google Research

Co-Scientist:加速科学发现的多智能体AI系统

Accelerating scientific discovery with Co-Scientist

Juraj Gottweis, Wei-Hung Weng, Alexander Daryin, Tao Tu, Petar Sirkovic, Artiom Myaskovsky, Grzegorz Glowaty, Felix Weissenberger 等 51 位作者

AI 速读 基于摘要

基于Gemini的多智能体系统Co-Scientist通过生成、批判和进化假设,在生物医学领域辅助科学家发现新知识。

cs.AI · cs.CL · cs.HC · cs.LG · q-bio.OT

查看原文摘要

Scientific discovery is driven by scientists generating novel hypotheses for complex problems that undergo rigorous experimental validation. To augment this process, we introduce Co-Scientist, a multi-agent AI system built on Gemini for structured scientific thinking and hypothesis generation. Co-Scientist aims to help scientists discover new original knowledge. Conditioned on their research objectives and prior scientific evidence, it formulates demonstrably novel research hypotheses for experimental verification. The system's design involves agents continuously generating, critiquing and refining hypotheses accelerated by scaling test-time compute. Key contributions include: (1) a multi-agent architecture with an asynchronous task execution framework for flexible compute scaling; (2) a tournament evolution process for self-improving hypotheses generation. Automated evaluations show continued benefits of test-time compute scaling, improving hypothesis quality over time. While general purpose, we focus the validation in three biomedical applications: drug repurposing, novel target discovery, and explaining mechanisms of anti-microbial resistance. Specifically, Co-Scientist helped identify new drug repurposing candidates and synergistic combination therapies for acute myeloid leukemia, which were validated through in vitro experiments. These real-world validations demonstrate the potential of Co-Scientist to accelerate scientific discovery and usher in an era of AI empowered scientists.

新论文 · v1arXiv:2606.28277Google Research

迈向自动化科学评审:谷歌论文助手工具

Towards Automating Scientific Review with Google's Paper Assistant Tool

Rajesh Jayaram, Drew Tyler, David Woodruff, Corinna Cortes, Yossi Matias, Vahab Mirrokni, Vincent Cohen-Addad

AI 速读 基于摘要

提出AI与人类在科学评审中协作的四级分类框架,并介绍用于深度科学评审与验证的智能体框架Paper Assistant Tool(PAT)。

cs.LG · cs.AI · cs.CL · cs.CY

查看原文摘要

Artificial intelligence is driving a revolution in scientific discovery, accelerating everything from hypothesis generation to mathematical theorem proving. However, this rapid acceleration is creating a systemic challenge: traditional human peer review cannot scale to match the influx of AI-assisted science. Ultimately, to resolve this tension, we must also deploy AI to accelerate the verification and review process itself. To frame the discussion around this transition, we propose a taxonomy consisting of four progressive levels of AI-human collaboration in scientific evaluation, and discuss various trade-offs involved with each. As a step toward this future, we introduce the Paper Assistant Tool (PAT), an agentic AI framework built for deep scientific review and verification. PAT ingests full scientific manuscripts and produces a comprehensive evaluation, checking theoretical results, validating experiments, suggesting improvements, and identifying potential flaws. By utilizing inference scaling techniques, PAT is able to identify deeper issues than a single model call alone, achieving a 34% improvement over zero-shot recall on mathematical errors in the SPOT benchmark. Pilot deployments of PAT as a pre-submission tool for authors at two major Computer Science conferences -- STOC and ICML -- demonstrate its ability to identify critical errors and suggest substantive improvements to research papers. By catching errors early, PAT eases the cognitive burden placed on referees, while preserving their control over the outcomes of the review process.

新论文 · v1arXiv:2606.27375Berkeley BAIR

Scalable Behavior Cloning with Open Data, Training, and Evaluation

Arthur Allshire, Himanshu Gaurav Singh, Ritvik Singh, Adam Rashid, Hongsuk Choi, David McAllister, Justin Yu, Yiyuan Chen 等 18 位作者

原文摘要

We introduce ABC, a fully open-source stack for manipulation with behavior cloning. At its core is ABC-130K: the largest open-source teleoperation dataset to date, featuring 3,500 hours of data spanning over 130K episodes across 195 diverse tasks. Furthermore, we open-source our accessible hardware setup, training infrastructure, and simulation pipeline. We also release 400 hours of sim-teleop data and provide a co-training recipe that produces correlated simulation and real-world evaluation, offering a reliable proxy for ablating model-design and training decisions before costly real-world evaluation. We explore various training recipes and compare common architectural choices for Diffusion Transformers (DiT) and Vision-Language-Action (VLA) models, grounding our findings in real-world evaluations. The resulting policies successfully execute dexterous tasks such as box folding and extracting credit cards from wallets. By providing a reproducible toolkit, we aim to place researchers on an equal footing, establishing the necessary foundation to learn the ABCs of Behavior Cloning together as a community.

cs.RO

首次观测 · 记录 #1软件学报:jos:7627软件学报

知识图谱推理研究综述: 从单一任务到复杂任务

牛广林, 粟思悦, 李波

原文摘要

知识图谱可以有效组织和利用现实世界中的各类知识, 弥补数据驱动的方法或者大模型技术存在的不可解释和幻觉等不足, 是实现具有理解和推理能力的认知智能系统的核心技术之一. 知识图谱推理是从已有的知识推理出新的知识, 广泛应用于工农业生产、国防安全、日常生活等领域. 早期知识图谱推理领域主要关注单一推理任务, 近3年逐渐开始关注更加复杂的推理任务, 包括时序多步知识图谱推理、小样本多步知识图谱推理、小样本时序知识图谱推理、小样本多模态知识图谱推理、多模态归纳式知识图谱推理和时序归纳式知识图谱推理. 为此, 首先分别描述面向单一任务和复杂任务的知识图谱推理的特点, 进而, 介绍几类面向单一任务的知识图谱推理技术. 然后系统总结面向复杂任务的已有代表性知识图谱推理方法, 并对这些方法进行对比分析. 最后, 总结和探讨当前知识图谱推理仍存在的主要问题, 并对该领域有价值的未来发展方向进行展望.

cs.* · cs.CL · cs.CV

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7672软件学报

差异化图嵌入的多层社交网络影响力最大化方法

林荣华, 姚润彬, 王怡嘉, 林俊杰, 吴正洋, 汤庸

原文摘要

在社交网络分析中, 识别有影响力的节点至关重要. 现有方法通常忽略局部意见领袖的倾向, 导致种子节点的影响力范围重叠. 此外, 在影响力传播强度非均匀的动态场景下, 基于传统图神经网络(graph neural network, GNN)的方法也难以在消息传递过程中对节点的影响力特征进行有效建模和聚合. 同时, 现有技术也未能充分解决社交网络的多层特性和节点异质性问题. 为了应对上述挑战, 提出一种新型的多层影响力最大化方法Inf-MDE. 该方法利用差异化的图嵌入, 采用多层网络结构对社会关系进行建模. 进而, 模型提取节点潜在的影响力传播子图, 以消除节点嵌入和传播动态之间的表征偏差. 此外, Inf-MDE在其GNN设计中融入一种自适应的局部影响力聚合机制. 该机制能够根据局部上下文和影响力强度动态调整消息传递过程中的影响力特征聚合策略, 从而有效地捕捉层间传播异质性和层内扩散动态. 在4个不同的多层社交网络数据集上进行的大量实验表明, Inf-MDE的性能显著优于现有基线方法. 源代码已公开, 详见https://github.com/lyao972/Inf-MDE.

cs.*

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7684软件学报

面向大语言模型生成能力提升的检索增强生成研究进展

刘澳迪, 奚雪峰, 周国栋

原文摘要

随着深度学习和Transformer架构的不断发展, 基于大语言模型的自然语言处理任务取得了显著进展, 但依然存在着认知幻觉、信息滞后和专业领域知识缺乏等问题. 为解决这些问题, 通过引入外部知识库的检索机制, 检索增强生成技术使模型不仅借助已有的知识, 还能实时检索外部数据, 从而提高生成内容的准确性、时效性及适应性. 本文探讨了检索增强生成技术在提升大语言模型生成能力中的作用. 首先, 从检索增强和增强生成两个方面, 对不同检索目标的检索方法及增强生成的多种技术路径进行系统性分类; 随后, 分析总结检索增强生成技术的原理、实现方式以及其在多个领域的应用; 最后, 在多个领域探讨检索增强生成技术已有的应用成效、面临的挑战及未来的发展前景.

cs.* · cs.CL

软件学报 · 2026 · 正式发表

版本更新 · v2arXiv:2606.22998Berkeley BAIR

TEXEDO : Test Time Scaling for Controller-aware Language-conditioned Humanoid Motion Generation

Jianuo Cao, Yuxin Chen, Yuzhen Song, Masayoshi Tomizuka, Chenran Li, Thomas Tian

原文摘要

Text-conditioned motion generation is a promising interface for programming humanoid robots, yet current generators are often trained on human motion datasets retargeted to robot morphologies. Although such data provides rich semantic and kinematic priors, it fails to capture the nuances of whole-body tracking controllers, including balance, contact dynamics, actuation limits, and controller-specific failure modes. As a result, generated motions can be semantically plausible but difficult or impossible for the robot to execute. We introduce TEXEDO, a test-time scaling framework for humanoid motion generation that improves motion quality without requiring a stronger underlying generator. Given a text prompt, TEXEDO samples multiple candidate motions from a pretrained text-conditioned generator and selects the best motion that is both executable and task-aligned. The reward model combines a dynamic feasibility verifier, distilled from whole-body tracking rollouts to predict physical executability, with a semantic alignment verifier that measures text-motion alignment in a learned co-embedding space. Our pipeline treats dynamic feasibility as a hard constraint and semantic alignment as the selection objective within the feasible set. Through large-scale simulation studies and real-world deployment on a Unitree G1 humanoid robot, we show that TEXEDO consistently improves both tracking fidelity and text alignment. These results demonstrate that grounded verification is an effective path toward deployable language-guided humanoid motion generation. Project website: https://jianuocao.github.io/TEXEDO/

cs.RO

版本更新 · v2arXiv:2602.14080Google Research

Empty Shelves or Lost Keys? Recall Is the Bottleneck for Parametric Factuality

Nitay Calderon, Eyal Ben-David, Zorik Gekhman, Eran Ofek, Gal Yona

原文摘要

Standard factuality evaluations of LLMs treat all errors alike, obscuring whether failures arise from missing knowledge (empty shelves) or from limited access to encoded facts (lost keys). We propose a behavioral framework that profiles factual knowledge at the level of facts rather than questions, characterizing each fact by whether it is encoded, and then by how accessible it is: cannot be recalled, can be directly recalled, or can only be recalled with inference-time computation (thinking). To support such profiling, we introduce WikiProfile, a new benchmark constructed via an automated pipeline with a prompted LLM grounded in web search. Across 4 million responses from 13 LLMs, we find that encoding is nearly saturated in frontier models on our benchmark, with GPT-5 and Gemini-3 encoding 95--98% of facts. However, recall remains a major bottleneck: many errors previously attributed to missing knowledge instead stem from failures to access it. These failures are systematic and disproportionately affect long-tail facts and reverse questions. Finally, we show that thinking improves recall and can recover a substantial fraction of failures, indicating that future gains may rely less on scaling and more on methods that improve how models utilize what they already encode.

cs.CL · cs.AI

版本更新 · v2arXiv:2604.14615Google Research

用于从可穿戴传感器数据中优先筛选候选生物标志物的AI联合数据科学家

An AI Co-Data-Scientist for Prioritizing Candidate Biomarkers from Wearable Sensor Data

Yubin Kim, Salman Rahman, Samuel Schmidgall, Chunjong Park, A. Ali Heydari, Ahmed A. Metwally, Hong Yu, Xin Liu 等 36 位作者

AI 速读 基于摘要

CoDaS是一个在人类监督下整合多智能体假设生成、确定性统计分析、对抗性验证与文献解读的AI联合数据科学家,用于从可穿戴设备数据中优先筛选与心理健康和代谢终点相关的候选生物标志物关联。

cs.AI

查看原文摘要

Wearable devices generate continuous physiological and behavioral data, but converting these signals into clinically reviewable biomarker hypotheses remains labor-intensive. We introduce CoDaS, an AI co-data-scientist that integrates multi-agent hypothesis generation, deterministic statistical analysis, adversarial validation and literature-grounded interpretation under human oversight. Across three wearable cohorts comprising 9,279 participant-observations, CoDaS prioritized candidate associations for mental-health and metabolic endpoints after internal checks for replication, stability, robustness and leakage. The system identified related circadian-instability signals associated with depression, including sleep-duration variability in DWB ($ρ$ = 0.252, $p$ < 0.001) and sleep-onset variability in GLOBEM ($ρ$ = 0.126, $p$ < 0.001), and derived a wearable cardiovascular-fitness index associated with insulin resistance (steps/resting heart rate; $ρ$ = -0.374, $p$ < 0.001). Adding these features to demographic models produced modest gains ($ΔR^2$ = 0.040 for depression, 0.021 for insulin resistance). In a 12-clinician review totaling approximately 25 active hours, clinician validity judgments aligned with CoDaS confidence tiers ($ρ$ = 0.67, $p$ = 0.005), whereas added clinical value and confidence to act were rated lower. CoDaS supports traceable, hypothesis-generating prioritization of wearable candidate biomarkers.

版本更新 · v2arXiv:2606.17055Berkeley BAIR

T-Rex: Tactile-Reactive Dexterous Manipulation

Dantong Niu, Zhuoyang Liu, Zekai Wang, Boning Shao, Zhao-Heng Yin, Anirudh Pai, Yuvan Sharma, Stefano Saravalle 等 34 位作者

原文摘要

The ability to react dynamically to tactile signals has long been considered crucial to agile human-level dexterity. Yet contemporary learning-based Vision-Language-Action (VLA) models for robotic manipulation generally either overlook the tactile modality or are limited to encoders with static cues, due in part to the scarcity of diverse training data and standardized evaluation, architectural constraints in current VLA models, and limitations of static tactile encoders. In this paper, we push the frontier of tactile-reactive manipulation by addressing all of these limitations. We propose a large-scale, 100-hour tactile-rich dataset collected via a novel, data-efficient recipe that prioritizes elementary motor primitives. To effectively exploit naturally high-frequency touch signals without sacrificing the existing capabilities of existing VLAs, we introduce a variable-rate Mixture-of-Transformers (MoT) architecture equipped with a novel temporal tactile VQ-VAE encoder. We demonstrate the effectiveness of tactile-reactive policies on 12 manipulation tasks requiring delicate force control and deformable object manipulation, achieving over 30% higher average success rate than the strongest baseline.

cs.RO

版本更新 · v3arXiv:2603.04531Berkeley BAIR

PTLD: Sim-to-real Privileged Tactile Latent Distillation for Dexterous Manipulation

Rosy Chen, Mustafa Mukadam, Michael Kaess, Tingfan Wu, Francois R Hogan, Jitendra Malik, Akash Sharma

原文摘要

Tactile dexterous manipulation is essential to automating complex household tasks, yet learning effective control policies remains a challenge. While recent work has relied on imitation learning, obtaining high quality demonstrations for multi-fingered hands via robot teleoperation or kinesthetic teaching is prohibitive. Alternatively, with reinforcement we can learn skills in simulation, but fast and realistic simulation of tactile observations is challenging. To bridge this gap, we introduce PTLD: sim-to-real Privileged Tactile Latent Distillation, a novel approach to learning tactile manipulation skills without requiring tactile simulation. Instead of simulating tactile sensors or relying purely on proprioceptive policies to transfer zero-shot sim-to-real, our key idea is to leverage privileged sensors in the real world to collect real-world tactile policy data. This data is then used to distill a robust state estimator that operates on tactile input. We demonstrate from our experiments that PTLD can be used to improve proprioceptive manipulation policies trained in simulation significantly by incorporating tactile sensing. On the benchmark in-hand rotation task, PTLD achieves a 182% improvement over a proprioception only policy. We also show that PTLD enables learning the challenging task of tactile in-hand reorientation where we see a 57% improvement in the number of goals reached over using proprioception alone. Website: https://akashsharma02.github.io/ptld-website/.

cs.RO

新论文 · v1arXiv:2606.19333Berkeley BAIR

Do as I Do: Dexterous Manipulation Data from Everyday Human Videos

Bhawna Paliwal, Haritheja Etukuru, William Liang, Pieter Abbeel, Nur Muhammad Mahi Shafiullah, Jitendra Malik

原文摘要

How can we scalably generate data for robotic manipulation, especially on human-like platforms such as dexterous multi-fingered hands? Learning from human videos has recently emerged as a likely answer to this question. However, difficulties in estimating hand-object interaction and crossing the human-to-robot embodiment gap have hindered the adoption of abundant monocular RGB-only human videos as the primary source of robot manipulation data. In this work, we present DO AS I DO, an algorithm to reconstruct and retarget monocular RGB human videos to multi-fingered dexterous robotic hands. DO AS I DO reconstructs hand-object interactions from various egocentric and exocentric in-the-wild video sources. The algorithm then retargets these hand-object interaction estimates into a sequence of actions executable in the real world, yielding robot-complete manipulation data from disparate human videos. Overall, DO AS I DO outperforms previous state of the art in estimating hand-object interactions and extracting dexterous manipulation trajectories from RGB videos, as we show in experiments on datasets with ground truths and on a dataset of video clips collected online. Our experiments enable us to propose an efficacy playbook for practitioners collecting human data for manipulation.

cs.RO · cs.CV

版本更新 · v3arXiv:2508.04086Google Research

ToolGrad:利用文本“梯度”高效生成工具使用数据集

ToolGrad: Efficient Tool-use Dataset Generation with Textual "Gradients"

Zhongyi Zhou, Kohei Uehara, Haoyu Zhang, Jingtao Zhou, Lin Gu, Ruofei Du, Zheng Xu, Tatsuya Harada

AI 速读 基于摘要

ToolGrad 提出“先答案后问题”的智能体框架,通过文本“梯度”迭代构造有效工具调用链,再反向合成用户查询,从而低成本生成高质量工具使用数据集。

cs.CL

查看原文摘要

Prior work synthesizes tool-use LLM datasets by first generating a user query, followed by complex tool-use annotations like depth-first search (DFS). This leads to inevitable annotation failures and low efficiency in data generation. We introduce ToolGrad, an agentic framework that inverts this paradigm. ToolGrad first constructs valid tool-use chains through an iterative process guided by textual "gradients", and then synthesizes corresponding user queries. This "answer-first" approach led to ToolGrad-500, a dataset generated with more complex tool use, lower cost, and almost 100% pass rate. Experiments show that ToolGrad models outperform those trained on expensive baseline datasets and proprietary LLMs. The ToolGrad source code, dataset, and models are available at https://github.com/zhongyi-zhou/toolgrad.

版本更新 · v3arXiv:2505.04021Google Research

Prism: Cost-Efficient Multi-LLM Serving via GPU Memory Ballooning

Shan Yu, Yifan Qiao, Mingyuan Ma, Yangmin Li, Shuo Yang, Xinyuan Tong, Yang Wang, Zhiqiang Xie 等 21 位作者

原文摘要

Inference providers must maintain availability for many LLMs, including low-volume but essential models, making resource efficiency increasingly important as token prices fall. Analysis of production traces reveals a dynamic bursty-group pattern in which sets of models become active together and shift over time; existing space- and time-sharing approaches lack principled mechanisms to adapt to this variability, forcing trade-offs between SLO adherence and efficiency. We observe that elastic memory allocation can unify spatial and temporal sharing. Based on this insight, we have developed Prism, a memory-centric LLM co-serving framework that applies memory ballooning to reclaim memory across models and support both forms of sharing under a single scheme. Prism's balloon driver, referred to as kvcached, has been open-sourced at https://github.com/ovg-project/kvcached, and deployed in production environments across 10K+ GPUs.

cs.DC · cs.AI · cs.LG · cs.PF