跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-17 11:15 — 2026-11-18 11:15(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

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

Network-Native DNN Architecture Synthesis for Distributed Inference

Fan Yang, Xiaolong Wu, Qi Cao, Fen Hou, Yulin Shao

原文摘要

Distributed deep neural network (DNN) inference typically follows a model-first paradigm, in which a predefined DNN is partitioned and deployed over a physical network. On irregular communication-computation topologies, however, this approach can create transmission bottlenecks and leave distributed resources underutilized. This paper reverses this perspective and asks: given a physical network, what kind of DNN can it naturally support? To answer this question, we propose a network-native DNN architecture synthesis paradigm in which the physical network topology directly defines inter-node neural dependencies. Neural computation is allocated across nodes under communication, computation, storage, synchronization, and latency constraints. We establish structural properties of the synthesis problem and develop linear programming (LP)-based Architecture Synthesis (LPAS), an efficient topology-guided algorithm that produces a feasible architecture with a computable bound on suboptimality. Experiments on physical networks of different sizes show that LPAS achieves relative gaps below 0.6% to the LP-derived upper bound, with substantially lower runtime than direct mixed-integer LP optimization on larger networks. Under matched network deadlines, the network-native architectures activate more compute nodes and utilize a larger proportion of available model-storage capacity than the model-first baseline. After training, the network-native models achieve higher classification accuracy across all evaluated dataset-precision settings, with the average gain of up to 10.69%. This network-native design paradigm thus turns the physical network from a deployment constraint into an architecture design primitive.

cs.IT · cs.DC

新论文 · v1arXiv:2611.01590

6G Uplink Waveform and Rank Selection under Distributed Reception

Yewen Cao, Fen Hou, Yulin Shao

原文摘要

The development of 6G uplink is expanding waveform and spatial transmission options, while distributed reception makes their relative merits depend on the spatial and frequency structure of the aggregate channel. We study the joint selection of cyclic prefix orthogonal frequency-division multiplexing and discrete Fourier transform spread OFDM at rank 1 and noncoherent rank 2 under common user equipment power constraints and centralized linear minimum mean-square error reception. We derive waveform switching thresholds at both ranks and a rank selection margin, establishing conditions for selecting among the four modes based on available transmit power, DFT despreading loss, and spatial multiplexing gain. We then characterize how port gains and correlations at individual access points (APs) form aggregate spatial separation and influence mode selection. At fixed port gains and available transmit powers, improving spatial separation without reducing it on any subcarrier increases the rank selection margin, while its effect on the preferred waveform within rank 2 depends on the frequency distribution of the improvement. Numerical results show that different AP deployments can favor different waveforms and ranks, even with the same receive antenna budget and comparable aggregate channel gains, including waveform switches at a fixed preferred rank.

cs.IT · eess.SP