DeepAI AI Chat
Log In Sign Up

Efficient L1-Norm Principal-Component Analysis via Bit Flipping

10/06/2016
by   Panos P. Markopoulos, et al.
Rochester Institute of Technology
Qualcomm
University at Buffalo
0

It was shown recently that the K L1-norm principal components (L1-PCs) of a real-valued data matrix X ∈ R^D × N (N data samples of D dimensions) can be exactly calculated with cost O(2^NK) or, when advantageous, O(N^dK - K + 1) where d=rank( X), K<d [1],[2]. In applications where X is large (e.g., "big" data of large N and/or "heavy" data of large d), these costs are prohibitive. In this work, we present a novel suboptimal algorithm for the calculation of the K < d L1-PCs of X of cost O(ND min{ N,D} + N^2(K^4 + dK^2) + dNK^3), which is comparable to that of standard (L2-norm) PC analysis. Our theoretical and experimental studies show that the proposed algorithm calculates the exact optimal L1-PCs with high frequency and achieves higher value in the L1-PC optimization metric than any known alternative algorithm of comparable computational cost. The superiority of the calculated L1-PCs over standard L2-PCs (singular vectors) in characterizing potentially faulty data/measurements is demonstrated with experiments on data dimensionality reduction and disease diagnosis from genomic data.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/10/2016

Iteratively Reweighted Least Squares Algorithms for L1-Norm Principal Component Analysis

Principal component analysis (PCA) is often used to reduce the dimension...
09/04/2013

Some Options for L1-Subspace Signal Processing

We describe ways to define and calculate L_1-norm signal subspaces which...
04/13/2019

L1-norm Tucker Tensor Decomposition

Tucker decomposition is a common method for the analysis of multi-way/te...
03/15/2017

Optimization for L1-Norm Error Fitting via Data Aggregation

We propose a data aggregation-based algorithm with monotonic convergence...
05/26/2018

L1-(2D)2PCANet: A Deep Learning Network for Face Recognition

In this paper, we propose a novel deep learning network L1-(2D)2PCANet f...
10/31/2017

The Exact Solution to Rank-1 L1-norm TUCKER2 Decomposition

We study rank-1 L1-norm-based TUCKER2 (L1-TUCKER2) decomposition of 3-wa...
07/22/2018

A Trace Lasso Regularized L1-norm Graph Cut for Highly Correlated Noisy Hyperspectral Image

This work proposes an adaptive trace lasso regularized L1-norm based gra...