Tetiana Parshakova, Trevor Hastie, Eric Darve, Stephen Boyd
{"title":"多层次低秩矩阵的因子拟合、秩分配与划分","authors":"Tetiana Parshakova, Trevor Hastie, Eric Darve, Stephen Boyd","doi":"arxiv-2310.19214","DOIUrl":null,"url":null,"abstract":"We consider multilevel low rank (MLR) matrices, defined as a row and column\npermutation of a sum of matrices, each one a block diagonal refinement of the\nprevious one, with all blocks low rank given in factored form. MLR matrices\nextend low rank matrices but share many of their properties, such as the total\nstorage required and complexity of matrix-vector multiplication. We address\nthree problems that arise in fitting a given matrix by an MLR matrix in the\nFrobenius norm. The first problem is factor fitting, where we adjust the\nfactors of the MLR matrix. The second is rank allocation, where we choose the\nranks of the blocks in each level, subject to the total rank having a given\nvalue, which preserves the total storage needed for the MLR matrix. The final\nproblem is to choose the hierarchical partition of rows and columns, along with\nthe ranks and factors. This paper is accompanied by an open source package that\nimplements the proposed methods.","PeriodicalId":501256,"journal":{"name":"arXiv - CS - Mathematical Software","volume":"18 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices\",\"authors\":\"Tetiana Parshakova, Trevor Hastie, Eric Darve, Stephen Boyd\",\"doi\":\"arxiv-2310.19214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider multilevel low rank (MLR) matrices, defined as a row and column\\npermutation of a sum of matrices, each one a block diagonal refinement of the\\nprevious one, with all blocks low rank given in factored form. MLR matrices\\nextend low rank matrices but share many of their properties, such as the total\\nstorage required and complexity of matrix-vector multiplication. We address\\nthree problems that arise in fitting a given matrix by an MLR matrix in the\\nFrobenius norm. The first problem is factor fitting, where we adjust the\\nfactors of the MLR matrix. The second is rank allocation, where we choose the\\nranks of the blocks in each level, subject to the total rank having a given\\nvalue, which preserves the total storage needed for the MLR matrix. The final\\nproblem is to choose the hierarchical partition of rows and columns, along with\\nthe ranks and factors. This paper is accompanied by an open source package that\\nimplements the proposed methods.\",\"PeriodicalId\":501256,\"journal\":{\"name\":\"arXiv - CS - Mathematical Software\",\"volume\":\"18 4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Mathematical Software\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2310.19214\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Mathematical Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2310.19214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices
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.