Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.07728

Space-Time Information Interchangeability in Dynamical Systems: Conditions and Bounds for Replacing Spatial Sensors with Temporal Histories

Maryam Reza·Farbod Faraji
View original source ↗Read source document ↗Export metadata ↓

Abstract

Many dynamical-state reconstruction problems seek to infer a high-dimensional spatial state from measurements at only a few locations. Because the governing dynamics couple evolution across space and time, temporal measurements can contain information about state components beyond the sensor locations. This work develops a theoretical framework comparing the information content of a temporal measurement history with that of a specified instantaneous spatial sensor array. The temporal history and spatial reference array are represented by prior-whitened information operators that account for prior variability, sensor geometry, and measurement noise while preserving the directional distribution of uncertainty reduction. A general space-time information-exchange theorem gives necessary and sufficient conditions for retaining a prescribed fraction of the spatial-reference information in every state direction. It answers three practical questions. First, how many temporal measurements and how much total information are required? Second, is the prescribed fraction attainable, or does a limiting information ceiling rule out every finite history? Third, when attainable, what history length is sufficient? Explicit history-length bounds are derived for contractive, spectrally separated unitary, and simultaneously diagonalizable dissipative linear dynamics, and for stochastic linear estimation under Gaussian process and measurement noise. For nonlinear systems, global delay-map injectivity is combined with a uniform local Fisher-information condition. Numerical experiments test directional exchange lengths, information ceilings, and finite-memory bounds, and assess nonlinear delay-map distinguishability and local Fisher-information predictions. The framework provides an explicit basis for determining when temporal measurements can reduce spatial sensor coverage for full-state reconstruction.

Explore related subjects

cs.ITmath.DSmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maryam Reza, Farbod Faraji. 2026-08-07. Space-Time Information Interchangeability in Dynamical Systems: Conditions and Bounds for Replacing Spatial Sensors with Temporal Histories. https://arxiv.org/abs/2608.07728

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

KEEP EXPLORING

Related papers

arXiv2026

Radiance-Field Guided Pretraining: Scaling Localization Models with Unlabeled Wireless Signals

Radio frequency (RF)-based indoor localization offers significant promise for applications such as indoor navigation, augmented reality, and pervasive computing. While deep learning has greatly enhanced localization accuracy and robustness, existing localization models still face major challenges in cross-scene generalization due to their reliance on scene-specific labeled data. To address this, we introduce Radiance-Field Reinforced Pretraining (RFRP). This novel self-supervised pretraining framework couples a large localization model (LM) with a neural radio-frequency radiance field (RF-NeRF) in an asymmetrical autoencoder architecture. In this design, the LM encodes received RF spectra into latent, position-relevant representations, while the RF-NeRF decodes them to reconstruct the original spectra. This alignment between input and output enables effective representation learning using large-scale, unlabeled RF data, which can be collected continuously with minimal effort. To this end, we collected RF samples at 7,327,321 positions across 100 diverse scenes using four common wireless technologies--RFID, BLE, WiFi, and IIoT. Data from 75 scenes were used for training, and the remaining 25 for evaluation. Experimental results show that the RFRP-pretrained LM reduces localization error by over 40% compared to non-pretrained models and by 21% compared to those pretrained using supervised learning.

cs.IT↗
arXiv2026

Uniform Recovery of Structured Signals from Nonlinear Observations: Improved Error Rates

Consider the recovery of structured signals from nonlinear observations. Under Gaussian matrix and a large class of unknown nonlinear link functions, Plan and Vershynin (2016) showed that generalized Lasso achieves accurate nonuniform recovery of a fixed signal. More recently, Genzel and Stollenwerk (2023) showed that generalized Lasso is indeed capable of accurately recovering all structured signals. However, in some canonical settings with discontinuous link functions, their uniform recovery error rate is essentially slower than the nonuniform one. Specifically, in the recovery of $n$-dimensional $k$-sparse vectors from $m$ measurements, generalized Lasso with a perfectly tuned $\ell_1$ constraint achieves nonuniform error rate $ O(\sqrt{k\log(en/k)/m})$, while the uniform error rate of Genzel and Stollenwerk is no faster than $O((k\log(en/k)/m)^{1/4})$. In this paper, we narrow this gap by establishing improved uniform recovery guarantees under piecewise Lipschitz link functions with well-separated jump discontinuities. We analyze a projected gradient descent (PGD) algorithm whose projection can be onto a convex set or a cone, and our results for the PGD with a convex set are also valid for the generalized Lasso. In sparse recovery, the improved uniform error rates match the nonuniform rate $O(\sqrt{k\log(en/k)/m})$ up to logarithmic factors. Under the sign link function, we further show that iterative hard thresholding (a specific instance of the PGD) achieves uniform recovery error rate $O(\sqrt{k\log(en/k)/m})$, matching the nonuniform rate up to a universal constant. Technically, the uniform guarantees for the PGD are obtained by showing that the gradient maps satisfy the restricted approximate invertibility condition uniformly over all signals. We demonstrate that this is a general approach to uniform recovery under nonlinear observations.

cs.IT↗
arXiv2026

Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy

Incremental redundancy (IR) can reduce error rates by spreading coded bits across multiple transmission attempts. However, conventional stop-and-wait operation with coarse feedback often over-provisions retransmissions, triggers unnecessary decoding attempts, and increases end-to-end latency. This paper develops enhanced feedback and scheduling mechanisms that predict the additional redundancy needed for successful decoding and allocate only the required resources. We study two complementary strategies. First, using channel statistics, we learn a one- or two-shot mapping from channel quality to the minimum redundancy budget. As a byproduct, we derive an achievable reliability lower bound on the error probability of hybrid automatic repeat request (HARQ) systems. Numerical results with polar-coded IR-HARQ scheme show that the bound can be closely approached by appropriately selecting the second-transmission redundancy over a wide SNR range with savings up to 60\% in retransmission size. Second, we propose a realization-aware early-feedback mechanism that uses first-transmission reliability information to make per-codeword decisions before decoding: whether the codeword is already decodable, if not, how many additional redundancy versions are needed, or whether decoding is unlikely and rate adaptation is preferable. Link-level simulations with 5G NR LDPC codes show that both predictors achieve high accuracy (about 96\% in our study), increasing the probability of successful decoding within at most two transmission occasions.

cs.IT↗