跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 04:39 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 04:39最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

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

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

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

找到 628 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 04:38(北京时间)
新论文 · v1arXiv:2611.23722

Drift-Aware Adaptive Semantic Codec Update Strategy for Dynamic Semantic Communications

Bizhu Wang, Manqi Li, Shujun Han, Mengying Sun, Xiaodong Xu

原文摘要

Semantic communication reduces transmission overhead by conveying task-relevant semantic features, but its performance depends on the consistency between training and target-domain data distributions. In dynamic environments, distribution drift can make offline-trained semantic codec models stale and degrade transmission performance. Frequent updates alleviate this degradation but increase communication, computation, and queueing costs, whereas infrequent updates delay model adaptation. To address this tradeoff, we propose a drift-aware adaptive update strategy for dynamic semantic communication systems. Drift intensity is quantified in the semantic feature space, and Drift-Aware Age of Model (DA-AoM) is introduced to jointly capture drift-induced performance degradation, drift-dependent update service delay, and conventional update latency. Closed-form average DA-AoM expressions are derived for edge-layer M/M/1 and cloud-layer D/M/1 update scenarios, based on which the update frequency is optimized under the queueing-stability constraint. Simulations show that DA-AoM captures the joint effects of drift intensity, computing rate, bandwidth, and update frequency on model freshness beyond conventional Age of Information (AoI). The proposed strategy reduces average DA-AoM by 9.2\%--42.4\% compared with representative baselines under the same resource constraints.

cs.IT

版本更新 · v2arXiv:2608.24398

Resource Allocation for Secure Dual-UAV-Assisted ISAC System

Hongjiang Lei, Jianshuo Geng, Ki-Hong Park, Jia Ye, Liang Yang, Xiaqing Miao, Gaofeng Pan

原文摘要

Integrated sensing and communication (ISAC) is a rising technology in the next wireless communication networks, enabling the simultaneous execution of communication and sensing tasks by fully utilizing limited spectrum resources. In this work, we investigate the secrecy performance of a dual-uncrewed aerial vehicle (UAV)-assisted secure ISAC system. Specifically, a base station UAV communicates with users and transmits radar signals to locate potential eavesdroppers, while simultaneously providing information to a jammer UAV to perform jamming tasks. Considering constraints such as maximum UAV velocity, transmit power, propulsion energy, and sensing thresholds, we maximize the average secrecy rate by optimizing user scheduling strategies, time allocation, transmit power, and UAV trajectories. The presence of a non-convex problem, originating from tightly coupled variables, is tackled by an efficient iterative algorithm. In particular, the original optimization problem is decomposed into six subproblems, and non-convex subproblems are transformed into approximately convex forms via successive convex approximation. Then, block coordinate descent techniques are employed to solve all subproblems sequentially. Numerical results demonstrate the convergence and effectiveness of the proposed algorithm.

cs.IT

版本更新 · v2arXiv:2609.29140

Cost-Efficient LLM Evaluation: A Framework for Narrow Confidence Intervals Under Fixed Budgets

Yezhou Cheng, Runjia Du, Zeming Liu, Qibai Chen, Hang Lyu, Yilan Wei, Yankai Zeng, Bojun Lin

原文摘要

Large language models (LLMs) play an increasingly important role in both academic research and industry. Reliable evaluation helps researchers understand model capabilities and assess progress during model development. However, evaluation can be costly, and researchers often need to assess performance within a fixed budget. Because model outputs can vary across runs, this budget must be allocated between testing different tasks and repeating selected tasks. A confidence interval quantifies the uncertainty in the resulting performance estimate. Obtaining narrower intervals at the same confidence level and evaluation cost provides a more precise assessment of model performance, helping researchers draw clearer conclusions from limited observations. We introduce a framework that allocates a fixed evaluation budget across tasks and repeated runs, with or without full task coverage. The framework then uses disagreements between runs on the same task to bound estimation error, allowing narrower confidence intervals at the same confidence level when the sampled repeats show little variability. When repeated runs on each task yield the same outcome, we prove that our framework achieves the fastest theoretically possible rates for narrowing confidence intervals in the worst case as the number of tasks and the budget for repeats grow. We establish matching lower bounds both when every task must be covered and when tasks may be skipped, even for evaluators who use earlier results to decide which run to carry out next. On LiveCodeBench, our framework yielded narrower confidence intervals on average than uniform random sampling in 15 of 16 model configurations, with a median width reduction of 30.6% at the same confidence level and the same budget of 1,100 outputs per configuration.

cs.AI · cs.IT

版本更新 · v3arXiv:2607.13796

A Geometric Coding Theorem

Romie Banerjee

原文摘要

This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings and define the symmetry prior of a string x as the probability that a randomly chosen symmetry from a given group G has x as its unique fixed point. We show that for any fix-retractable symmetry group G, a group admitting a computable section that selects an isolating symmetry for every string, the symmetry prior is a universal lower semi-computable semi-measure. In this case, the Geometric Coding Theorem holds. This result is a coding-theoretic restatement of a theorem of Trejo, Kreinovich and Longpré, who showed that the complexity of describing a string by a symmetry with that string as its unique fixed point equals its Kolmogorov complexity. Our contribution is to recast it in terms of algorithmic probability and to treat the symmetry group as a parameter, identifying fix-retractability as exactly the condition under which symmetry complexity collapses onto Kolmogorov complexity.

cs.IT · cs.AI · math.CT · math.GR

版本更新 · v3arXiv:2609.40290

Orbits as Strong Models: Kolmogorov Structure Function under Symmetry

Romie Banerjee

原文摘要

Strong models in algorithmic statistics are essentially the cells of simple partitions of $\{0,1\}^n$. We study the partitions that come from symmetry, the orbit partitions of groups acting on strings, and the structure function $h^G_x$ they induce. A set is a cell of such a partition exactly when its setwise stabiliser acts transitively on it, so $h^G_x$ is Kolmogorov's structure function restricted to $G$-homogeneous sets. For the full symmetric group this recovers all models and exactly the strong ones. For $GL(n,2)$ the cells are the linearly homogeneous sets, $h^{GL}_x$ lies in a band between $C(x)-α$ and $n-α$ with both edges attained, and some stochastic normal strings have simple structure that is invisible to linear symmetry. Writing each permutation group as a Burnside-ring type with a placement, we show that any space of symmetry hypotheses small enough to search is small enough to miss simple structure. Finally we cast the search for orbit models as value estimation on subgroup lattices, with computable bounds, certified training targets and a lattice version of Monte Carlo tree search.

cs.IT · cs.AI · math.GR

版本更新 · v6arXiv:2604.23716

Non-Stationarity Breaks Permutation Surrogates in Multi-Agent Reinforcement Learning: Diagnosis and Remedies

Nikolaos Al. Papadopoulos, Konstantinos E. Psannis

原文摘要

Reporting guidance for information-theoretic measures is rarely tested against ground truth. We test one guardrail in two multi-agent reinforcement learning games, a social dilemma and a coordination race, over 100 seeds, on agent pairs whose directed influence is zero by construction. Omitting one precondition, the exclusion of the non-stationary training transient, gives false-positive rates of 100.00% and 99.95%, flagging agents that anneal exploration independently, in runs that never met, as influencing one another. Excluding the transient reaches 3.05% in the social dilemma but 11.8% in the coordination game, so exclusion is neither the only treatment nor a sufficient one. The remedy we recommend changes only the null model, permuting the source within blocks of training time, and reaches 5.25% and 5.50%. Of the three remedies compared (exclusion, this surrogate and conditioning on training time), only the surrogate stays at or below the size of the test in both games. Restricted permutation is an established construction, and the contribution lies in measuring it against ground truth. A third null control, four learners in the social dilemma, defeats all three, and raises the rate of conditioning by 15.20 points against 4.55 for ours. With injected links of known strength, the surrogate detects 82.5% where conditioning detects 58.0% on identical pairs, while the test without exclusion reports a positive with or without a link, so its apparent sensitivity is uninformative. Five block counts from 16 to 256 land in the nominal region, and code and data are released.

cs.AI · cs.IT · cs.LG · cs.MA

新论文 · v1arXiv:2611.23523

The Double Entropy Fit Index (DEFI): An Information-Theoretic Approach to Dimensionality Reduction and Clustering

Gabriel Lawrence, Daniel Otero-Leon

原文摘要

We introduce the Double-Entropy Fit Index (DEFI), a regularized information-theoretic criterion for selecting among candidate graph partitions and reduced representations. DEFI couples entropy-based compression with relevance preservation and penalizes model dimensionality, cluster imbalance, and partition fragmentation. An exact Rényi-2 entropy identity shows that partitioning alters both spectral concentration and graph-volume normalization, explaining why unregularized entropy minimization can favor degenerate solutions. Across a 243-condition population-analytic factor recovery benchmark, DEFI achieved an overall exact recovery rate of 97.2\% (versus 75.0\% for EGA-TMFG, 45.8\% for TEFI on von Neumann entropy). In controlled local candidate batteries (distinguishing the true model from adjacent $K \pm 1$ and factor-split alternatives), DEFI identified the correct partition in 99.2\% of replications. Across ten clustering benchmarks, DEFI-guided Gaussian mixtures achieved a mean ARI of 0.929, exceeding HDBSCAN (0.809), Ward clustering (0.700), and conventional GMM criteria (0.501-0.580), with gains concentrating where standard criteria over-extract components.

cs.IT · math.OC

版本更新 · v4arXiv:2201.02514

Efficiency of ANS Entropy Encoders

Dmitry Kosolobov

原文摘要

Asymmetric Numeral Systems (ANS) is a class of entropy encoders that had an immense impact on the data compression, substituting arithmetic and Huffman coding. It was studied by different authors but the precise asymptotics of its redundancy (in relation to the entropy) was not completely understood. We obtain optimal bounds for the redundancy of the tabled ANS (tANS), the most popular ANS variant. Given a sequence $a_1,a_2,\ldots,a_n$ of symbols from an alphabet $\{0,1,\ldots,σ-1\}$ such that each symbol $a$ occurs in it $f_a$ times and $n=2^r$, the tANS encoder using Duda's ``precise initialization'' to fill tANS tables transforms this sequence into a bit string of the following length (the frequencies are not included in the encoding): $\sum\limits_{a\in[0..σ)}f_a\cdot\log\frac{n}{f_a}+O(σ+r)$, where $O(σ+r)$ can be bounded by $σ\log e+r$. The $r$-bit term is an artifact indispensable to ANS; the rest incurs a redundancy of $O(\fracσ{n})$ bits per symbol. We complement this by examples showing that an $Ω(σ+r)$ redundancy is necessary. We argue that similar examples exist for most adequate initialization methods for tANS. Thus, we refute Duda's conjecture that the redundancy is $O(\fracσ{n^2})$ bits per symbol. We also propose a variant of the range ANS (rANS), called rANS with fixed accuracy, parameterized by $k\ge 1$ that in certain conditions might be faster than the standard rANS because it avoids slow explicit division operations. We bound the redundancy for our rANS variant by $\frac{n}{2^k-1}\log e+r+k$.

cs.IT · cs.DS

版本更新 · v5arXiv:2211.05702

A Primer on Zadoff Chu Sequences

Jeffrey G. Andrews

原文摘要

Zadoff-Chu (ZC) sequences are an important manifestation of spread spectrum in modern cellular systems, including LTE and 5G NR. They have to some extent displaced PN and Walsh sequences which were the mainstays of 3G cellular (WCDMA and cdma2000) and the 2G-era IS-95. ZC sequences are complex sequences with unit amplitude and particular phase shifts, as opposed to Walsh and PN codes which are real and binary valued, most commonly $\pm1$. ZC sequences have a number of remarkable and desirable properties that we define in the next section. Because of these properties, they are used for many key functions in current cellular systems, and are likely to be prevalent in future cellular systems as well. In LTE and 5G NR, they are widely used for a number of important initial access and overhead channel functions that are often overlooked by engineers who focus on data transmission. For example, ZC sequences are used for initial access in both the downlink (synchronization sequences) and uplink (random access premables). They are also used for transmitting uplink control information, and as pilot symbols for both uplink channel sounding and fine-grained channel estimation. It is not an exaggeration to say that most types of signals other than the data transmissions in modern cellular standards utilize ZC sequences. In this primer, we define ZC sequences and introduce their key properties, and provide some examples. We also discuss modified ZC sequences that are commonly used in practice, but are not, strictly speaking, ZC sequences. We also overview their uses in LTE and 5G.

cs.IT

新论文 · v1arXiv:2611.23503

Electromagnetic Channel Model and Sensing Performance for ISAC: The Case of a Single Cylindrical Scatterer

Gabriele Gradoni, Ahmed Elzanaty, Yadong Yang, Mohsen Khalily, Mahmoud Shahabadi, Fan Wang, Peiying Zhu, Wen Tong 等 9 位作者

原文摘要

We propose an electromagnetic wireless channel model for accurate target localization in radar-like sensing scenarios. The model employs a self-consistent method grounded in wave scattering theory and imposing boundary conditions, providing the (impedance) channel transfer matrix for a propagation channel with a single target modeled as a cylindrical scatterer. The model is: 1) physics-based, as it includes electromagnetic interactions between objects; 2) unified, as it is valid in both near- and far-field regions. Within the canonical two-dimensional and 2.5-dimensional configurations with line-source and dipole-source excitations, respectively, the model supports dielectric cylinders with frequency-dependent permittivity. Localization accuracy is assessed via the Cramer-Rao lower bound for a dielectric cylinder with variable position, radius, and dielectric constant. Provisions for future extensions to extended targets are discussed in the context of 3GPP channel modeling.

eess.SP · cs.IT

版本更新 · v2arXiv:2610.39870

最优自正交二元线性码

Optimal self-orthogonal binary linear codes

Sascha Kurz

AI 速读 基于摘要

作者完成了八维二元自正交码在给定最小距离下最小可能长度的确定,并给出九维情形在最小距离不超过64时的精确值与界。

math.CO · cs.DM · cs.IT

查看原文摘要

We complete the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with given minimum distance. For dimension nine we give exact values and bounds for minimum distance at most $64$. By exploiting the geometric reformulation of linear codes as multisets of points, we fully redo the classification for dimension at most seven in a simplified and computer-free manner. As a by-product we prove the non-existence of $[93,9,44]_2$ codes and show several divisibility results for putative optimal nine-dimensional binary codes.

新论文 · v1arXiv:2611.23116

以高概率实现最优最小熵估计

Optimal Min-Entropy Estimation with High Probability

Qisheng Wang

AI 速读 基于摘要

该论文确定了经典分布与量子态在高概率下估计最小熵的最优样本复杂度,并给出简短证明。

cs.IT · math.ST · quant-ph

查看原文摘要

Min-entropy plays a fundamental role in assessing the unpredictability of randomness sources. In particular, NIST SP 800-90B specifies min-entropy estimation as a key procedure for entropy sources used in cryptographic random bit generators, illustrating the practical importance of reliable min-entropy estimation. In this paper, we settle the sample complexity of min-entropy estimation with high probability in both the classical and quantum cases. Specifically, for min-entropy estimation with additive error $\varepsilon$ and probability at least $1-δ$, the sample complexity is $Θ(d\log(d/δ)/\varepsilon^2)$ for classical distributions on $d$ symbols and $Θ((d^2+d\log(1/δ))/\varepsilon^2)$ for quantum states on a $d$-dimensional Hilbert space. Our results admit short and simple proofs.

版本更新 · v3arXiv:2609.39747

A depolarizing choir sings in Gaussian harmony

Rabsan Galib Ahmed, Sujeet Bhalerao, Sungjai Lee, Felix Leditzky, Debbie Leung, Luke Schaeffer, Graeme Smith

原文摘要

We study the noise threshold for positive quantum capacity for the qubit depolarizing channel. We explore analytically the action of the qubit depolarizing channel on the symmetric subspaces of the input qubits, in the limit of asymptotically many uses of the channel. We observe the emergence of a bosonic Gaussian channel. Furthermore, the codes previously developed for the depolarizing channel can be translated to codes for the emergent Gaussian channel, and it is easier to further optimize these codes for the simpler emergent Gaussian channel. Translating these codes back to the depolarizing channel leads to extremely good input states for the coherent information of the depolarizing channel producing new lower bounds on the noise threshold for positive capacity. In addition to improved lower bounds on the threshold, this newly found link between depolarizing noise and Gaussian channels offers a novel perspective contributing to our understanding of these symmetric codes.

quant-ph · cs.IT

新论文 · v1arXiv:2611.22900

blaris: Windowless Random-Access LZSS for Constrained Microcontrollers

Ihor Lukianov

原文摘要

Embedded LZ77 decompressors (such as heatshrink and tamp) require an in-RAM sliding window that couples memory usage to compression ratio and incurs high latency on random-access reads. We present blaris, a lightweight, windowless LZSS decompressor for execute-in-place (XIP) random access on constrained microcontrollers. By partitioning tokens into bidirectionally traversable streams with power-of-two checkpoints, blaris resolves back-references directly in the compressed payload, achieving compression ratios comparable to high-window heatshrink and tamp configurations without allocating a RAM window. Targeting compress-on-host, decompress-on-device workflows, blaris assumes trusted build-time payloads and omits runtime error and bounds checks. On RV32IMC, it requires just 548-784 B of Flash and 104-112 B of total RAM, achieving orders-of-magnitude faster small-slice random reads than ratio-matched, block-indexed heatshrink and tamp.

cs.AR · cs.IT

版本更新 · v3arXiv:2401.16926

Joint Communication and Control: Causal Coordination Coding for Witsenhausen Counterexample

Mengyuan Zhao, Tobias J. Oechtering, Maël Le Treust

原文摘要

In decentralized network control, communication plays a crucial role by transforming local observations into shared knowledge, enabling agents to coordinate their actions. This paper investigates how communication facilitates cooperation behavior and therefore improves the overall performance in Witsenhausen counterexample, a canonical toy problem in distributed decision-making. We consider the vector-valued setups where the encoder, i.e., the first decision-maker (DM) acts causally and the decoder, i.e., the second DM, operates noncausally, 1) without and 2) with access to channel feedback. Using a coordination coding framework, we characterize the achievable power-estimation cost regions in single-letter expressions for both scenarios. We show that feedback enlarges the coordination region compared with the no-feedback setup. Building on the characterization of the power-estimation cost region, we propose a hybrid strategy that combines discrete quantization with a continuous Gaussian codebook, the Zero Estimation Cost (ZEC) strategy. This strategy uses coding tools that allow perfect reconstruction of the target symbols, leading to an asymptotic estimation cost equal to zero, while substantially reducing the power cost. Moreover, when channel feedback is available, we propose an analogous ZEC strategy that simultaneously achieves zero power and zero estimation costs in the low-noise regime. Finally, we establish that, when restricted to jointly Gaussian random variables, the performance is identical across all setups featuring at least one causal DM, regardless of the presence of feedback information.

cs.IT

版本更新 · v2arXiv:2605.08400

On Minimal Observation Time for Recovering Latent Hawkes Networks

Jonas Linkerhägner, Michele Bortolasi, Lorenzo Baldassari, Maarten V. de Hoop, Ivan Dokmanić

原文摘要

Dynamics of interacting systems in engineering, society, and nature often evolve over latent networks that govern which entities can interact. We study the problem of inferring these networks from event-based observations, which arise naturally in finance, seismology, and neuroscience. While there is substantial algorithmic work addressing this important problem, theoretical results are scarce. In this paper we ask the following fundamental question: what is the minimum time that one must observe the dynamics in order to exactly recover the underlying network, as a function of the number $d$ of interacting entities? For a class of stationary Hawkes processes with sparse, weak interactions, we prove that an observation time of order $\log d$ is sufficient and necessary. For the upper bound we construct a two-stage estimator that uses clipped and binned event data for screening, followed by a least-squares refinement, and apply concentration bounds derived from the Poisson cluster representation. For the lower bound we combine Fano's inequality with Jacod's Girsanov formula for point processes on a suitable subclass of networks.

math.ST · cs.IT · cs.LG · stat.ML

版本更新 · v3arXiv:2409.04970

A response-adaptive multi-arm design for continuous endpoints based on a weighted information measure

Gianmarco Caruso, Pavel Mozgunov

原文摘要

Multi-arm trials are gaining interest in practice given the statistical and logistical advantages they can offer. The standard approach uses a fixed allocation ratio, but there is a call for making it adaptive and skewing the allocation of patients towards better-performing arms. However, it is well-known that these approaches might suffer from lower statistical power. We present a response-adaptive design for continuous endpoints which explicitly allows to control the trade-off between the number of patients allocated to the "optimal" arm and the statistical power. Such a balance is achieved through the calibration of a tuning parameter, and we explore robust procedures to select it. The proposed criterion is based on a context-dependent information measure which gives greater weight to treatment arms with characteristics close to a pre-specified clinical target. We establish conditions under which the procedure consistently selects the target arm and derive the corresponding limiting allocation ratios. We also introduce a simulation-based hypothesis testing procedure which focuses on selecting the target arm and discuss strategies to effectively control the type-I error rate. The practical implementation of the proposed criterion and its potential advantage over currently used alternatives are illustrated in the context of early Phase IIa proof-of-concept oncology trials.

stat.ME · cs.IT · stat.AP

版本更新 · v2arXiv:2605.10395

Sharp feature-learning transitions and Bayes-optimal neural scaling laws in extensive-width networks

Minh-Toan Nguyen, Jean Barbier

原文摘要

We study the information-theoretic limits of learning a one-hidden-layer teacher network with hierarchical features from noisy queries, in the context of knowledge transfer to a smaller student model. We work in the high-dimensional regime where the teacher width $k$ scales linearly with the input dimension $d$ -- a setting that captures large-but-finite-width networks and has only recently become analytically tractable. Using a heuristic leave-one-out decoupling argument, validated numerically throughout, we derive asymptotically sharp characterizations of the Bayes-optimal generalization error and individual feature overlaps via a system of closed fixed-point equations. These equations reveal that feature learnability is governed by a sequence of sharp phase transitions: as data grows, teacher features become recoverable sequentially, each through a discontinuous jump in overlap. This sequential acquisition underlies a precise notion of \textit{effective width} $k_c$ -- the number of learnable features at a given data budget $n$ -- which unifies two distinct scaling regimes: a feature-learning regime in which the Bayes-optimal generalization error $\varepsilon^{\rm BO}$ scales as $ n^{1/(2β)-1}$, and a refinement regime in which it scales as $n^{-1}$, where $β>1/2$ is the exponent of the power-law feature hierarchy. Both laws collapse to the single relation $\varepsilon^{\rm BO}=Θ(k_c d/n)$. We further show empirically that a student trained with \textsc{Adam} near the effective width $k_c$ achieves these optimal scaling laws (up to a small algorithmic gap), and provide an information-theoretic account of the associated scaling in model size.

stat.ML · cond-mat.dis-nn · cond-mat.stat-mech · cs.IT · cs.LG

版本更新 · v2arXiv:2611.03193

Harnessing Mutual Coupling in Cell-Free mMIMO

Erind Tufa, Antonio A. D'Amico, Luca Sanguinetti

原文摘要

This letter investigates a cell-free massive MIMO system with $L$ access points (APs), each employing a small fixed-form-factor, uniform linear array of $N$ potentially closely spaced antennas. Utilizing multiport communication theory, we analyze the impact of mutual coupling on uplink and downlink spectral efficiency (SE) under various impedance-matching strategies. We compare two deployment regimes: ($i$) increasing $N$ while $L$ is kept fixed, and ($ii$) increasing $N$ while fixing the total antenna count $M = NL$. Numerical results show that, with a full matching network, mutual coupling itself becomes beneficial when an AP serves several user equipments, which is the typical operating regime of user-centric cell-free networks. Furthermore, with full matching, antenna densification can enhance SE or allow for a reduction in the number of APs without performance loss. Since full matching networks remain of manageable size in the small arrays of distributed APs, unlike in large centralized arrays, cell-free networks offer a natural setting for exploiting mutual coupling.

cs.IT · eess.SP

新论文 · v1arXiv:2611.22812

Pluggable Subband-Decoupled Fusion and Unlabeled Capture Prototype Calibration: Bridging High-SNR Null-Subcarrier Regrowth and Low-SNR Coherent Preambles for Cross-Domain IoT RF Fingerprinting

Fengchong Yao, Jianbing Li, Qing Liu, Kefeng Song, Haitao Li, Song Wang, Kunpeng Wang

原文摘要

Zero-overhead physical-layer authentication at edge wireless access points (APs) is vital for securing resource-constrained Internet of Things (IoT) transceivers against credential cloning, yet cross-domain IEEE 802.11a/g radio frequency fingerprint identification (RFFI) faces an acute signal-to-noise ratio (SNR) crossover. Power-amplifier spectral regrowth on unpopulated null subcarriers resists indoor multipath at high SNR but decays quadratically below the thermal noise floor, whereas populated active in-band preambles survive low SNR yet degrade under severe multipath, causing static fusion to lose up to 44.7 percentage points (pp). To our knowledge, we propose the first RFFI framework that dynamically modulates active in-band waveforms and unpopulated null-subcarrier regrowth via a blind physical SNR gate: Pluggable Gated Subband-Decoupled Fusion with Unlabeled Capture-Aware Prototype Calibration (GSDF-CAPC). Avoiding the 20-35 dB subband gradient imbalance of joint training, GSDF pairs any frozen pretrained host backbone with a 46.3K null-subcarrier plug-in encoder (NS-Branch), fusing scale-standardized logits and gate-warped spherical embeddings under a source-calibrated lag-64 thermal-SNR gate with exact low-SNR fallback. Over unlabeled target AP captures, forward-only unbalanced optimal-transport calibration (UOT-CAPC) aligns shifted prototypes under packet-arrival skew and recovers parameter-free balanced Sinkhorn (U-CAPC) at equipartition. Across DataPort-WiFi, WiSig, and ORBIT MobRFFI, zero-retrain GSDF wins all 72/72 paired runs across eight backbones with 0.00 pp low-SNR loss, while edge IB-Host + GSDF (92.6K-93.3K active parameters, 1.82 ms single-core CPU latency) and timing-synchronized GSDF-STO / GSDF-Tri reach 57.50%-65.05% three-benchmark Macro-F1 (89.04%-100.00% over 5-10-packet IoT bursts).

cs.AI · cs.IT · eess.AS · eess.SP

版本更新 · v2arXiv:2610.03704

Non-isomorphic graphs have distinct vertex-Ramsey classes

Maria Axenovich, Patrick Schmitteckert

原文摘要

For a graph $H$, its $k$-colour vertex Ramsey class is the set of all graphs $G$ such that any colouring of the vertices of $G$ in $k$ colours results in a monochromatic (induced) copy of $H$. We prove that for any $k$, the $k$-colour vertex Ramsey classes of any non-isomorphic graphs are distinct. Moreover, we show that this property does not hold when individual graphs are replaced with families of graphs.

math.CO · cs.IT

版本更新 · v2arXiv:2605.30976

Batched Stochastic Linear Bandits with 1-Bit Communication Constraints

Ivan Lau, Daniel McMorrow, Kevin Jamieson, Jonathan Scarlett

原文摘要

We study stochastic linear bandits under a natural combination of batching and communication constraints: the time horizon is partitioned into batches of equal size $B$, and during each batch the learner sends $B$ requested arm pulls to an agent, who then observes the corresponding $B$ rewards and responds with a single bit of feedback to the learner. For each batch, the learner specifies the 1-bit quantization rule the agent uses, which may depend on all previously received bits but not on any past rewards directly. This setting addresses a significant yet unexplored ``middle ground'' between previous models having per-round quantization only or total bit budgets only. We establish a minimax lower bound showing that $Ω(B\min\{d,\log\lvert \mathcal{A} \rvert\})$ regret is unavoidable due to the 1-bit communication bottleneck, even in the absence of noise. Combined with standard statistical limits, this yields a general lower bound of $\widetildeΩ(B\min\{d,\log\lvert \mathcal{A} \rvert\} + \sqrt{dT \min\{d,\log\lvert \mathcal{A} \rvert\}})$. We develop two phased-elimination algorithms based on $G$-optimal designs and 1-bit mean estimation. The first achieves $\widetilde{O}(dB + d\sqrt{T})$ regret, matching the lower bound up to logarithmic factors when $\lvert \mathcal{A} \rvert = \exp(Ω(d))$, and the second incorporates a safe-arm identification and warm-start procedure to obtain $\widetilde{O}(B\log\lvert \mathcal{A} \rvert + d^{3/2}\sqrt{B} + \sqrt{dT\log\lvert \mathcal{A} \rvert})$ regret, which is near-optimal in broad scaling regimes of $(\lvert \mathcal{A} \rvert, B, d, T)$. Together, our results demonstrate that a single bit of feedback per batch suffices to nearly match the minimax regret of unconstrained linear bandits in broad scaling regimes, even for batch sizes as large as $Θ(\sqrt{T})$.

stat.ML · cs.IT · cs.LG

版本更新 · v4arXiv:2511.04088

Efficient and rate-optimal list-decoding in the presence of minimal feedback

Pranav Joshi, Daniel McMorrow, Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi

原文摘要

Given a channel with length-$n$ inputs and outputs over the alphabet $\{0,1,\ldots,q-1\}$, and of which a fraction $\varrho \in (0,1-1/q)$ of symbols can be arbitrarily corrupted by an adversary, a fundamental problem is that of communicating at rates close to the information-theoretically optimal values, while ensuring the receiver can infer that the transmitter's message is from a ``small" set. While the existence of such codes is known, and constructions with computationally tractable encoding/decoding procedures are known for large $q$, we provide the first schemes that attain this performance for any $q \geq 2$, as long as low-rate feedback (asymptotically negligible relative to the number of transmissions) from the receiver to the transmitter is available. For any sufficiently small $\varepsilon > 0$ and $\varrho \in (1-{1}/{q}-Θ(\sqrt{\varepsilon}))$ our minimal feedback scheme has the following parameters: Rate $1-H_q(\varrho) - \varepsilon$ (i.e., $\varepsilon$-close to information-theoretically optimal -- here $H_q(\varrho)$ is the $q$-ary entropy function), list-size $\exp\left(\mathcal{O}\left(\varepsilon^{-3/2}\log^2(1/\varepsilon)\right)\right)$, computational complexity of encoding/decoding $n^{\mathcal{O}(\varepsilon^{-1}\log(1/\varepsilon))}$, storage complexity $\mathcal{O}(n^{η+1}\log n)$ for a code design parameter $η>1$ that trades off storage complexity with the probability of error. The error probability is $\mathcal{O}(n^{-η})$, and the (vanishing) feedback rate is $\mathcal{O}({1}/{\sqrt{\log(n)}})$. Our full-feedback scheme has zero probability of error and minimal storage complexity, while the other parameters are the same as the vanishing rate feedback scheme.

cs.IT

版本更新 · v2arXiv:2606.00512

Semi-Supervised Learning with Noisy Proxy Covariates: Generalization Bounds and Distribution Regression

Kwangho Kim, Jisu Kim

原文摘要

In many modern machine learning pipelines, abundant pretrained representations serve as noisy proxy covariates, while task-specific labels remain scarce. We study semi-supervised regression in this setting, and propose a simple two stage estimator that learns kernel eigenfeatures from all proxy covariates and fits a ridge predictor on labeled data. We derive finite sample bounds showing that fast labeled sample rates are recovered when proxy perturbation is controlled and unlabeled proxy covariates are sufficiently abundant. We also show that distribution regression is a direct special case, with analogous guarantees when the finite bag size is large enough. Experiments show consistent gains over supervised and semi-supervised baselines, especially in low label regimes.

cs.LG · cs.IT · stat.ML

新论文 · v1arXiv:2611.22617

Hardness and Inapproximability of the Covering Radius for LDPC Codes

Massimo Battaglioni, Fabrizio Marinelli

原文摘要

Given a binary parity-check matrix $H$ and an integer $r$, the covering-radius decision problem asks whether every attainable syndrome can be represented by an error vector of Hamming weight at most $r$. We study this problem for sparse parity-check matrices with bounded row and column weights. Using a bounded-occurrence quantified-SAT reduction, we prove that the problem is $Π_2^{\mathrm P}$-complete for matrices with maximum row and column weight three, and remains $Π_2^{\mathrm P}$-hard under a constant multiplicative gap. Starting from Vertex Cover on 3-regular graphs, we also obtain an explicit NP-hard approximation factor under the same weight constraints. We remark that weight three is the exact threshold for hardness: if either the maximum row weight or the maximum column weight is at most two, the covering radius can be computed in polynomial time.

cs.IT

新论文 · v1arXiv:2611.22587

Constructions of reversible linear and DNA codes through $T_{D,g}^n-$set and $(n_1,c_1|n_2,c_2)-$right polycyclic codes

Avanish Kumar Chaturvedi, Satyadeep Pandey

原文摘要

In this paper we give a construction technique of $T_{D,g}^n-$set for reversible linear codes and reversible DNA codes with their code parameters. This technique yields many reversible MDS codes which significantly improves the $T^n-$set construction by Oztas et.al. in terms of obtained code parameters. Concatenation-based constructions are presented for reversible linear codes satisfying self-duality and linear complementary dual (LCD) conditions, giving necessary and sufficient condition for desired dual properties. We introduce a new notion of $(n_1,c_1|n_2,c_2)-$ right polycyclic codes. Also, a new construction technique is developed to obtain reversible linear $(n_1,c_1|n_2,c_2)-$ right polycyclic codes with good parameters (MDS codes) over any finite commutative rings.

cs.IT · math.RA

新论文 · v1arXiv:2611.22581

FAST: Functional Adaptive Sensing and Testing for Quickest Change Detection

Peiyao Liu, Jie Guo, Zhijun Wang, Xueru Zhang, Nan Chen

原文摘要

Quickest change detection (QCD) is studied for partially observed functional data streams. At each sampling epoch, a function is realized over a continuous domain, but its values can be observed at only a fixed number of locations. At an unknown change point, the functional mean undergoes a shift that is assumed to admit a sparse representation in a localized basis. We propose Functional Adaptive Sensing and Testing (FAST), which jointly estimates the unknown post-change parameter, selects sensing locations, and performs sequential detection. A minimax lower bound on the worst-case detection delay is derived under an average-run-length constraint. A non-asymptotic estimation-error bound is established for the policy-dependent observations induced by adaptive sensing. Under the stated regularity conditions, FAST is first-order asymptotically optimal when sensing subsets are optimized exactly. Simulations and a wildfire case study demonstrate the performance of the proposed procedure.

stat.ME · cs.IT

版本更新 · v2arXiv:2611.18239

Neural Classifiers as Error-Correcting Codes

Sergey Salishev, Anton Makarov, Oleg Granichin, Renata Avros, Zeev Volkovich

原文摘要

A unified framework is proposed that characterizes supervised deep classification as the decoding of error-correcting codes in the Shannon sense. Cross-entropy optimization is shown to align softmax classifiers with maximum-likelihood decoding, where logits map to Hamming distances to class-specific codewords. This correspondence explains the emergence of standard divergence objectives (e.g., Kullback-Leibler, Jeffreys, Bregman) and provides a geometric basis for the stability of decision boundaries. Furthermore, the geometries of Neural Collapse and LeJEPA are identified as optimal constellations for decoding under isotropic noise. Unlike classical Error-Correcting Output Codes, deep networks are shown to learn effective codebooks in the feature space implicitly. This insight is leveraged to derive novel criteria for lossless quantization, improved knowledge distillation, and architectural regularization based on code redundancy. Finally, this perspective is extended to self-supervised encoders, offering a cohesive explanation for the geometry of latent representations in modern neural models.

cs.LG · cs.IT

版本更新 · v2arXiv:2606.10633

On concatenation of matrices for reversible linear codes over a finite commutative ring and applications to DNA codes

Avanish Kumar Chaturvedi, Satyadeep Pandey

原文摘要

In this paper, we develop a generalized framework for constructing reversible linear, reversible self dual and reversible DNA codes using a matrix-theoretic approach based on involutory matrices. The proposed concatenation scheme gives a large class of generator matrices and yields codes with good parameters. The construction is carried out at the level of linear codes and then extended to DNA codes. Using a matrix product approach, we provide a unified method for analysis and proof. Further, we resolve an open problem raised by Oztas et.al. and also we correct and improve some results of them.

cs.IT · math.RA

新论文 · v1arXiv:2611.22441

On the Kissing Number of Craig's Lattice and Spherical List Decoding

Léo Ducas, Julian Nowakowski, Ailsa Robertson

原文摘要

Craig's lattices $A_{p-1}^k$ are a family of lattices with large kissing numbers, i.e., relative to their dimension $n = p-1$, they contain a large number of shortest nonzero vectors. Specifically, for small $k = o(\log p / \log \log p)$, a lower bound of Bacher (2015) shows that $A_{p-1}^k$ has a super-polynomial kissing number of $ω(n^k)$. Craig's lattices are therefore attractive candidates for the construction of spherical codes. In this work, we introduce a polynomial-time list decoder for spherical codes obtained from Craig's lattices for angular distance below $45^\circ$. Our second main result shows that Bacher's lower bound is asymptotically tight for $k = o(\log p / \log \log p)$. Finally, we introduce an efficient algorithm for computing the kissing number of $A_{p-1}^k$. Using this algorithm, we compute their kissing number in dimensions up to 521. Based on this data, we pose the open question whether the kissing number of $A_{p-1}^k$ with $k \approx \sqrt{p}$ grows like $e^{Θ(\sqrt{n})}$ in dimension $n=p-1$. Concurrent work by Laarhoven and Kominers as well as Bennett, Hhan, Li and Stephens-Davidowitz proves such a bound for very closely related lattices.

cs.IT