Regularization-Free Estimation in Trace Regression with Symmetric Positive Semidefinite Matrices

Abstract

Trace regression models have received considerable attention in the context of matrix completion, quantum state tomography, and compressed sensing. Estimation of the underlying matrix from regularization-based approaches promoting low-rankedness, notably nuclear norm regularization, have enjoyed great popularity. In this paper, we argue that such regularization may no longer be necessary if the underlying matrix is symmetric positive semidefinite (spd) and the design satisfies certain conditions. In this situation, simple least squares estimation subject to an spd constraint may perform as well as regularization-based approaches with a proper choice of regularization parameter, which entails knowledge of the noise level and/or tuning. By contrast, constrained least squaresestimation comes without any tuning parameter and may hence be preferred due to its simplicity.

Cite

Text

Slawski et al. "Regularization-Free Estimation in Trace Regression with Symmetric Positive Semidefinite Matrices." Neural Information Processing Systems, 2015.

Markdown

[Slawski et al. "Regularization-Free Estimation in Trace Regression with Symmetric Positive Semidefinite Matrices." Neural Information Processing Systems, 2015.](https://mlanthology.org/neurips/2015/slawski2015neurips-regularizationfree/)

BibTeX

@inproceedings{slawski2015neurips-regularizationfree,
  title     = {{Regularization-Free Estimation in Trace Regression with Symmetric Positive Semidefinite Matrices}},
  author    = {Slawski, Martin and Li, Ping and Hein, Matthias},
  booktitle = {Neural Information Processing Systems},
  year      = {2015},
  pages     = {2782-2790},
  url       = {https://mlanthology.org/neurips/2015/slawski2015neurips-regularizationfree/}
}