atlas

Research map / Learning theory and algorithms / Sample complexity

Near optimal finite time identification of arbitrary linear dynamical systems

ICML 2019 · Learning theory and algorithms › Sample complexity · approach: Statistical-query lower bounds · 74 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a coupled analysis of sample covariance and the self-normalized martingale termOLS system identification · Stable and marginally stable systemsOLS estimation error: √(C₀(d) log(1/δ) / T); C₁(d)/T log(T/δ)Helped
Use anti-concentration arguments and subgaussian tail inequalities for explosive systemsOLS system identification · Regular explosive systemsOLS estimation error: C₂(d) σmax(A⁻ᵀ)/δHelped
Extend the analysis to systems with eigenvalues in stable, marginally stable, and explosive regimesOLS system identification · General regular systemsOLS estimation error: poly(log T, log(1/δ))/T; poly(log T, log(1/δ))/√THelped
Use OLS without the regularity condition on explosive eigenvaluesOLS system identification · Irregular explosive systemsConsistencyHurt
Rely on signal-to-noise ratio rather than sample-covariance conditioning to predict consistencyOLS system identification · Explosive systemsConsistencyHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy