arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1502.07017stat.ML
收藏

大规模数据处理中线性离散性约简算子的卷积逼近

On Convolutional Approximations to Linear Dimensionality Reduction Operators for Large Scale Data Processing

Swayambhoo Jain, Jarvis Haupt

摘要:

在本文中,我们研究的问题近似的一般线性降维(LDR)运营商,表示为一个矩阵$A \in \mathbb{R}^{m \times n}$与$m < n$,由一个部分循环矩阵与循环移位相关的行。部分循环矩阵允许通过傅立叶变换方法和子采样操作的快速实现;我们的研究是出于在大规模数据处理任务中利用这些潜在的计算改进的愿望。我们建立了一个基本的结果,大多数大型LDR矩阵(其行空间均匀分布),事实上不能很好地近似部分循环矩阵。然后,我们提出了一个自然的推广的部分循环近似框架,需要近似的范围空间的一个给定的LDR运营商$A$在一个有限的输入域,使用一个矩阵形成的产品的部分循环矩阵具有$m '> m$行和一个$m \times k$“后处理”矩阵。我们引入了一种新的算法技术,基于稀疏矩阵分解,用于识别包括这种近似的因素,并提供初步证据来证明这种方法的潜力。

英文摘要:

In this paper, we examine the problem of approximating a general linear dimensionality reduction (LDR) operator, represented as a matrix $A \in \mathbb{R}^{m \times n}$ with $m < n$, by a partial circulant matrix with rows related by circular shifts. Partial circulant matrices admit fast implementations via Fourier transform methods and subsampling operations; our investigation here is motivated by a desire to leverage these potential computational improvements in large-scale data processing tasks. We establish a fundamental result, that most large LDR matrices (whose row spaces are uniformly distributed) in fact cannot be well approximated by partial circulant matrices. Then, we propose a natural generalization of the partial circulant approximation framework that entails approximating the range space of a given LDR operator $A$ over a restricted domain of inputs, using a matrix formed as a product of a partial circulant matrix having $m '> m$ rows and a $m \times k$ 'post processing' matrix. We introduce a novel algorithmic technique, based on sparse matrix factorization, for identifying the factors comprising such approximations, and provide preliminary evidence to demonstrate the potential of this approach.

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

↑