Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.14615

Limitations on Autoregressive Token Generation via Sequential Sampling

Gal Arnon·Andrej Bogdanov·Paul Lou·Giulio Malavolta·Alon Rosen·Lorenzo Taschin
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study autoregressive token generation through the notion of sequential samplers: A circuit that samples the next symbol only given the previous ones and possibly a small amount of state. We show that (1) a sequential sampler with $k$ bits of state can be simulated by a stateless one at a roughly $O(2^{k})$ size overhead; (2) efficient insertional sampling (Stern, Chan, Kiros, Uszkoreit, ICML 2019) is more powerful than efficient sequential sampling in any fixed order; (3) sequential samplers with small state cannot establish certain forms of covert cryptographic channels. Result (1), together with the pseudoentropy vs. sequential sampleability duality of Vadhan and Zheng (STOC 2012), characterizes efficient sequential sampleability with small state. Result (3) provides a potential safety mechanism against subliminal coordination among malicious LLM agents.

Explore related subjects

cs.ITcs.AIcs.CRmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gal Arnon, Andrej Bogdanov, Paul Lou, Giulio Malavolta, Alon Rosen, Lorenzo Taschin. 2026-10-10. Limitations on Autoregressive Token Generation via Sequential Sampling. https://arxiv.org/abs/2610.14615

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

DS and AMDS Symbol-Pair Codes from Three Families of Simple Root Cyclic Codes

Symbol-pair distances of simple-root cyclic codes are important for evaluating error correction performance under overlapping pair read channels. In this paper, we construct three families of simple-root cyclic codes over finite fields of odd characteristic via generator polynomials. For length \(2q+2\), the minimum symbol-pair distance is \(10\) for every odd prime power \(q\ge 7\), established by excluding invalid support configurations. For length \(4q-4\), when \(q\equiv 3\pmod 4\) and finite field constraints hold, it is \(9\) or \(10\). For length \(2(q-1)\), reciprocal-polynomial analysis shows it is \(11\) or \(12\). All obtained codes are MDS or AMDS symbol-pair codes.

cs.IT↗
arXiv2026

DeepTelecom: A Differentiable Multimodal Framework for Channel Twinning in Dynamic Heterogeneous Wireless Environments

Large-scale multimodal data are a key enabler for integrating large generative artificial intelligence models into wireless networks. However, existing wireless datasets offer limited support for heterogeneous environments, particularly in terms of reusable high-fidelity scenes, scalable differentiable ray tracing, and synchronized multimodal data. These limitations are more pronounced in mobile and aerial scenarios with time-varying environments and channels. To address these limitations, we propose DeepTelecom, a material-aware, high-fidelity multimodal channel dataset and reproducible generation framework for networks involving unmanned aerial vehicles (UAVs) and reconfigurable intelligent surfaces. DeepTelecom refines coarse indoor/outdoor reconstructions and uses a large language model to map segmented surfaces to frequency-dependent electromagnetic parameters, yielding material-aware Level of Detail 3 digital twins. Then, a differentiable GPU-accelerated Sionna ray tracer simulates propagation across the sub-6 GHz/millimeter-wave/sub-terahertz bands, and specifically captures rotor-induced micro-Doppler signatures of stationary or moving UAVs at different pitch angles and translational velocities. The framework synchronously produces channel tensors, coverage maps, transmission videos, multi-view images, and weather-conditioned renderings, and supports differentiable material calibration from sparse channel anchors. The released dataset contains 10 material-aware indoor/outdoor scenes and 50,000 synchronized UAV samples; the framework supports scalable generation of additional data for user-defined scenes and system configurations. In 3D UAV localization, DeepTelecom reduces the 90th-percentile error from 31.05 m to 2.43 m compared with schemes considering only channel state information, demonstrating its significance for artificial-intelligence-enabled wireless systems.

cs.IT↗
arXiv2026

Optimal Receive Design on the Observation Axis for RSMA Satellite-UAV Downlinks

A receiver can change its observation state while the physical signal remains the same. In rate-splitting multiple access (RSMA) downlinks, this distinction separates receive-beam design and phase-reference transport from the motion of the satellite--UAV line of sight. We formulate receive optimization within the physical--observation dual-axis (PODA) structure and obtain three complementary results. For a known line-of-sight response and positive-definite receiver-noise covariance, a noise-weighted matched combiner simultaneously maximizes every decoding SINR and the minimum user rate. Under directional uncertainty, the principal eigenvector of the conditional response covariance globally maximizes mean array gain; for a Gaussian directional model, an equal-amplitude receiver is optimized by steering towards the conditional mean. Mean rate requires a different objective. We prove that the RSMA common-rate water level is jointly concave in the users' receive gains and derive a semidefinite relaxation with a computable global upper bound. A feasible rank-one beam can therefore be compared directly with the optimum of the finite-scenario problem. We also derive a precision-weighted linear predictor that suppresses uncertain physical-velocity estimates after observation-frame transport. Paired dynamic simulations reduce direction-cosine RMSE by 51.29\% relative to unrestricted nine-point extrapolation. In a separate uncertainty experiment, direct rate optimization increases mean minimum spectral efficiency from 0.32425 to 0.41712 bit/s/Hz, an improvement of 28.64\%; the corresponding design objective is within $2.28\times10^{-4}$ bit/s/Hz of a global upper bound. The phase-transport equation fixes a coherent representative of each optimal beam without changing its gain.

cs.IT↗