跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

研究日报 / 周报 →按信源浏览 →

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 05:40（北京时间）
新论文 · v1arXiv:2611.15691

Dynamic Block-Online Streaming ASR for Low-Resource Agglutinative Code-Switching Speech with Morphology-Aware Evaluation

Kazi Rafat, Afifa Imran, Md. Ismail Hossain, Md. Romzan Ali, Fuad Rahman, Sifat Momen, Shafin Rahman, Nabeel Mohammed

原文摘要

Low-resource, agglutinative languages challenge low-latency ASR, as fixed lookahead windows fail when grapheme order diverges, suffixes cross code-switch boundaries, or code-switching data is imbalanced. We present the first comprehensive study of streaming ASR for intra-sentential Bangla-English code-switching, identifying a mismatch between strict causal streaming and long-range morphological dependencies. We introduce a Dynamic Block-Online framework with VAD-aligned inference that balances semantics, latency, and context, enabling global bidirectional attention to preserve morphological integrity. To mitigate data scarcity, we propose Script-Anchored Loanword Injection, augmenting training text with English loanwords to model phonotactic transitions. We introduce CS-WER to diagnose switch, root, and suffix errors, and show that flexible latency budgets enhance recognition of agglutinative and mixed-language speech, with successful transfer to menstrual-medical domains.

cs.CL · cs.SD

查看论文
arXiv ↗PDF ↗
版本更新 · v2arXiv:2607.23335

The Gate Always Closes: On Injecting Auxiliary Signals into Frozen Vision-Language Models

Moshiur Farazi, Sameera Ramasinghe, Bekir Sait Ciftler, Mahbub Ahmed Turza, Shafin Rahman

原文摘要

Auxiliary signal pathways in VLMs are routinely fitted with learnable gates so the optimiser can decide how much of the signal to admit. We study what the optimiser decides, and whether the model then uses the signal, with hyperbolic visual relational graphs as the experimental vehicle. We find that under cross-entropy fine-tuning the optimiser decides on zero: the gate closes in every design we trained, across five injection designs on LLaVA-1.5-7B, 15 of 15 runs on Qwen2-VL-7B spanning four task families, 3 of 3 seeds on InternVL3-8B, and with LoRA on all linear layers. We attribute this suppression phenomenon to two regimes, a dead-gradient regime formalised through the caption-invariance of image-derived signals and measured directly, and a negative-utility regime in which the auxiliary signal actively hurts the loss. A closed gate does not by itself mean an inert pathway, so we ablate each pathway at inference under one protocol with real region proposals: the norm-aligned designs are behaviourally closed (at most 1.5pp change at the learned gate), whereas the un-normalised gated prefix is open and harmful, costing 6.7pp on relational GQA at its learned gate of +0.005 while helping SugarCrepe. Evaluating every configuration under one inference mode shows that an active injected pathway costs up to 15pp on relational GQA and 7-12pp on out-of-distribution VSR, that the geometric training losses give no measurable in-distribution gain once the pathway is dropped, and that a Euclidean containment control ties the hyperbolic one. Embedding-norm alignment remains necessary for prefix injection that preserves generation. We recommend testing signal use by ablation rather than by reading gate values or attention mass. We open-source the implementation, the checkpoints and the result files behind every table at https://github.com/mrfarazi/the-gate-always-closes.

cs.CV

查看论文
arXiv ↗PDF ↗