Pith. sign in

REVIEW 1 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2512.05337 v2 pith:O2BZVNK5 submitted 2025-12-05 stat.ML cs.LGcs.SYeess.SYmath.OC

Symmetric Linear Dynamical Systems are Learnable from Few Observations

classification stat.ML cs.LGcs.SYeess.SYmath.OC
keywords observationsestimatorlinearsymmetricachievesanalyzeapplicationsconsider
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider the problem of learning the parameters of a $N$-dimensional stochastic linear dynamics under both full and partial observations from a single trajectory of time $T$. We introduce and analyze a new estimator that achieves a small maximum element-wise error on the recovery of symmetric dynamic matrices using only $T=\mathcal{O}(\log N)$ observations, irrespective of whether the matrix is sparse or dense. This estimator is based on the method of moments and does not rely on problem-specific regularization. This is especially important for applications such as structure discovery.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Network Reconstruction in Consensus Algorithms with Hidden Agents

    eess.SY 2026-04 unverdicted novelty 6.0

    A truncated autoregressive expansion of follower dynamics reconstructs the complete coupling matrix in consensus algorithms with hidden leaders when leaders have short memory and an extra non-degeneracy assumption holds.