跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

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

Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus

Yifeng Ye, Rongji Huang, Gerui Wang, Mingchao Wan, Yuxing Duan, Jingjing Zhang, Shengyun Liu

原文摘要

In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers. However, the consensus layer and the underlying P2P network remain mutually opaque in existing blockchains, waiving the opportunity for further improvement. In contrast to other P2P applications, blockchain can naturally be abstracted as a state machine. We therefore leverage this abstraction to record network topologies and latencies in a trusted and coordinated manner. With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P networks: (1) accelerating leader rotation; (2) introducing a reliable-broadcast paradigm that employs tree-based dissemination in the normal case and falls back to gossip only when necessary; and (3) constructing latency-aware dissemination trees. We integrate the above ideas into Tendermint and libp2p, and conduct empirical evaluation on Amazon EC2 platform using up to 300 nodes distributed across 10 regions. The results demonstrate that, compared with gossip-based dissemination over the same topology, our prototype improves peak throughput by up to $7.26\times$.

cs.DC

版本更新 · v2arXiv:2608.10627

Decomposition-Induced Context-Memory Conflict: An Instruction-Induced Failure and a Probing Case Study

Yu-Feng Yen

原文摘要

Decompose-then-verify pipelines (FActScore-style fact-checkers, hallucination detectors) first split a passage into atomic claims and treat this step as neutral preprocessing. We ask whether a decomposer can substitute its own parametric belief for what the passage says, producing a claim that contradicts its source, and call this Decomposition-Induced Context-Memory Conflict (DI-CC). On biographies with a deliberately altered year, Qwen2.5-7B-Instruct does so in 4.3% of claims when the instruction licenses self-correction, but in only 0.2-0.5% under a neutral instruction, a FActScore-style few-shot prompt, a "use only the passage" instruction, a formatting instruction, or a knowledge-filling instruction (an upper bound: in the neutral and FActScore-style runs only 1 of 13 flagged claims is a real override); context-aware decoding removes only half. DI-CC here is therefore instruction-induced. We then test whether a linear probe trained only on classical context-memory conflict data (NQ-Swap) detects DI-CC zero-shot. Its AUC is high (up to 0.94 against legit claims, 0.98 under a position- and instruction-matched control), but random directions reach AUCs between about 0.1 and 0.9 on these contrasts, probes fit directly on the claims reach 0.96-1.00 everywhere (even on a control that separates only the text variant), and after multiplicity correction the NQ-Swap probe beats random directions only at the last layer, and only for two of three random-direction families. A direct NLI check between source and claim reaches AUC 0.998. High probe AUC on such small contrasts is not evidence of a shared mechanism without nulls, and two pitfalls, pair leakage in probe training and duplicated BOS tokens, can change such conclusions.

cs.CL

新论文 · v1arXiv:2611.01791

RIFT: Residual-Informed Flow Transfer for One-Step Generative Video Compression

Qizhe Wang, Jiaye Fu, Feng Ye, Haocheng Tang, Zetian Song, Chuanmin Jia, Siwei Ma, Jiaqi Zhang

原文摘要

Recent advances in video generation have enabled generative video compression to reconstruct details lost during coding using pretrained spatiotemporal priors. However, a substantial gap remains between codec-induced degradation and the perturbation trajectories learned by flow-matching models. In this paper, we identify a compression-dependent directional mismatch that degradation-strength-based timestep calibration alone cannot resolve. Compressed latents remain strongly aligned across codec operating points, while their reconstruction residuals vary substantially in magnitude and direction. To bridge this gap, we propose RIFT, a Residual-Informed Flow Transfer framework for one-step generative video compression. At its core, RIFT introduces a Residual Geometry Inducer (RGI) that converts the pretrained flow prediction into a content-adaptive restoration update using decoder-visible codec cues. RGI integrates flow-timestep conditioning with a learned full-band residual-strength estimate and content-conditioned direction and gain modulation, aligning the orientation and magnitude of the update with the compression-dependent residual geometry. Extensive experiments on three public video compression benchmarks show that RIFT outperforms competing generative video compression methods. The code is publicly available on RIFT.

cs.CV

新论文 · v1arXiv:2610.37159

Physics-Guided Flow Matching: A Generative AI Framework for Global Total Electron Content Forecasting

Si-Tong Yang, Feng Ye, Xian Lu, Dong Lin, Benjamin C. Martinez

原文摘要

Accurate forecasting of global total electron content (TEC) is important for space weather monitoring and the reliable operation of satellite communication and navigation systems. We propose a physics-guided generative artificial intelligence (AI) framework for day-ahead global TEC forecasting. The framework builds on flow matching, which learns to gradually transform samples from an initial distribution into new samples that share the statistical characteristics of the target data. The proposed model incorporates ionospheric dynamics described by a partial differential equation (PDE) into this transformation process, guiding the changes between initial and target samples using physical knowledge. The model further combines the physical dynamics with statistical patterns captured from data to learn this transformation, adaptively adjusting their relative contributions at each location. The model is trained and evaluated using one year of global TEC data generated by the Thermosphere Ionosphere Electrodynamics General Circulation Model (TIEGCM). The results demonstrate that our model improves both spatial and temporal forecasting accuracy over representative benchmarks, including statistical, deep learning, and generative AI methods at all lead times and across latitudes. The average root mean square error (RMSE) is 39.2% lower than that of ConvLSTM and 23.8% lower than that of the same framework without physical guidance. The learned contribution weights vary systematically with latitude and across geographic locations, showing how the physical contribution changes across the forecast domain. These findings demonstrate that explicit physical guidance improves generative forecasts of global TEC and highlight the value of incorporating physical dynamics into generative AI modeling.

cs.LG · stat.ML

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

Hybrid Autoregressive-Diffusion Model for Real-Time Sign Language Production

Maoxiao Ye, Xinfeng Ye University of Auckland, Sathiamoorthy Manoharan University of Auckland

原文摘要

Earlier Sign Language Production (SLP) models typically relied on autoregressive methods that generate output tokens one by one, which inherently provide temporal alignment. Although techniques like Teacher Forcing can prevent model collapse during training, they still cannot solve the problem of error accumulation during inference, since ground truth is unavailable at that stage. In contrast, more recent approaches based on diffusion models leverage step-by-step denoising to enable high-quality generation. However, the iterative nature of these models and the requirement to denoise entire sequences limit their applicability in real-time tasks like SLP. To address it, we propose a hybrid autoregressive-diffusion model for Sign Language Production (SLP), combining sequential dependency modeling with iterative refinement. A Multi-Scale Pose Representation module captures fine-grained articulator features, while a Confidence-Aware Causal Attention mechanism guides generation using joint-level confidence scores. Experiments on PHOENIX14T and How2Sign show improved generation quality and real-time efficiency.

cs.CL

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