[16] P. Drineas and M. W. Mahoney. RandNLA: Randomized numerical linear algebra. Commun. ACM, 59(6):80–90, may 2016. ISSN 0001-0782. doi: 10.1145/2842602. URL https://doi.org/10.1145/2842602. (Cited on page 2)
[17] P. Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SIAM Journal on Computing, 36(1): 158-183, 2006. doi: 10.1137/S0097539704442696. URL https://doi.org/10.1137/S0097539704442696. (Cited on page 2)
[18] C. Eckart and G. Young. The approximation of one matrix by another of lower rank. Psychometrika, 1:211-218, 1936. doi: https://doi.org/10.1007/BF02288367. URL https://rdcu.be/dcbK1. (Cited on page 2)
[19] E. Frantar, S. Ashkboos, T. Hoefler, and D. Alistharh. Gptq: Accurate post-training quantization for generative pre-trained transformers. arXiv preprint arXiv:2210.17323, 2022. (Cited on page 9)
[20] H. M. Gach, C. Tanase, and F. Boada. 2D & 3D shepp-logan phantom standards for MRI. In 2008 19th International Conference on Systems Engineering, pages 521-526. IEEE, 2008. (Cited on page 7)
[21] A. Gholami, S. Kim, Z. Dong, Z. Yao, M. W. Mahoney, and K. Keutzer. A survey of quantization methods for efficient neural network inference, 2021. URL https://arxiv.org/abs/2103.13630. (Cited on page 2)
[22] R. Gray and T. Stockham. Dithered quantizers. IEEE Transactions on Information Theory, 39 (3):805-812, 1993. doi: 10.1109/18.256489. (Cited on page 3)
[23] N. Halko, P. G. Martinsson, and J. A. Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2):217-288, 2011. doi: 10.1137/090771806. URL https://doi.org/10.1137/090771806. (Cited on pages 2 and 29)
[24] A. Howard, M. Sandler, G. Chu, L.-C. Chen, B. Chen, M. Tan, W. Wang, Y. Zhu, R. Pang, V. Vasudevan, Q. V. Le, and H. Adam. Searching for mobilenetv3, 2019. URL https://arxiv.org/abs/1905.02244. (Cited on page 8)
[25] E. J. Hu, Y. Shen, P. Wallis, Z. Allen-Zhu, Y. Li, S. Wang, L. Wang, and W. Chen. LoRA: Low-rank adaptation of large language models. In International Conference on Learning Representations, 2022. URL https://openreview.net/forum?id=nZeVKeeFYf9. (Cited on pages 1 and 9)
[26] Y. Idelbayev and M. A. Carreira-Perpinan. Low-rank compression of neural nets: Learning the rank of each layer. In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 8046–8056, 2020. doi: 10.1109/CVPR42600.2020.00807. (Cited on page 1)
[27] M. Jaderberg, A. Vedaldi, and A. Zisserman. Speeding up convolutional neural networks with low rank expansions, 2014. URL https://arxiv.org/abs/1405.3866. (Cited on page 1)
[28] D. Jin, X. Bing, and Y. Zhang. Unique sparse decomposition of low rank matrices. In Advances in Neural Information Processing Systems, volume 34, pages 523-535. Curran Associates, Inc., 2021. URL https://proceedings.neurips.cc/paper_files/paper/2021/file/051928341be67dcba03f0e04104d9047-Paper.pdf. (Cited on page 2)
[29] G. K. Karagiannidis and A. S. Lioumpas. An improved approximation for the gaussian Q-function. IEEE Communications Letters, 11(8):644-646, 2007. doi: 10.1109/LCOMM.2007.070470. (Cited on page 24)
[30] R. Karimi Mahabadi, J. Henderson, and S. Ruder. Compacter: Efficient low-rank hypercomplex adapter layers. In M. Ranzato, A. Beygelzimer, Y. Dauphin, P. Liang, and J. W. Vaughan, editors, Advances in Neural Information Processing Systems, volume 34, pages 1022-1035. Curran Associates, Inc., 2021. URL https://proceedings.neurips.cc/paper_files/paper/2021/file/081be9fdf07f3bc808f935906ef70c0-Paper.pdf. (Cited on page 1)