Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Parshakova, Tetiana, Hastie, Trevor, Darve, Eric, Boyd, Stephen
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914109798219776
author Parshakova, Tetiana
Hastie, Trevor
Darve, Eric
Boyd, Stephen
author_facet Parshakova, Tetiana
Hastie, Trevor
Darve, Eric
Boyd, Stephen
contents We consider multilevel low rank (MLR) matrices, defined as a row and column permutation of a sum of matrices, each one a block diagonal refinement of the previous one, with all blocks low rank given in factored form. MLR matrices extend low rank matrices but share many of their properties, such as the total storage required and complexity of matrix-vector multiplication. We address three problems that arise in fitting a given matrix by an MLR matrix in the Frobenius norm. The first problem is factor fitting, where we adjust the factors of the MLR matrix. The second is rank allocation, where we choose the ranks of the blocks in each level, subject to the total rank having a given value, which preserves the total storage needed for the MLR matrix. The final problem is to choose the hierarchical partition of rows and columns, along with the ranks and factors. This paper is accompanied by an open source package that implements the proposed methods.
format Preprint
id arxiv_https___arxiv_org_abs_2310_19214
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices
Parshakova, Tetiana
Hastie, Trevor
Darve, Eric
Boyd, Stephen
Machine Learning
Mathematical Software
Optimization and Control
We consider multilevel low rank (MLR) matrices, defined as a row and column permutation of a sum of matrices, each one a block diagonal refinement of the previous one, with all blocks low rank given in factored form. MLR matrices extend low rank matrices but share many of their properties, such as the total storage required and complexity of matrix-vector multiplication. We address three problems that arise in fitting a given matrix by an MLR matrix in the Frobenius norm. The first problem is factor fitting, where we adjust the factors of the MLR matrix. The second is rank allocation, where we choose the ranks of the blocks in each level, subject to the total rank having a given value, which preserves the total storage needed for the MLR matrix. The final problem is to choose the hierarchical partition of rows and columns, along with the ranks and factors. This paper is accompanied by an open source package that implements the proposed methods.
title Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices
topic Machine Learning
Mathematical Software
Optimization and Control
url https://arxiv.org/abs/2310.19214