跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 4 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-08 14:29(北京时间)
新论文 · v1arXiv:2611.08216

ProQuant:面向边缘多模态大模型的渐进式量化感知训练

ProQuant: Progressive Quantization-aware Training for Edge MLLMs

Yufei Xue, Yushi Huang, Jiawei Shao, Pingcheng Dong, Yonghao Tan, Shiyao Li, Kwang-Ting Cheng, Jun Zhang

AI 速读 基于摘要

提出 ProQuant 权重-激活量化感知训练框架,通过自重标注与渐进式块激活机制,缓解小规模多模态大模型在低比特(如 W4A8)量化下的性能退化。

cs.CV · cs.CL

查看原文摘要

Multi-modal large language models (MLLMs) with impressive perception and understanding capabilities will enable a range of downstream applications. However, their substantial computational and memory requirements hinder the real-world implementation, particularly for resource-constrained edge devices. Quantization has emerged as an effective solution for deploying large models. While post-training quantization (PTQ) successfully retains the performance at moderate bit-width (e.g., W8A8), it suffers from severe performance degradation under low-bit quantization (e.g., W4A8), especially for small-scale models that are more suitable for edge deployment. In this paper, we propose ProQuant, a novel weight-activation quantization-aware training (QAT) framework tailored for low-bit MLLMs. First, to align the limited finetuning dataset distribution with the pretrained dataset distribution, we propose a self-relabeling (SRL) scheme to resample the responses of the open-source multimodal dataset. Second, we are the first to take a decoupled view of multi-modal (MM) understanding and language modeling abilities. We propose a progressive block activation (PBA) mechanism to prioritize the MM understanding recovery. We also introduce a vision-sensitive factor $\vecτ$ that effectively identifies the MM-critical layers. Extensive experiments across various benchmarks, covering models with 2B-8B parameters, show that ProQuant significantly outperforms existing methods. For example, our W4A8 Qwen3-VL-2B-Instruct improves average accuracy by impressively 6.6% and achieves performance comparable to full precision counterparts with only approximately 1% performance drop. Code is available at https://github.com/yufeixue-ai/ProQuant/.

版本更新 · v2arXiv:2609.02977

Learning Fourier-Sparse Signals and Multiband Signals

Dongrun Cai, Xue Chen, Xiaowei Shao, Yile Wang

原文摘要

A classical problem in continuous sparse Fourier transforms, which dates back to Prony's work in 1795, is to learn a $k$-Fourier-sparse signal $x(t):=\sum_{j=1}^k α_j e^{2 π\mathbf{i} f_j t}$ with arbitrary $k$ frequencies $f_1,\ldots,f_k \in \mathbb{R}$. We consider this learning problem within a fixed time window $t \in [-1,1]$ in the presence of bounded $L_2$ adversarial noise. Because the frequencies $f_1,\ldots,f_k$ can be arbitrarily close, accurately recovering individual frequencies is information-theoretically impossible even under exponentially small noise from Moitra (STOC 2015). This work therefore examines two fundamental questions: If an algorithm uses $\tilde{O}(k)$ frequencies to approximate $f_1,\ldots,f_k$ of $x$, what is the optimal covering error? And how can we efficiently learn the continuous signal $x(t)$ as a whole over the time window? Our main result is an algorithm running in time $\tilde{O}(k)$ that outputs a list $L$ of $\tilde{O}(k)$ frequencies with covering error $O(k)$ --- meaning that for most frequencies $f_j$ of $x$, $L$ guarantees $\min_{\tilde{f} \in L} |f_j-\tilde{f}| = O(k)$ --- and an reconstruction $\tilde{x}(t) \approx x(t)$ over $[-1,1]$. When constrained to outputting $\tilde{O}(k)$ frequencies, this $O(k)$ covering error is nearly optimal: Chen and Price (ICALP 2019) demonstrated two indistinguishable $k$-Fourier-sparse signals separated by distance $\tildeΩ(k^2)$ in the frequency domain, which implies an amortized lower bound of $\tildeΩ(k)$ per frequency. Furthermore, our sample and time complexities are nearly optimal, dramatically improving upon the previous best algorithm by Song, Sun, Weinstein, and Zhang (FOCS 2023), which required $\tilde{O}(k^4)$ samples and $\tilde{O}(k^{4ω})$ running time.

cs.DS

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

Detoxification for LLM: From Dataset Itself

Wei Shao Institute of Computing Technology, Chinese Academy of Sciences, Yihang Wang ByteDance Inc. and University of Chinese Academy of Sciences, Gao yu Zhu, Ziqiang Cheng, Lei Yu, Jiafeng Guo Institute of Computing Technolgy, Chinese Academy of Sciences, Xueqi Cheng Institute of Computing Technology, Chinese Academy

原文摘要

Existing detoxification methods for large language models mainly focus on post-training stage or inference time, while few tackle the source of toxicity, namely, the dataset itself. Such training-based or controllable decoding approaches cannot completely suppress the model’s inherent toxicity, whereas detoxifying the pretraining dataset can fundamentally reduce the toxicity that the model learns during training. Hence, we attempt to detoxify directly on raw corpora with SoCD (Soft Contrastive Decoding), which guides an LLM to localize and rewrite toxic spans in raw data while preserving semantics, in our proposed HSPD (Hierarchical Semantic-Preserving Detoxification) pipeline, yielding a detoxified corpus that can drop-in replace the original for fine-tuning or other training. On GPT2-XL, HSPD attains state-of-the-art detoxification, reducing Toxicity Probability (TP) from 0.42 to 0.18 and Expected Maximum Toxicity (EMT) from 0.43 to 0.20. We further validate consistent best-in-class results on LLaMA2-7B, OPT-6.7B, and Falcon-7B. These findings show that semantics-preserving, corpus-level rewriting with HSPD effectively suppresses downstream toxicity while retaining data utility and allowing seamless source-level mitigation, thereby reducing the cost of later model behavior adjustment.

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

LoPT: Lossless Parallel Tokenization Acceleration for Long Context Inference of Large Language Model

Wei Shao, Zheng Lingchao Huawei Technologies Ltd., Pengyu Wang, Peizhen Zheng Huawei Technologies Ltd., Li Jun, Yuwei Fan Huawei Technologies Ltd.

原文摘要

Long context inference scenarios have become increasingly important for large language models, yet they introduce significant computational latency. While prior research has optimized long-sequence inference through operators, model architectures, and system frameworks, tokenization remains an overlooked bottleneck. Existing parallel tokenization methods accelerate processing through text segmentation and multi-process tokenization, but they suffer from inconsistent results due to boundary artifacts that occur after merging. To address this, we propose LoPT, a novel Lossless Parallel Tokenization framework that ensures output identical to standard sequential tokenization. Our approach employs character-position-based matching and dynamic chunk length adjustment to align and merge tokenized segments accurately. Extensive experiments across diverse long-text datasets demonstrate that LoPT achieves significant speedup while guaranteeing lossless tokenization. We also provide theoretical proof of consistency and comprehensive analytical studies to validate the robustness of our method.

cs.CL

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