Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 46 min ago
PreprintarXiv licencearXiv

Characterizing Identifiability and Generalization for Inverse Receding-Horizon Linear-Quadratic Regulator Problems

Abstract

We consider the problem of objective inference in the context of receding-horizon linear-quadratic regulator (LQR). In this setting, we are given sequential state-action observations, where each observed action is the first control of a newly solved finite-horizon LQR problem. We characterize when the objective of that problem is uniquely identifiable from these observations and when additional observations provide no new information about the objective. We then analyze action prediction at unseen states and show that all objectives reproducing the observed actions yield identical actions throughout the affine hull of the observed states; outside this hull, we derive an upper bound on the prediction error. % and deriving a prediction-error bound outside this hull. Additionally, we show that, when only the linear objective terms are unknown, exact prediction holds at every state. Finally, numerical results show that, even under stochastic observation noise, re-optimizing an inferred objective enables accurate action prediction at unseen states across different planning horizons.

Related

  1. Characterizing Identifiability in Boolean Factor Models
    Mengqi Lin, Gongjun Xu
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. (Cheap) Stochastic Policy Gradient Converges with High Probability for Linear Quadratic Regulator
    Yan Li, Chengze Xie
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. Quadratic Weak-to-Strong Generalization in Random Feature Networks via Random Matrix Theory
    Deborah Oliveira, Elliot Paquette
    arXivPreprintCC BY 4.0Full textProbabilityStatisticsarXiv
  4. Spectral Indistinguishability and Learning-Curve Identifiability in Quadratic Networks
    Dekun Yang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Finite-time boundary collision in planar linear quadratic regulator gradient flows
    Kang Liu
    arXivPreprintarXiv licenceFull textDynamical systemsOptimisation & controlarXiv
BibTeX
@misc{jin2026characterizing,
  title = {{Characterizing Identifiability and Generalization for Inverse Receding-Horizon Linear-Quadratic Regulator Problems}},
  author = {Zhiyuan Jin and Jingqi Li and David Fridovich-Keil},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.14053},
  eprint = {2609.14053},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.14053},
}
RIS
TY  - UNPB
TI  - Characterizing Identifiability and Generalization for Inverse Receding-Horizon Linear-Quadratic Regulator Problems
AU  - Zhiyuan Jin
AU  - Jingqi Li
AU  - David Fridovich-Keil
PY  - 2026
DA  - 2026/09/12
PB  - arXiv
DO  - 10.48550/arxiv.2609.14053
UR  - https://arxiv.org/abs/2609.14053
AB  - We consider the problem of objective inference in the context of receding-horizon linear-quadratic regulator (LQR). In this setting, we are given sequential state-action observations, where each observed action is the first control of a newly solved finite-horizon LQR problem. We characterize when the objective of that problem is uniquely identifiable from these observations and when additional observations provide no new information about the objective. We then analyze action prediction at unseen states and show that all objectives reproducing the observed actions yield identical actions throughout the affine hull of the observed states; outside this hull, we derive an upper bound on the prediction error. % and deriving a prediction-error bound outside this hull. Additionally, we show that, when only the linear objective terms are unknown, exact prediction holds at every state. Finally, numerical results show that, even under stochastic observation noise, re-optimizing an inferred objective enables accurate action prediction at unseen states across different planning horizons.
ER  -