all AI news
Approximate Multiplication of Sparse Matrices with Limited Space
June 25, 2024, 4:50 a.m. | Yuanyu Wan, Lijun Zhang
cs.LG updates on arXiv.org arxiv.org
Abstract: Approximate matrix multiplication with limited space has received ever-increasing attention due to the emergence of large-scale applications. Recently, based on a popular matrix sketching algorithm -- frequent directions, previous work has introduced co-occuring directions (COD) to reduce the approximation error for this problem. Although it enjoys the space complexity of $O((m_x+m_y)\ell)$ for two input matrices $X\in\mathbb{R}^{m_x\times n}$ and $Y\in\mathbb{R}^{m_y\times n}$ where $\ell$ is the sketch size, its time complexity is $O\left(n(m_x+m_y+\ell)\ell\right)$, which is still very …
abstract algorithm applications approximation arxiv attention cs.lg emergence error ever matrix matrix multiplication popular problem reduce replace scale space stat.ml type work
More from arxiv.org / cs.LG updates on arXiv.org
MixerFlow: MLP-Mixer meets Normalising Flows
1 day, 2 hours ago |
arxiv.org
Kernelised Normalising Flows
1 day, 2 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Performance Marketing Manager
@ Jerry | New York City
Senior Growth Marketing Manager (FULLY REMOTE)
@ Jerry | Seattle, WA
Growth Marketing Channel Manager
@ Jerry | New York City
Azure Integration Developer - Consultant - Bangalore
@ KPMG India | Bengaluru, Karnataka, India
Director - Technical Program Manager
@ Capital One | Bengaluru, In
Lead Developer-Process Automation -Python Developer
@ Diageo | Bengaluru Karle Town SEZ