跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

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

找到 11 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v4arXiv:2407.10204

Improving Graph Out-of-distribution Generalization Beyond Causality

Can Xu, Yao Cheng, Jianxiang Yu, Haosen Wang, Jingsong Lv, Yao Liu, Xiang Li

原文摘要

Existing methods for graph out-of-distribution (OOD) generalization primarily rely on empirical studies on synthetic datasets. Such approaches tend to overemphasize the causal relationships between invariant sub-graphs and labels, thereby neglecting the non-negligible role of environment in real-world scenarios. In contrast to previous studies that impose rigid independence assumptions on environments and invariant sub-graphs, this paper presents the theorems of environment-label dependency and mutable rationale invariance, where the former characterizes the usefulness of environments in determining graph labels while the latter refers to the mutable importance of graph rationales. Based on analytic investigations, a novel variational inference based method named ``Probability Dependency on Environments and Rationales for OOD Graphs on Real-world Data'' (DEROG) is introduced. To alleviate the adverse effect of unknown prior knowledge on environments and rationales, DEROG utilizes generalized Bayesian inference. Further, DEROG employs an EM-based algorithm for optimization. Finally, extensive experiments on real-world datasets under different distribution shifts are conducted to show the superiority of DEROG. Our code is publicly available at https://github.com/LEOXC1571/DEROG.

cs.LG

新论文 · v1arXiv:2611.13524

The RSI Tax: When Recursive Self-Improvement Is Not Worth the Cost

Yitong Zhang, Ang Li, Yisen Wang

原文摘要

Recursive self-improvement (RSI) seeks to improve an agent using its own task experience. Its practical value depends on whether performance gains justify the full cost of self-improvement and task execution. We evaluate this trade-off on continual task streams, scoring each task before its feedback is used for subsequent updates. We define the \emph{RSI Tax} as the token cost of the self-improvement process and include it alongside task-execution costs in end-to-end evaluation. Across six methods and two language models, a bounded-note baseline matches or exceeds the observed accuracy of Meta-Harness, EvoSkill, and RRSI, with mean total-token savings of 65.6-71.0\%. We decompose the RSI Tax into verification, exploration, and writing costs, and track subsequent use of the associated state or artifact. For these three RSI methods, verification accounts for 74.8--93.6% of the aggregate RSI Tax. A substantial share of the RSI Tax is also associated with states or artifacts that are not used later in the evaluated streams. These results expose a practical limitation of costly RSI procedures: improvements in the deployed agent need not justify the expense of the improvement process. They motivate RSI objectives that jointly optimize the RSI Tax and expected task-execution cost while ensuring continued growth in agent capabilities across the task stream.

cs.LG

新论文 · v1arXiv:2611.10908

Beyond Real or Fake: A Dual-Channel Authenticity and Reasoning Protocol for Photographic Assessment

Xiaoxiao Li, Ruinan Jin, Lili Meng, Miaosen Wang, Athula Balachandran, Pei Cao

原文摘要

Forensic verification has converged on a binary "real vs. fake" label that confates fully synthetic, tampered, and AI-retouched images despite their very different consequences. We argue that GenAI manipulations decompose along two complementary channels: a camera channel of sensor fingerprints (destroyed by neural processing), and a semantic channel of scene-level coherence (disrupted by content edits). Each manipulation type leaves a distinctive two-channel signature. We instantiate this taxonomy in 2CAP (2-Channel Authenticity Protocol), pairing a contrastively-trained camera encoder with a frozen semantic encoder to serve two applications on a shared backbone: (i) four-class authenticity classification via cross-attention fusion with learnable reliability weights; and (ii) evidence generation, where an authentic image serves as a reference for a query and the two encoders produce per-channel alignment scores together with a patch-level saliency map. These signals are supplied as privileged context to a frozen Vision-Language Model (VLM) through an Observe-Generate-Refine loop, yielding explanations with localization without forensic fine-tuning. On a multi-source benchmark, 2CAP attains the best classification performance, including strong retouching detection where existing methods fail, and improves explanation quality.

cs.CV

版本更新 · v3arXiv:2602.13739

XIT: Exploration and Exploitation Informed Trees for Active Gas Distribution Mapping in Unknown Environments

Mal Fazliu, Matthew Coombes, Sen Wang, Cunjia Liu

原文摘要

Mobile robotic gas distribution mapping (GDM) provides critical situational awareness during emergency responses to hazardous gas releases. However, most systems still rely on teleoperation, limiting scalability and response speed. Autonomous active GDM is challenging in unknown and cluttered environments, because the robot must simultaneously explore traversable space, map the environment, and infer the gas distribution belief from sparse chemical measurements. We address this by formulating active GDM as a next-best-trajectory informative path planning (IPP) problem and develop XIT (Exploration and Exploitation Informed Trees), a sampling-based planner that grows a single shared tree toward multiple frontier goals, coupling exploration of unresolved regions with informative gas sampling en route. XIT draws a batch of samples from an Upper Confidence Bound (UCB) information field derived from the current gas posterior and expands the tree using a cost that trades off travel effort against information acquisition. To enable plume-aware exploration, we introduce the gas frontier concept, defined as unobserved regions adjacent to high gas concentrations, and propose the Wavefront Gas Frontier Detection (WGFD) algorithm for their identification. High-fidelity simulations demonstrate the benefits of XIT in terms of GDM quality and efficiency, and a scaled real-world experiment demonstrates its practicality. Although developed for active GDM, XIT is applicable to other robotic information-gathering tasks in unknown environments that face the exploration and exploitation trade-off.

cs.RO · eess.SY

新论文 · v1arXiv:2611.06445

SUMONE: A Simple and Efficient Summarizer for Plug-and-Play Agent Memory

Jizhe Zhang, Ang Li, Chenheng Zhang, Yisen Wang

原文摘要

Long-horizon language-model agents accumulate increasingly large interaction histories, making context compaction essential for efficient execution. Existing learned compaction methods often rely on downstream task outcomes or solver behavior, coupling training to specific tasks or agents. We introduce SumOne, a standalone summarizer trained to preserve information in agent histories through masked reconstruction. Given a summary of the expired history, a frozen reconstructor recovers randomly masked portions of the original trajectory; reconstruction quality, combined with a length penalty, provides a task-agnostic reward for optimizing the summarizer with GRPO. This yields self-supervision directly from raw trajectories, without reference summaries or downstream task execution. At inference time, only the lightweight summarizer is retained, enabling plug-and-play context compression for otherwise unchanged agents. We conduct a systematic evaluation of SumOne in long-horizon search and software-engineering tasks. SumOne reduces estimated inference cost by approximately 78\% on DeepSearchQA and 75\% on SWE-bench Verified relative to operating with full context, with absolute decreases of 0.04. The same checkpoint also transfers across downstream models and agent harnesses without additional fine-tuning.

cs.AI

版本更新 · v2arXiv:2609.08850

Matching in Context: Temporal Fusion and Query Adaptation for Training-Free Video Temporal Grounding

Zhuo Cao, Bingqing Zhang, Sen Wang, Xue Li

原文摘要

Text-guided Video Temporal Grounding (VTG) localizes moments in an untrimmed video that correspond to a text query. Supervised approaches require costly temporal annotations and task-specific training, yet can generalize poorly under distribution shift. To reduce this dependence on task-specific supervision, training-free approaches use pretrained vision-language models to localize moments by measuring the similarity between video and query features. However, independently encoded frames provide limited temporal context, while a fixed query embedding can assign similar scores to different candidate moments within the video. To address these limitations, we propose DSE-VTG, a \underline{D}ual-\underline{S}ide \underline{E}nhancement framework that combines visual evidence across temporal granularities with video-specific query adaptation, without task-specific training. On the visual side, Multi-scale Similarity Fusion (MSF) combines frame- and clip-level similarities into a unified, temporally aware similarity profile. On the query side, Query-level Test-Time Adaptation (Q-TTA) uses pseudo-labels to optimize a lightweight additive offset for more discriminative matching within the video, without fine-tuning the backbone or calling external large language models. Experiments on three standard and two out-of-distribution (OOD) benchmarks show gains over the prior training-free methods. On Charades-STA, DSE-VTG improves mIoU by 5.89 percentage points over the strongest compared baseline under the same backbone. Under distribution shift, DSE-VTG reaches 50.86 mIoU on Charades-CG Novel-Word, surpassing the strongest supervised baseline by 2.76 mIoU. Our code will be released upon acceptance.

cs.CV

新论文 · v1arXiv:2611.03165

LaBraM at Scale: Scaling Data and Models for EEG Pretraining

Jun-Yu Pan, Ruicheng Yin, Bao-Liang Lu, Dongsheng Li, Wei-Long Zheng, Yansen Wang

原文摘要

LaBraM, an early EEG foundation model, demonstrated that large-scale EEG pretraining can yield strong representations for diverse downstream tasks. Building on this foundation, we expand pretraining data and model capacity while retaining its core encoder and objective. We train ten encoders with 5.8 million to 1.97 billion parameters on three EEG collections spanning 25,067 to 79,910 hours, adapting signal preparation and training to heterogeneous recordings. Across 23 tasks, Atom-L* reaches 59.05% mean balanced accuracy at its best evaluated full fine-tuning (Full-FT) checkpoint, 3.61 percentage points above the strongest baseline EEG foundation model. Quark-G leads linear probing (LP) at 54.33%, a 1.24-point margin. Both also lead average task rank. At the last evaluated checkpoints, larger encoders improve Full-FT more consistently than LP, and stronger LP does not guarantee stronger Full-FT. Preserving patch structure improves LP over average pooling. Data-fraction experiments suggest capacity-dependent saturation, while checkpoint trajectories show that downstream performance can decline as pretraining loss falls. Joint classification with a shared Qwen3 readout reaches 50.50% with Molecule-H and Qwen3-8B; increasing language-model size provides no consistent gain. These results demonstrate the value of scaling LaBraM and the importance of matching pretraining scale to downstream adaptation.

cs.LG · cs.AI

新论文 · v1arXiv:2610.35518

S3AC: Stabilized, Selective, and Scalable Actor-Critic for LLM Reasoning

Shuo Shen, Guangran Cheng, Chengqi Lyu, Xiangsen Wang, Yanan Sun, Wenwei Zhang

原文摘要

Critic-free methods are widely used in reinforcement learning with verifiable rewards (RLVR) for long chain-of-thought (CoT) reasoning, avoiding difficult and costly critic training. Common alternatives lack token-level credit assignment and typically rely on grouped rollouts to estimate prompt-specific baselines. A critic can address both limitations, but long-CoT critic training is hindered by insufficient coverage of trajectories with diverse lengths and early gradients dominated by the newly initialized value head. We introduce S3AC (Stabilized, Selective, and Scalable Actor-Critic) for LLM reasoning, built around a practical critic-training recipe. The trained critic provides token-specific advantages and prompt-specific baselines. Using the prompt-level baseline to estimate difficulty, we propose Difficulty-Aware Prompt Sampling (DAPS). DAPS combines this estimate with outcome history to select prompts before generation, reducing rollout waste without offline difficulty initialization. S3AC improves group-rollout performance across dense and mixture-of-experts models from 1.5B to 397B parameters, outperforming a modern GRPO variant (GRPO-X). At 35B, it sustains single-rollout training while tested critic-free baselines deteriorate after initial gains.

cs.LG · cs.CL

新论文 · v1arXiv:2610.34621

Dynamics-Aware Sampling and Recovery for Tensor-Valued Dynamical Systems

Seok-Young Chung, Longxiu Huang, Yisen Wang

原文摘要

We study sampling and recovery for tensor-valued dynamical systems evolving under the t-product, using partial spatial observations over time. Although the t-product Fourier transform yields slicewise matrix dynamics, recovery does not generally decouple across slices. Eigenvalues shared across Fourier-domain frontal slices couple the corresponding eigenspaces into aggregated spectral blocks, which determine the tensor-specific recovery geometry and space--time tradeoff. We establish deterministic identifiability conditions for the initial tensor state. In the diagonalizable case, these are frame conditions on the aggregated blocks. We extend them to non-diagonalizable systems through generalized eigenspaces and Jordan structure. A temporal--spectral factorization of the finite-horizon stacked recovery system underlying Tensor Dynamical Sampling (DS) yields a decoupled two-stage formulation once the temporal threshold is reached. Under independent spatial subsampling, we prove high-probability recovery guarantees using empirical Gram matrices on the aggregated blocks. The bounds depend on aggregated multiplicities, incoherence, and population conditioning. Stability estimates separate the spatial frame factor from the temporal Vandermonde factor and show that increasing temporal depth may worsen numerical conditioning even after identifiability is ensured. We implement Tensor DS and evaluate it on synthetic and real data. Phase transitions track the predicted blockwise sampling thresholds, and stability experiments illustrate Vandermonde conditioning. Experiments on sea surface temperature and turbulence velocity data show that a learned t-product system operator generally yields more accurate and structurally faithful reconstructions than vectorized low-rank, Tucker-type, graph-regularized, graph-spectral, and vectorized dynamical sampling baselines.

math.NA · cs.IT

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

Flow-Based Page Unique Semantic Mapping Architecture for Document Visual Question Answering

Haosen Wang, Jing Xiao, Chaochao Du, Xiaowang Zhang Tianjin University, China, Zhiyong Feng Tianjin University

原文摘要

Document Visual Question Answering (DocVQA) aims to generate answers by jointly understanding the textual, layout, and visual elements within document images. Although end-to-end vision-based generative methods have reduced dependency on OCR, they still struggle to achieve precise evidence localization when page semantics are complex and highly similar. However, existing research lacks an in-depth theoretical analysis of the question-driven semantic representation space, failing to fundamentally address the distinguishability problem among semantically similar pages. To fill this theoretical gap, we propose and prove that, given a specific question, each page possesses a unique semantic representation, and there exists a bijective mapping between the page and its unique semantics. Based on this theoretical foundation, we introduce the Flow-Based Page Unique Semantic Mapping Architecture (FUMA), which reconstructs evidence localization from similarity-based retrieval into precise selection on unique semantics. FUMA employs fine-grained cross-modal attention to extract discriminative cues and utilizes flow-based reversible transformations with likelihood regularization to learn bijective mappings, ensuring that each page obtains a unique semantic representation. Moreover, a multi-expert collaboration mechanism complementarily models fine-grained multimodal information within each page, achieving robust answer generation. Experimental results demonstrate that FUMA significantly outperforms existing methods in both evidence localization and answer generation.

cs.CL · cs.CV

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.360ACL Anthology · ACL 2026

ChessArena: A Chess Testbed for Evaluating Strategic Reasoning Capabilities of Large Language Models

Jincheng Liu, Sijun He Tencent, Jingjing Wu, Xiangsen Wang, Yang Chen, Zhaoqi Kuang, Siqi Bao, Yuan Yao

原文摘要

Recent large language models (LLMs) have shown strong reasoning capabilities. However, a critical question remains: do these models possess genuine strategic reasoning, or do they primarily excel at pattern recognition? To address this, we present ChessArena, a chess-based testbed for evaluating LLMs. Chess demands strategic reasoning, precise rule adherence, and the ability to track complex game states. ChessArena is a competitive framework where LLMs play against each other under four play modes. We evaluate 13 LLMs across over 800 games, testing basic understanding, move selection, and puzzle solving. Results reveal significant shortcomings: no model beats Maia-1100 (human amateur level), and some lose to random play. We also present a strong baseline: our fine-tuned Qwen3-8B substantially improves performance, approaching much larger state-of-the-art reasoning models.

cs.CL

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