跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1170新增论文
+937其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 15:04各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 15:04库内论文最新更新时间:2026-11-19 02:59

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

27,409 已收录论文22,787 AI 相关8,342 有修订112 HF 社区发现

浏览论文库

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

找到 11 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
新论文 · v1arXiv:2611.20773

When Does Interaction Help? Toward a Reynolds Number for Collective Intelligence

Xuening Wu, Haode Yang, Yanlan Kang, Shenqin Yin

原文摘要

Multi-agent systems combine distributed information through interaction, which can improve performance but also spread errors or suppress useful differences. Predicting when interaction helps is central to understanding and designing collective intelligence. We investigate whether a few dimensionless parameters can predict gains over explicitly defined non-communicating baselines across group sizes, network structures, and tasks, toward a Reynolds-number-like description of collective intelligence. Using distributed classification tasks, stochastic tracking networks, and neural cellular automata, we combine analytical and empirical evidence to examine information sufficiency, dynamical applicability, and finite-sample prediction. We construct inference systems with bounded random variables and matching specified joint moments up to total degree three, yet opposite interaction gains under a fixed readout. These moments alone cannot generally determine the gain sign. Tracking networks likewise exhibit gain reversals despite matched candidate parameters when task power occupies different spectral modes. Under concentrated task spectra and aligned observation noise, however, we derive a low-dimensional similarity relation with an explicit zero-delay error bound and test it across network sizes and topologies under frozen protocols. The relation does not directly apply to the neural cellular systems, where a separate moment-based predictor underperforms direct gain measurement at matched calibration sample budgets. These results establish conditions and limits for low-dimensional gain prediction, providing a restricted similarity law while leaving a general Reynolds-number-like description of collective intelligence open.

cs.MA

新论文 · v1arXiv:2611.19636

ROUNDS: Source-Framed Diagnostic Revision after Multi-Turn Clinical Evidence

Jinrui Fang, Runhan Chen, Yining Wu, Jiawei Xu, Xu Yang, Jian Yu, Wenqi Shi, Ying Ding 等 9 位作者

原文摘要

Large language models (LLMs) achieve high scores on medical benchmarks, but does this performance translate into reliable diagnosis as a conversation unfolds? In diagnostic conversations, users can provide clinical findings across multiple turns, ask for a diagnosis without supplying answer options, and introduce opinions from others. Models must therefore form diagnoses from the available evidence and decide how to respond to subsequent advice. We introduce ROUNDS, a framework that evaluates these abilities after a fixed sequence of clinical evidence delivered over multiple turns. ROUNDS compares diagnosis with and without answer options, presents the same incorrect diagnosis under clinician and lay framing, and varies support for competing diagnoses in written five-clinician panels. Across seven models and 1,035 cases from five datasets, average accuracy was 76.9% with answer options and 57.0% without them. Clinician-framed misleading advice produced lower final accuracy than lay-framed advice in every model, with differences of 4.6 to 38.2 percentage points. Initially correct diagnoses more often became incorrect answers than abstentions, and many adopted the suggested disease. Conversely, accuracy increased as more panel members supported the correct diagnosis, including when the majority opinion remained unchanged. These findings reveal a gap between medical benchmark performance and reliable diagnosis in conversation: models respond to external opinions, but remain vulnerable to abandoning correct diagnoses without new clinical evidence.

cs.CL · cs.AI

新论文 · v1arXiv:2611.13794

AnchorMTS: Multi-View Signal Representation and Forecast-Anchored Fusion for Long-Term Time-Series Forecasting

Gao Wu, Tingting Xu, Changning Wu, Tengfei Long, Yong Liu, Jiabin Jin, Kexin Zhang

原文摘要

Long-term time-series forecasters typically optimize a single numerical representation, even though the same history exposes complementary geometry, recurrence, and semantic structure. We propose AnchorMTS, which derives self-aligned visual and textual views from each observed window and uses them only to refine a complete numerical forecast. A trainable evidence path produces a candidate forecast, while a parameter-free output projection enforces an exact per-variable bound on its displacement from the numerical anchor. Across six benchmarks and four horizons, AnchorMTS achieves the best macro MSE/MAE (0.336/0.367) among seven supervised baselines and wins 18 of 24 MSE settings against the cellwise baseline envelope; removing the auxiliary path raises macro MSE to 0.340. The projection leaves 95.8% of candidate refinements unchanged while yielding zero bound violations, showing that complementary multi-view evidence can improve forecasting while its final influence remains explicitly controlled.

cs.LG

新论文 · v1arXiv:2611.11488

A note on exact external information complexity

Henning Wunderlich

原文摘要

We study the prior-free zero-error private-coin external information complexity $B(f)$ of finite two-party functions, with correctness on every input. An elementary rectangle/entropy argument gives $B(\mathsf{AND})=\log_2 3$. A complete classification of Boolean $3\times3$ matrices leaves, up to input permutations and output complementation, only the two-overlapping-rectangles function $F$ without an exact value. An entropy potential and a finite rational protocol give $2.1212661667060486842\ldots\le B(F)<2.130998318$. We also determine its deterministic external information and zero-error communication costs. A separate product-prior certificate and internal-information additivity yield $R_0^{\mathrm{pub}}(F^{\times t})\ge2.021991187178562\ldots\,t$, strictly exceeding the fractional-cover rate $2t$.

cs.CC

版本更新 · v2arXiv:1205.0903

A note on a problem in communication complexity

Henning Wunderlich

原文摘要

We study bounded-error randomization and majority operators in structural communication complexity. We give a communication-complexity formulation of Tarui's theorem and identify the bounded-error closure of weakly unbounded-error communication with a distributional perturbation of logarithmic margin complexity. Retaining the Boolean guarantee in Tarui's probabilistic polynomials yields the stronger inclusion $\mathsf{PH}^{\mathrm{cc}} \subseteq \mathsf{ZP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \subseteq \mathsf{BP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}$. We also define a majority operator satisfying $\mathsf{PP}\mathbin{\cdot} \mathsf{P}^{\mathrm{cc}} = \mathsf{PP}^{\mathrm{cc}}$ and use Sasaki's majority formula to prove that $\mathord{\oplus}\mathsf{P}^{\mathrm{cc}} \subseteq \mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}$. For the inner-product function modulo two, both the outer index and each inner protocol have logarithmic cost. Together with Forster's lower bound, this gives an explicit witness to the non-idempotence of the majority operator and to $\mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \not\subseteq \mathsf{UPP}^{\mathrm{cc}}$. Both the bounded-error closure and the two-level majority class are contained in $\mathsf{PSPACE}^{\mathrm{cc}}$.

cs.CC

新论文 · v1arXiv:2611.05581

BrainBind: Bridging Synchronized EEG and fMRI through Long-Form Naturalistic Video Representations

Shixiao Wang, Rining Wu, Jian K. Liu

原文摘要

Real-world vision is dynamic and scene-rich, while EEG and fMRI resolve it at complementary temporal and spatial scales. Most neural decoding systems, however, align one modality in isolation and mostly against static images or short clips. We study the synchronized case: EEG and fMRI are recorded during the same long-form naturalistic viewing, giving a shared stimulus but also recurring narrative context and many semantically similar candidates. We present BrainBind, a framework that maps synchronized EEG and fMRI into frozen long-form video embedding spaces and treats those spaces as common visual-semantic references, not literal neural codes. On CineBrain, a five-seed Recall@K 2 x 4 matrix across two video anchors and four system configurations shows distinct retrieval profiles. With Omni, fMRI organizes the full candidate list most strongly (MRR = 23.82, nDCG@10 = 25.31), while Joint-Dual gives the highest mean label-aware R@1 (13.52%) with a distinct rank-wide profile. The complementary episode-disjoint evaluation quantifies the contribution of repeated stimulus identity and narrative context to the random split. Across these experiments, proxy choice and system configuration produce distinct top-rank and rank-wide retrieval profiles within the present synchronized dataset. The code is available at https://github.com/Forainest789/Brainbind.

cs.AI · cs.CV

新论文 · v1arXiv:2611.05551

VirtualTrialHarness: Coordinating Agentic Operationalization of Virtual Trial Protocols Across Complex Clinical Schemas

Pengze Li, Jingna Feng, Yue Yu, Yining Wu, Xinyue Hu, Jie Lin, Avanti Bhandarkar, Cui Tao

原文摘要

Virtual trials use routinely collected clinical data to evaluate treatment strategies, but translating a study protocol into an executable analysis requires determining how clinical concepts and study requirements should be represented in the available data and applied consistently across the workflow. These decisions depend on local data representations and operational conventions and can involve source selection, patient and encounter identity, linkage, and temporal interpretation. Here we introduce VirtualTrialHarness (VTHarness), an agent framework that coordinates virtual-trial operationalization by selecting reusable procedural skills for each workflow stage and uses explicit contracts to maintain consistent study decisions across stages. We also introduce VTBenchmark for evaluating source selection and cohort construction. Across three complex synthetic environments, VTHarness successfully produced all required cohort outputs matching the references in 95.1% of workflows after requirement clarification, compared with 60.4% using retrieval from the same procedural corpus. Procedural skills improved source recovery across three language models and increased source overlap with analyst code in 13 Mayo Clinic cases. Site-specific adaptation enabled reference-matched cohort execution across eight MIMIC-IV tasks. Within the Mayo Clinic Virtual Trials Program, the framework supported investigator review of cohort construction and endpoint analysis. These findings support coordinating procedural guidance with workflow decisions to improve virtual-trial implementation across complex clinical schemas.

cs.AI

新论文 · v1arXiv:2611.01441

Renormalized Cellular Intelligence: When Does Model Reduction Preserve Collective Capability?

Xuening Wu, Yanlan Kang, Qianya Xu, Haode Yang, Shan Yu, Shenqin Yin

原文摘要

As multi-agent systems grow in size and complexity, understanding which features of their interactions support collective capability becomes increasingly difficult. Can a simpler description preserve both task performance and the measured contribution of interactions between agents? Preserving collective dynamics alone is insufficient: reduction can alter decision-relevant information or give a non-communicating baseline access to pooled observations, distorting the measured advantage of interaction. We introduce Renormalized Cellular Intelligence (RCI), a framework for specifying and auditing capability preservation across scales. RCI treats the task, interacting dynamics, matched baseline, decision interfaces, and resource budget as a joint object of reduction. It specifies dynamical closure, decision compatibility, and preservation of the intended baseline comparison, and bounds the resulting error in relative capability gain. An exact analytical construction demonstrates task-score preservation, while a counterexample shows how closed reduced dynamics can erase the measured interaction gain. Using cellular systems as models of locally interacting agents, we evaluate three reduction candidates on five frozen learned models without retraining. The final candidate reduces the evolving state from eight to five dimensions per cell (37.5%). Within-run uncertainty bounds support relative gain above a prespecified threshold for the fixed model collection, yet the candidate fails the closure and decision-preservation requirements for a complete RCI certificate. RCI provides explicit criteria for distinguishing positive interaction gains from

cs.MA

新论文 · v1arXiv:2610.37518

World Dreamer v5-lite: A Multi-Robot World Action Model with One Dreamer

Guoning Wu, Zijian Cai, Yuhang Zhang, Ying Liu, Yongbin Zheng

原文摘要

Multi-robot control requires integrating distributed camera views while predicting separate action sequences. Most vision-language-action and world-action models target one robot. Combining multiple views alone does not establish spatial correspondence between them. World Dreamer v5-lite is a multi-robot world-action model built around a shared world state for robot-specific action prediction. Calibrated features from a pretrained video encoder populate this state in workspace coordinates; its spatial size remains fixed as views are added. A vision-language model provides scene context and one query per robot. The queries read the shared state and exchange pose-aware information, while their action streams remain separate. Masked-view cooperative training withholds selected camera views from both visual branches while retaining all action targets. This encourages the use of observations shared by other robots. Pretraining uses more than 10,000 hours of trajectories from 20 simulated robot types, RoboFactory, and real robots. On RoboFactory, World Dreamer v5-lite achieves 74.0% mean success, 23.7 percentage points above the strongest evaluated baseline. Across four real-robot tasks, it reaches 78.8% mean success, a margin of 13.8 points. It also reaches 58.08% overall on RoboCasa365.

cs.RO

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

Quantifying and Improving the Robustness of Retrieval-Augmented Language Models Against Spurious Features in Grounding Data

Shiping Yang, Jie Wu Atlassian Corporation, Wenbiao Ding Microsoft, Ning Wu, Shining Liang Microsoft, Ming Gong Atlassian Corporation, Hongzhi Li Tongji University, Hengyuan Zhang 等 10 位作者

原文摘要

Robustness has become a critical attribute for the deployment of RAG systems in real-world applications. Existing research focuses on robustness to explicit noise (e.g., document semantics) but overlooks implicit noise (spurious features). Moreover, previous studies on spurious features in LLMs are limited to specific types (e.g., formats) and narrow scenarios (e.g., ICL). In this work, we identify and study spurious features in the RAG paradigm, a robustness issue caused by the sensitivity of LLMs to semantic-agnostic features. We then propose a novel framework,SURE, to empirically quantify the robustness of RALMs against spurious features. Beyond providing a comprehensive taxonomy and metrics for evaluation, the framework’s data synthesis pipeline facilitates training-based strategies to improve robustness. Further analysis suggests that spurious features are a widespread and challenging problem in the field of RAG. Our code is available at https://anonymous.4open.science/r/RAG-SpuriousFeatures-62B3.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

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

Writing-RL: Advancing Long-form Writing via Adaptive Curriculum Reinforcement Learning

Xuanyu Lei, Chenliang Li Alibaba Group, Yuning Wu Alibaba Group, Kaiming Liu Tsinghua University, Tsinghua University, Weizhou Shen, Peng Li Tsinghua University, Ming Yan Alibaba Group, Fei Huang Alibaba Group US 等 10 位作者

原文摘要

Recent advances in Large Language Models (LLMs) have enabled strong performance in long-form writing, but current training paradigms remain limited: Supervised Fine-Tuning (SFT) remains constrained by data saturation and performance ceilings, while Reinforcement Learning with Verifiable Reward (RLVR), though successful in verifiable domains like math and code, cannot be directly migrated to open-ended long-form writing due to a lack of ground-truths. To further advance long-form writing, we present Writing-RL: an Adaptive Curriculum Reinforcement Learning framework to advance long-form writing capabilities beyond SFT. The framework consists of three key components: Margin-aware Data Selection strategy that prioritizes samples with high learning potential, Pairwise Comparison Reward mechanism that provides discriminative learning signals in the absence of verifiable rewards, and Dynamic Reference Scheduling approach, which plays a critical role by adaptively adjusting task difficulty based on evolving model performance. Experiments on 7B-scale writer models show that Writing-RL effectively improves long-form writing performance over strong SFT baselines. Furthermore, we observe that models trained with long-output RL generalize surprisingly well to long-input reasoning tasks, potentially offering a promising perspective for rethinking long-context training.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表