Pith. sign in

REVIEW 1 cited by

Estimation of Models with Limited Data by Leveraging Shared Structure

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 2310.02864 v1 pith:SUZK3UQL submitted 2023-10-04 cs.LG math.STstat.TH

classification cs.LGmath.STstat.TH
keywords datasystemsparametersmethodsubspaceestimateestimatesestimation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Modern data sets, such as those in healthcare and e-commerce, are often derived from many individuals or systems but have insufficient data from each source alone to separately estimate individual, often high-dimensional, model parameters. If there is shared structure among systems however, it may be possible to leverage data from other systems to help estimate individual parameters, which could otherwise be non-identifiable. In this paper, we assume systems share a latent low-dimensional parameter space and propose a method for recovering $d$-dimensional parameters for $N$ different linear systems, even when there are only $T<d$ observations per system. To do so, we develop a three-step algorithm which estimates the low-dimensional subspace spanned by the systems' parameters and produces refined parameter estimates within the subspace. We provide finite sample subspace estimation error guarantees for our proposed method. Finally, we experimentally validate our method on simulations with i.i.d. regression data and as well as correlated time series data.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Learning clusters of partially observed linear dynamical systems

    eess.SY 2025-07 conditional novelty 6.0 of 10

    A clustering-then-refinement algorithm learns clusters of linear systems from many short trajectories, with a 1/sqrt(NT) error trade-off and finite-sample guarantees.

Pith tools