Searcharxiv⌕ Search

arXiv · 2610.04455

Identification and Recovery of Linear Dynamics from Partial Trajectories

Abstract

We study the joint recovery of an unknown system matrix $A\in\mathbb R^{n\times n}$ and a rank-$r$ initial-state matrix $X_0\in\mathbb R^{n\times m}$ from partial observations of the state matrices $A^tX_0$, for $t=0,\ldots,T$. Each trajectory is observed at a fixed set of state coordinates, which may differ across trajectories. We derive necessary conditions for identifiability, including obstructions arising from incomplete spatial coverage and insufficient dynamical span, as well as lower bounds on the number of observations. We then characterize the Jacobian of the measurement map, account for the intrinsic symmetry of the low-rank factorization, and establish a rank-certificate principle yielding generic local identifiability. When the trajectories whose initial states form a basis of $\operatorname{range}(X_0)$ are fully observed, we obtain necessary and sufficient rank conditions for global recovery, together with explicit reconstruction formulas. We formulate the joint recovery problem as a nonlinear least-squares problem over the system matrix $A$ and the low-rank factors of $X_0$, and solve it using Adam. Numerical experiments on synthetic and real-world data evaluate the recovery performance under different spatial sampling rates and observation horizons.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Le Gong. 2026-10-03. Identification and Recovery of Linear Dynamics from Partial Trajectories. https://arxiv.org/abs/2610.04455

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

KEEP EXPLORING

Related papers

Parametric and structure-aware information theory for multi-scale analysis of composition

Compositional data is common across the natural and social sciences, requiring methods to measure the diversity of compositions and the heterogeneity of collections of them. Via Bregman geometry, a strictly concave diversity index induces a measure of heterogeneity that decomposes across scales. A canonical example is Shannon entropy inducing mutual information. We develop this framework by incorporating category similarity into $α$-logarithmic entropy, a parametric diversity index. We disprove an existing general concavity result and prove that, for $α=3$, the region of strict concavity is always convex, complementing previous results for $α=1$ and $2$. The resulting geometry provides methods to compare compositions substantially faster than optimal transport. Applied to occupation compositions across England and Wales, they reveal distinct regionalisations based on different notions of occupation relatedness. Applied to ecological data, they recover established patterns of functional and taxonomic $β$-diversity, and reveal sensitivity to the diversity parameter.

cs.IT↗

Improved Characterization of the Memory-Rate Tradeoff for Demand-Private Coded Caching With Multiple Demands

We consider a coded caching problem with multiple demands under a privacy constraint. In this problem, a server with access to $N$ files serves $K$ users over a shared link, and each user requests $L$ distinct files. The privacy constraint requires that each user obtain no information about the demands of the other users. We first propose a new achievable scheme for arbitrary $N$, $K$, and $L$ by applying a novel transformation to a suitable non-private coded caching scheme. We then derive a new converse bound, and show that the proposed scheme is order optimal within a multiplicative factor of $6$ of this bound. Finally, for the case of two users, we completely characterize the optimal memory-rate tradeoff for arbitrary $N$ and $L$ through three new achievable schemes and matching converse bounds.

cs.IT↗

Learning LDPC codes with density evolution over relaxed protographs

We consider the design of low-density parity-check (LDPC) codes for a given iterative decoder. While LDPC performance can be evaluated using simulation, density evolution (DE), or EXIT-chart analysis, selecting a parity-check matrix (PCM) remains a difficult combinatorial optimization problem. Existing approaches often rely on population-based search, random mutations, or genetic algorithms, which require careful tuning and incur high computational cost. Recent gradient descent (GD)-based methods optimize relaxed PCMs by differentiating through decoder simulations, but rely on noisy Monte Carlo estimates, line searches over soft matrix representations, and remain costly for long codes. Moreover, the loss is typically evaluated only at integer-valued PCMs. We focus on long protograph-based LDPC codes and propose a deterministic GD-based framework operating directly on a relaxed protograph representation. The loss is based on DE bit error rate (BER) and can be evaluated directly for relaxed protographs. To justify this relaxation, we associate the relaxed representation with an ensemble of binary PCMs and show that the proposed relaxed DE yields the ensemble-averaged DE performance. The resulting procedure supports standard GD optimization and achieves fast, reliable convergence through deterministic DE evaluation and informative gradients. Numerical results show that the optimized protographs outperform 5G LDPC codes with matching dimensions.

cs.IT↗