跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-17 23:35各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

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

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2611.20714

MSAR: Next-Scale Autoregressive Forecasting for Time Series via Modular Multi-Scale Decoupling

Fanda Fan, Kuiye Ding, Liming Mao, Bingsong Wang, Yao Wang, Xiaorui Wang, Ruijie Jian, Zhipeng Liu 等 12 位作者

原文摘要

Time series forecasting underpins critical applications in finance, energy, healthcare, and transportation. Although deep models have achieved strong results, most adopt single-scale modeling or restrict multiscale processing to the input side, causing a misalignment between multiscale inputs and single-scale outputs and limiting predictive power. We introduce the Modular Scale-wise Autoregressive Framework (MSAR), a model-agnostic design that forecasts progressively across multiple temporal resolutions. MSAR offers three advantages: (1) scale-wise aligned modeling, which disentangles heterogeneous temporal patterns by aligning inputs and outputs at each scale; (2) scale-wise autoregression, where coarse-scale predictions guide finer-scale forecasting through hierarchical information flow; and (3) a modular architecture, enabling seamless integration with diverse backbones such as CNNs, MLPs, and Transformers. Extensive experiments across a broad set of datasets and forecasting models demonstrate that MSAR achieves consistent improvements in both accuracy and inference efficiency, validating the effectiveness of scale-aligned autoregression for multiscale time series forecasting. The code is available at: https://github.com/Oryxo/MSAR.

cs.LG

版本更新 · v2arXiv:2511.06882

Rate-Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks With Burst Erasures

Zhipeng Li, Wenjie Ma

原文摘要

This paper investigates streaming codes for three-node relay networks under burst packet erasures with a delay constraint $T$. In any sliding window of $T+1$ consecutive packets, the source-to-relay and relay-to-destination channels may introduce burst erasures of lengths at most $b_1$ and $b_2$, respectively. Let $u = \max\{b_1, b_2\}$ and $v = \min\{b_1, b_2\}$. Singhvi et al. proposed a construction achieving the optimal rate when $u\mid (T-u-v)$. In this paper, we present an extended delay profile method that attains the optimal rate under a relaxed constraint $\frac{T - u - v}{2u - v} \leq \left\lfloor \frac{T - u - v}{u} \right\rfloor$ and it strictly cover restriction $u\mid (T-u-v)$. %Furthermore, we demonstrate that the optimal rate for streaming codes is not achievable when $0< T-u-v<v$ under the convolutional code framework.

cs.IT

新论文 · v1arXiv:2611.18137

Rate Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks

Ke Wang, Wenjie Ma, Zhipeng Li, Yaqiang Zhang

原文摘要

We study streaming codes for a three-node relay network with burst lengths $b_1,b_2$ and an end-to-end decoding delay $T$. Let $u=\max\{b_1,b_2\}$ and $v=\min\{b_1,b_2\}$, and write $T-v=pu+q$, where $T\ge u+v$ and $0\le q<u$. We develop two binary constructions, SR and SR-2, using extended delay profiles that allow the relay to forward causally invertible combinations of current and past source symbols. The SR construction attains the non-adaptive rate upper bound whenever \[ \frac{T-u-v}{2u-v}\le\left\lfloor\frac{T-u-v}{u}\right\rfloor. \] SR-2 enlarges this range under the sufficient condition \[ q(v-q)\le(p-1)u(u-v). \] These constructions complement the known divisibility and large-delay regimes. We also establish two limitations of systematic ordinary coordinate forwarding. First, it cannot attain the rate upper bound when $0<T-u-v<v$. Second, for equal burst lengths $b$, it attains the bound if and only if $b\mid(T-2b)$; a quantitative upper bound gives a strictly positive rate gap in every nondivisible case. These converses allow nonlinear components and predetermined time variation within the stated ordinary-forwarding architecture. Existing adaptive schemes for equal bursts approach the same rate upper bound asymptotically using time-varying convolutional codes and lie outside the non-adaptive setting considered here.

cs.IT