arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.05672cs.DS
收藏

输入稀疏时间的数据库内回归

In-Database Regression in Input Sparsity Time

Rajesh Jayaram, Alireza Samadian, David P. Woodruff, Peng Ye

摘要:

草图是一种强大的降维技术,用于加速数据分析算法。草图绘制方法中的关键步骤是计算大型矩阵$\mathbf{A} \in \mathbb{R}^{N \times d}$的子空间嵌入(SE)。SE是获得许多线性代数任务的非常有效的解决方案的主要工具,例如最小二乘回归和低秩近似。计算SE通常需要$\mathbf{A}$的显式表示以及与$\mathbf{A}$的大小成比例的运行时间。但是,如果$\mathbf{A}= \mathbf{T}_1 \Join \mathbf{T}_2 \Join \dots \Join \mathbf{T}_m$是对几个较小的表$\mathbf{T}_i \in \mathbb{R}^{n_i \times d_i}$进行数据库连接查询的结果,那么这个运行时间可能会非常长,因为$\mathbf{A}$本身可以有多达$O(n_1 n_2 \cdots n_m)$的行。在这项工作中,我们设计的子空间嵌入数据库连接,可以计算显着快于计算连接。对于两个表连接$\mathbf{A} = \mathbf{T}_1 \Join \mathbf{T}_2$的情况下,我们给输入稀疏算法计算子空间嵌入,与运行时间的限制由非零条目的数量在$\mathbf{T}_1,\mathbf{T}_2$。这导致了用于高精度回归的输入稀疏时间算法,显著改善了先前基于FAQ的回归方法的运行时间。我们将我们的结果扩展到任意连接的岭回归问题,也大大提高了以前的方法的运行时间。从经验上讲,我们将我们的方法应用于真实数据集,并表明它比现有算法快得多。

英文摘要:

Sketching is a powerful dimensionality reduction technique for accelerating algorithms for data analysis. A crucial step in sketching methods is to compute a subspace embedding (SE) for a large matrix $\mathbf{A} \in \mathbb{R}^{N \times d}$. SE's are the primary tool for obtaining extremely efficient solutions for many linear-algebraic tasks, such as least squares regression and low rank approximation. Computing an SE often requires an explicit representation of $\mathbf{A}$ and running time proportional to the size of $\mathbf{A}$. However, if $\mathbf{A}= \mathbf{T}_1 \Join \mathbf{T}_2 \Join \dots \Join \mathbf{T}_m$ is the result of a database join query on several smaller tables $\mathbf{T}_i \in \mathbb{R}^{n_i \times d_i}$, then this running time can be prohibitive, as $\mathbf{A}$ itself can have as many as $O(n_1 n_2 \cdots n_m)$ rows. In this work, we design subspace embeddings for database joins which can be computed significantly faster than computing the join. For the case of a two table join $\mathbf{A} = \mathbf{T}_1 \Join \mathbf{T}_2$ we give input-sparsity algorithms for computing subspace embeddings, with running time bounded by the number of non-zero entries in $\mathbf{T}_1,\mathbf{T}_2$. This results in input-sparsity time algorithms for high accuracy regression, significantly improving upon the running time of prior FAQ-based methods for regression. We extend our results to arbitrary joins for the ridge regression problem, also considerably improving the running time of prior methods. Empirically, we apply our method to real datasets and show that it is significantly faster than existing algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑