The use of the r∗ heuristic in covariance completion problems

Christian Grussler, Armin Zare, Mihailo R. Jovanović, Anders Rantzer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider a class of structured covariance completion problems which aim to complete partially known sample statistics in a way that is consistent with the underlying linear dynamics. The statistics of stochastic inputs are unknown and sought to explain the given correlations. Such inverse problems admit many solutions for the forcing correlations, but can be interpreted as an optimal low-rank approximation problem for identifying forcing models of low complexity. On the other hand, the quality of completion can be improved by utilizing information regarding the magnitude of unknown entries. We generalize theoretical results regarding the r∗ norm approximation and demonstrate the performance of this heuristic in completing partially available statistics using stochastically-driven linear models.

Original languageEnglish
Title of host publication2016 IEEE 55th Conference on Decision and Control, CDC 2016
Pages1978-1983
Number of pages6
ISBN (Electronic)9781509018376
DOIs
StatePublished - 27 Dec 2016
Externally publishedYes
Event55th IEEE Conference on Decision and Control, CDC 2016 - Las Vegas, United States
Duration: 12 Dec 201614 Dec 2016

Publication series

Name2016 IEEE 55th Conference on Decision and Control, CDC 2016

Conference

Conference55th IEEE Conference on Decision and Control, CDC 2016
Country/TerritoryUnited States
CityLas Vegas
Period12/12/1614/12/16

Keywords

  • Convex optimization
  • k-support-norm
  • low-rank approximation
  • nuclear norm regularization
  • state covariances
  • structured matrix completion problems

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Decision Sciences (miscellaneous)
  • Control and Optimization

Fingerprint

Dive into the research topics of 'The use of the r∗ heuristic in covariance completion problems'. Together they form a unique fingerprint.

Cite this