Doubly Accelerated Methods for Faster CCA and Generalized Eigendecomposition
نویسندگان
چکیده
We study k-GenEV, the problem of finding the top k generalized eigenvectors, and k-CCA, the problem of finding the top k vectors in canonicalcorrelation analysis. We propose algorithms LazyEV and LazyCCA to solve the two problems with running times linearly dependent on the input size and on k. Furthermore, our algorithms are doubly-accelerated: our running times depend only on the square root of the matrix condition number, and on the square root of the eigengap. This is the first such result for both kGenEV or k-CCA. We also provide the first gapfree results, which provide running times that depend on 1/ √ ε rather than the eigengap.
منابع مشابه
Recurrence Relations for Moment Generating Functions of Generalized Order Statistics Based on Doubly Truncated Class of Distributions
In this paper, we derived recurrence relations for joint moment generating functions of nonadjacent generalized order statistics (GOS) of random samples drawn from doubly truncated class of continuous distributions. Recurrence relations for joint moments of nonadjacent GOS (ordinary order statistics (OOS) and k-upper records (k-RVs) as special cases) are obtained. Single and product moment gene...
متن کاملFast RLS-Like Algorithm for Generalized Eigendecomposition and its Applications
Generalized eigendecomposition (GED) plays a vital role in many signal-processing applications. In this paper, we will propose a new method for computing the generalized eigenvectors, which is on-line and resembles the RLS algorithm for Wiener filtering. We further present a proof to show convergence to the exact solution and simulations have shown that the algorithm is faster than most of the ...
متن کاملOPTIMUM GENERALIZED COMPOUND LINEAR PLAN FOR MULTIPLE-STEP STEP-STRESS ACCELERATED LIFE TESTS
In this paper, we consider an i.e., multiple step-stress accelerated life testing (ALT) experiment with unequal duration of time . It is assumed that the time to failure of a product follows Rayleigh distribution with a log-linear relationship between stress and lifetime and also we assume a generalized Khamis-Higgins model for the effect of changing stress levels. Taking into account that the...
متن کاملTime Series Segmentation Using a Novel Adaptive Eigendecomposition Algorithm
In this paper we will present a new technique for time series segmentation built around a fast principal component analysis (PCA) algorithm that is on-line and stable. The traditional Generalized Likelihood Ratio Test (GLRT) has been used to solve the segmentation problem, but this has enormous limitations in terms of complexity and speed. Newer methods use gated experts and mixture models to d...
متن کاملA New Perspective about Moran’s Coefficient: Spatial Autocorrelation as a Linear Regression Problem
The computation of Moran’s index of spatial autocorrelation requires the definition of a spatial weighting matrix. The eigendecomposition of this doubly centered matrix (i.e., one that forces the sums of all rows and columns to equal zero) has interesting properties that have been exploited in various contexts: distribution properties of the Moran coefficient (MC), spatial filtering in linear m...
متن کامل