The Index of Invariance and its Implications for a Parameterized Least Squares Problem
L\'eopold Cambier, Rahul Sarkar

TL;DR
This paper introduces the index of invariance for subspaces relative to a matrix, analyzing its properties and implications for parameterized least squares problems, especially in Krylov subspaces, connecting to classical iterative methods.
Contribution
It defines the index of invariance, studies its properties, and relates it to solution subspace dimensions and classical iterative methods like CG and MINRES.
Findings
The index of invariance bounds the solution difference subspace dimension.
Conditions under which the solution set dimension equals the index of invariance.
Sets of matrices with prescribed subspace relations form smooth manifolds.
Abstract
We study the problem , with , for a subspace of ( or ), and . We show that there exists a subspace of , independent of , such that , where , a quantity which we call the index of invariance of with respect to . In particular if is a Krylov subspace, this implies the low dimensionality result of Hallman & Gu (2018). The problem is also such that when is positive and is a Krylov subspace, it reduces to CG for and to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Graph theory and applications · Advanced Graph Theory Research
