跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

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

全站更新概况

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

arXiv 最近完成扫描:2026-11-08 10:17 · 全站最近入库:2026-11-08 06:02各信源进度 →

统计口径与数据新鲜度

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

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

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

17,100 已收录论文14,661 AI 相关4,057 有修订112 HF 社区发现

浏览论文库

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

找到 5 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-08 10:15(北京时间)
新论文 · v1arXiv:2611.08277

LeanContext:在Lean整体证明生成中分离数学资源与局部形式上下文

LeanContext: Disentangling Mathematical Resources from Local Formal Context in Lean Whole-Proof Generation

Hang Zhang, Qihao Ye, Litong Liu, Yunbei Zhang, Yugyung Lee, Yue Zhou, Bowen Liu, Emily First 等 10 位作者

AI 速读 基于摘要

作者提出LeanContext基准,将Lean整体证明生成中的上下文拆分为数学上下文与环境上下文,并考察训练时纳入数学上下文对模型利用目标相关声明的影响。

cs.AI

查看原文摘要

Neural theorem proving increasingly uses retrieved premises and project context to support proof generation. Evaluating these resources requires measuring the advantage of target-selected declarations over comparable alternatives and how this advantage depends on training. We introduce LeanContext, a benchmark of 129,826 Lean whole-proof generation problems, to investigate these questions. We group selected complete preceding mathematical declarations as Mathematical Context (MC) and the remaining selected local source commands as Environment Context (EC). Four aligned input views support crossed training and inference evaluations with shared targets and original Lean verification environments. For both diffusion- and autoregressive-based models, selected declarations outperform comparable alternatives by a larger margin when training includes MC. Final-input audits identify omitted declarations referenced by the target. Prioritizing these dependencies improves Pass@32 by 1.40% and 1.70% for LLaDA and Llama, respectively, on 2,000 targets. The selection experiment operates without access to target reference proofs and holds checkpoints, EC, and inference budgets constant. The code and dataset are available at https://github.com/haaaardcvZ/LeanContext.

新论文 · v1arXiv:2611.07872

A Projection-Coupled 2.5D THB-GIFT and Quadtree-SBIGA Formulation for Moving-Load Analysis in Semi-Infinite Media

Hao Hong, Yanhui Zhong, Bei Zhang, Shuo Xu, Minchuan Tan, Quansheng Zang, Hussein Rappel, Stéphane P. A. Bordas

原文摘要

Moving loads in semi-infinite media generate extended wave fields while complex local structures require fine geometric and spatial resolution. This paper develops a projection-coupled two-and-a-half-dimensional (2.5D) THB-GIFT and quadtree-SBIGA computational formulation that assigns independent discretizations to these regions. The near-field THB-GIFT representation separates the geometry and analysis spaces and permits hierarchical local refinement, while the bounded propagation domain is discretized by quadtree-SBIGA with unified Bézier trace extraction and connected to the homogeneous unbounded exterior through a scaled-boundary impedance. On a common physical integration partition, an $L^2$ projection maps the nonmatching traces; Hermitian-adjoint force transfer then gives a virtual-work-consistent interface reduction. The regional dynamic operators and moving-load response reconstruction follow a single Fourier convention. Homogeneous half-space comparisons and a cylindrical-cavity analytical solution verify the components and the complete coupled system. In the cavity study, hierarchical THB refinement reduces the displacement error in the target inner band by a factor of approximately $41$. At a specified frequency--wavenumber point in the cavity benchmark, a comparison with matched outer-boundary discretization gives approximately $15\%$ lower sampled full-domain error for the coupled model, using $34\%$ fewer system degrees of freedom and $48\%$ fewer S-elements; the warm per-sample times are similar. A layered pavement with a buried conduit and twin modified-D tunnels demonstrate open, closed and multiple disconnected nonmatching interfaces and the analysis of local structural demand and dynamic interaction under moving loads.

cs.CE

新论文 · v1arXiv:2611.06143

PTQ4SAM3: Semantics-Preserving Post-Training Quantization for Segment Anything Model 3

Xi Xiao, Yunbei Zhang, Lin Zhao, Janet Wang, Xinru Jiang, Yanshu Li, Chenrui Ma, Pan Wang 等 10 位作者

原文摘要

Segment Anything Model 3 (SAM 3) can segment objects from text prompts and track them across video, but its memory and computation costs make deployment difficult. Post-training quantization (PTQ) reduces these costs by using fewer bits. However, a quantized model can select the wrong object or lose track of its target across frames. We call this prompt-alignment drift. Controlled tests show that perturbing low-variance feature directions strongly affects target selection. We propose Semantics-Preserving Quantization (SPQ), which gives more calibration weight to concept-sensitive parameters, preserves residual features, and corrects the mean error in video memory. Fixed text concepts guide calibration without task annotations. All three components operate offline and add no inference operators. With a W4A8 image encoder, SPQ improves RefCOCO Pr@0.5 from 42.1 to 72.5 over PTQ4SAM while retaining 54.8 COCO mask AP. Experiments on LVIS, RefCOCO variants, and SA-V show consistent gains. A CLIP study also shows improved image-text retrieval.

cs.CV

新论文 · v1arXiv:2610.35999

safeL4: Rethinking Safe-Language-Based Single Address Space Microkernels

Zheyuan Xu, Xiaobei Zhang, Zihan Li, Zekai Nie, Guangtao Zhu, Zhuang Lu, Qianying Zhang, Shijun Zhao 等 10 位作者

原文摘要

Microkernels provide good features such as high security, safety, and flexibility, but their reliance on hardware-based isolation leads to heavy performance overhead, limiting their widespread adoption. Although constructing single-address-space microkernels based on safe language-based isolation is a promising approach to addressing the performance issue, this approach still faces challenges in maintaining the principle of minimality and enforcing capability-based, fine-grained access control over system resources. We propose safeL4, an approach to constructing microkernels based on safe languages. It guarantees minimality through low-level abstractions for unsafe operations, and implements a capability system based on the safe language's object capabilities to achieve fine-grained access control over all operations on system resources. We implement a prototype system in Rust, and our evaluation results show that the primitives provided by safeL4 are, on average, 1.9$\times$ faster than those of seL4.

cs.OS · cs.CR · cs.PL

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

Not All Directions Matter: Towards Structured and Task-Aware Low-Rank Model Adaptation

Xi Xiao University of Alabama at Birmingham, Chenrui Ma, Yunbei Zhang Tulane University, Chen Liu Yale University, Zhuxuanzi Wang Cornell University, Yanshu Li, Lin Zhao Northeastern University, Guosheng Hu University of Bristol 等 10 位作者

原文摘要

Low-Rank Adaptation (LoRA) has become a cornerstone of parameter-efficient fine-tuning (PEFT). Yet, its efficacy is hampered by two fundamental limitations: \textit{semantic drift}, arising from treating all update directions with equal importance, and \textit{structural incoherence}, due to adapting layers independently, resulting in uncoordinated and suboptimal updates. To address these issues, we propose \textbf{StructLoRA}, a framework that tackles both limitations through a principled dual-component design: (1) an Information Bottleneck-guided filter that prunes task-irrelevant directions to mitigate semantic drift, and (2) a lightweight, training-only graph-based coordinator that enforces inter-layer consistency to resolve structural incoherence. Extensive experiments across large language models, vision language models, and vision models (including LLaMA, LLaVA, and ViT) demonstrate that \textbf{StructLoRA} consistently establishes a new state of the art, outperforming not only vanilla LoRA but also advanced dynamic rank allocation and sparsity-based methods. Notably, the gains are particularly pronounced in challenging low-rank and low-data regimes. Crucially, since the proposed modules operate only during training, \textbf{StructLoRA} improves performance with \textbf{zero additional inference cost}, shifting the focus of PEFT from mere parameter compression to a more holistic optimization of information quality and structural integrity.

cs.CL · cs.CV

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