RieCUR improves Robust PCA by combining Riemannian optimization and CUR decompositions.
problem Robust Principal Component Analysis (PCA) to recover low-rank and sparse matrices from their sum.
method Riemannian CUR (RieCUR) algorithm that combines Riemannian optimization and robust CUR decompositions.
result RieCUR achieves state-of-the-art performance in Robust PCA with improved robustness to outliers and comparable computational complexity.
R-PCA extends PCA to Riemannian manifolds for structured data.
problem Applying PCA to data on Riemannian manifolds without vector space operations.
method Adapting PCA to Riemannian manifolds by equipping data with local metrics.
result Unified approach for dimensionality reduction and statistical analysis on manifolds.
PCA adapted for curved spaces improves data analysis.
problem PCA's limitations in curved spaces.
method Space Form PCA (SFPCA) for Riemannian manifolds.
result SFPCA provides faster and more accurate subspaces estimation.
This paper investigates the generalization of Principal Component Analysis (PCA) to Riemannian manifolds. We first propose a new and general type of family of subspaces in manifolds that we call barycentric subspaces. They are implicitly defined as the locus of points which are weighted means of k+1 reference points.…
Paper optimizes PCA for fairness using MMD and Stiefel manifold optimization.
problem Fair principal component analysis (PCA) to minimize MMD between protected classes.
method Formulates fair PCA as non-convex optimization over Stiefel manifold, solves using REPMS with theoretical guarantees.
result Our approach outperforms prior work in fairness, explained variance, and runtime.
Efficient algorithm for CCA on Riemannian manifolds with fast convergence.
problem Efficiently computing canonical correlation components on Riemannian manifolds.
method Reparametrization of projection matrices for stochastic optimization on Riemannian manifolds.
result Achieves $O( rac{1}{t})$ convergence rate for top k components with O(d2k) runtime complexity. We develop a novel analogue of Euclidean PCA (principal component analysis) for data taking values on a Riemannian symmetric space, using totally geodesic submanifolds as approximating lower dimnsional submanifolds. We illustrate the technique on n-spheres, Grassmannians, n-tori and polyspheres.
Simplifies fair PCA with fast, efficient solution.
problem Learning fair low-rank approximations of data.
method Conceptually simple approach with analytic solution.
result Faster and similar results to existing fair PCA methods.
KAN-PCA improves asset return analysis by capturing more variance than classical PCA during market crises.
problem Inefficient classical PCA during market crises when correlations between assets change dramatically.
method KAN-PCA uses KAN (Kolmogorov-Arnold Networks) with B-spline functions to learn nonlinear projections.
result KAN-PCA achieves a higher reconstruction R^2 (66.57%) compared to classical PCA (62.99%) on 20 S&P 500 stocks.
New algorithm solves fair PCA, robust PCA, and sparse PCA problems efficiently.
problem Fair Principal Component Analysis (FPCA) to ensure fairness in PCA solutions.
method Iterative MM algorithm with SDP reformulation to quadratic program.
result Algorithm monotonically improves fairness objectives at each iteration.
Unified framework improves PCA for outliers and distributed data.
problem Outliers and limitations in PCA for large-scale applications.
method φ-PCA framework that retains PCA efficiency and adds robustness.
result HM-PCA achieves optimal robustness and efficiency.
TL-PCA uses transfer learning to improve PCA performance with limited target data.
problem PCA performance is limited with scarce target data.
method Transfer learning approach to PCA (TL-PCA) that combines source task knowledge with target task data.
result Improved PCA representation for dimensionality reduction with limited target data.
Bucketed PCA-NN outperforms DNNs by 96% on MNIST.
problem Benchmarking deep neural networks for supervised classification.
method Applies PCA to individual buckets constructed in two phases, retains neural network architecture, and uses neurons that mirror input signals.
result Bucketed PCA-NN achieves 96% accuracy on MNIST, similar to DNNs.
A new low-dimensional parameterization based on principal component analysis (PCA) and convolutional neural networks (CNN) is developed to represent complex geological models. The CNN-PCA method is inspired by recent developments in computer vision using deep learning. CNN-PCA can be viewed as a generalization of an ex…
Anchor PCA improves robustness in multi-domain PCA.
problem PCA on pooled data can focus on spurious directions.
method Anchor PCA focuses on shared directions of variation.
result Anchor PCA outperforms pooling and worst-case alternatives.
A new method for fair PCA ensures balanced error across groups.
problem Balancing approximation error across different groups in multi-group data.
method Iterative method to compute fair principal components minimizing max group-wise reconstruction error.
result Preserves the containment property of standard PCA and reduces to standard PCA for single-group data.
This is a detailed tutorial paper which explains the Principal Component Analysis (PCA), Supervised PCA (SPCA), kernel PCA, and kernel SPCA. We start with projection, PCA with eigen-decomposition, PCA with one and multiple projection directions, properties of the projection matrix, reconstruction error minimization, an…
Revisits PCA with new formulations and insights.
problem Improving PCA formulations and understanding.
method Difference-of-convex (DC) framework, kernelizability, out-of-sample applicability, simultaneous iteration, DCA perspective.
result PCA-like problems are kernelizable and have new optimization perspectives.
Proposes σ-PCA to learn identifiable linear transformations without whitening.
problem Cannot identify axes with equal variances in PCA.
method Unified model for linear and nonlinear PCA, introducing a missing piece to eliminate rotational indeterminacy.
result Eliminates subspace rotational indeterminacy in PCA.
Solution to sparse PCA tuning problem using Empirical Bayes.
problem Sparse PCA multiple tuning problem (MTP).
method Empirical Bayes covariance decomposition for penalized PCA.
result Empirical Bayes approach efficiently solves MTP in sparse PCA.
New method improves PCA robustness using Wasserstein distances.
problem Uncertainty in probability distribution affects PCA robustness.
method Distributionally robust optimization with Wasserstein distances.
result Explicit reformulation leads to efficient smoothing algorithm.
PCA++ improves robustness to background noise in contrastive learning.
problem Recovering shared signal subspaces from positive pairs in high-dimensional data with structured background noise.
method PCA++ uses hard uniformity-constrained contrastive learning to enforce identity covariance on projected features.
result PCA++ outperforms standard PCA and alignment-only PCA+ in simulations and real-world datasets.
EB-PCA reduces noise in high-dimensional PCA by estimating a joint prior distribution.
problem High-dimensional PCA noise in samples comparable to or larger than data.
method Empirical Bayes PCA using Kiefer-Wolfowitz MLE, random matrix theory, and AMP algorithm.
result EB-PCA achieves Bayes-optimal accuracy in spiked models and significantly improves over PCA in simulations and real data.
New analysis improves black-box k-PCA algorithms, reducing parameter loss.
problem Designing efficient k-PCA algorithms with black-box access to a 1-PCA oracle. method Black-box deflation methods, analyzing ePCA and cPCA approximations.
result Deflation methods suffer no asymptotic parameter loss for k-cPCA in feasible regimes. Derives kernel PCA with Nyström method for scalability.
problem Scalability of kernel PCA.
method Nyström method for kernel PCA.
result Provides scalable alternative to full kernel PCA.
New tensor recovery method uses Riemannian optimization on Segre manifold.
problem Recovering low-rank tensors from noisy measurements.
method Riemannian Gradient Descent (RGD) and Riemannian Gauss-Newton (RGN) algorithms over the Segre manifold.
result Proven convergence rates for RGD and RGN under mild noise assumptions.
We develop efficient algorithms for robust PCA that handle outliers.
problem Finding principal components in datasets with outliers.
method Nearly-linear time and streaming algorithms for robust PCA.
result Near-optimal error guarantees for robust PCA with nearly-linear time and memory usage.
Principal Component Analysis (PCA) has wide applications in machine learning, text mining and computer vision. Classical PCA based on a Gaussian noise model is fragile to noise of large magnitude. Laplace noise assumption based PCA methods cannot deal with dense noise effectively. In this paper, we propose Cauchy Princ…
Novel unsupervised MIG detectors improve signal detection in cluttered environments.
problem Signal detection in nonhomogeneous clutter environments.
method Developed novel discriminative MIG detectors using HPD matrices and geometric measures.
result Improved signal detection performance compared to conventional methods.
A new PCA method using Tℓ1-norm outperforms existing methods.
problem Outliers and noise sensitivity in classical PCA.
method PCA based on Tℓ1-norm maximization. result The method outperforms PCA-ℓp, ℓpSPCA, and PCA in numerical experiments. New fair PCA method using streaming algorithms with statistical guarantees.
problem Perform PCA while ensuring fair projected distributions.
method Formulated new notion PAFO learnability, proposed fair noisy power method (FNPM) for memory efficiency.
result First statistical guarantee for fair PCA in streaming setting.
PCA-Guided Quantile Sampling preserves data structure in large datasets.
problem Preserving data structure in large-scale subsampling.
method PCA QS uses leading principal components to guide stratified sampling.
result PCA QS maintains statistical and geometric structure without distorting semantics.
A method to remove mean-shift noise from PCA using knockoffs.
problem High sensitivity of PCA to mean-shift contamination in high-dimensional data.
method Introducing knockoff mean-shift perturbation to separate and remove mean-shift components from PCA.
result The mean-shift spikes are spectrally separable from stable eigenvalues, allowing for robust PCA.
AgFlow speeds up model selection in penalized PCA.
problem Efficient model selection in penalized PCA for HDLSS settings.
method Implicit regularization effect of gradient flow to reduce computation complexity.
result AgFlow achieves the complete solution path of L2-penalized PCA.
New algorithm for nonconvex optimization on constrained Riemannian manifolds converges quickly.
problem Optimization on constrained Riemannian manifolds.
method Block majorization-minimization (BMM) for smooth nonconvex objectives with Riemannian constraints.
result Converges to stationary points within O(ε−2) iterations. One technique to visualize the training of neural networks is to perform PCA on the parameters over the course of training and to project to the subspace spanned by the first few PCA components. In this paper we compare this technique to the PCA of a high dimensional random walk. We compute the eigenvalues and eigenvec…
GT-PCA improves PCA for image and time series data.
problem Lack of robustness to transformations in PCA.
method GT-PCA is a neural network that estimates components invariant to specific transformations.
result GT-PCA outperforms alternative methods in synthetic and real data experiments.
New statistical methods for analyzing distributions using Wasserstein metric.
problem Statistical analysis of probability distributions on the real line.
method Projected methods exploiting Wasserstein metric and Riemannian structure.
result Projected PCA and regression methods are faster and more flexible.
Modified PCA algorithm with continual learning preserves features of previous modes for multimode process monitoring.
problem Catastrophic forgetting of previous modes in monitoring models for successive modes.
method Modified PCA algorithm with elastic weight consolidation (EWC) to preserve features of previous modes.
result PCA-EWC algorithm effectively monitors multimode processes without performance decrease.
PCA-Net combines PCA and neural networks for operator approximation, with new bounds on complexity.
problem Developing approximation theory for PCA-Net architecture.
method Combines PCA and neural networks, derives universal approximation results and lower bounds on complexity.
result PCA-Net can overcome the curse of parametric complexity for specific operators.
A new dynamical formulation of log-PCA captures local principal modes of geodesic variations.
problem Learning principal variations of random probability measures under Wasserstein geometry.
method Introducing a new dynamical formulation of log-PCA as a variational approach.
result Deriving a general statistical convergence rate for empirical WT-PCA.
We performed an empirical comparison of ICA and PCA algorithms by applying them on two simulated noisy time series with varying distribution parameters and level of noise. In general, ICA shows better results than PCA because it takes into account higher moments of data distribution. On the other hand, PCA remains quit…
Generative Kernel PCA explores latent spaces for data interpretation and novelty detection.
problem Exploring latent spaces of datasets for better data interpretation.
method Generative Kernel PCA using hidden and visible units similar to Restricted Boltzmann Machines.
result Gradually moving in the latent space allows for interpretation of components and detection of novel patterns.
Principal Component Analysis (PCA) has been used to study the pathogenesis of diseases. To enhance the interpretability of classical PCA, various improved PCA methods have been proposed to date. Among these, a typical method is the so-called sparse PCA, which focuses on seeking sparse loadings. However, the performance…
A fair PCA method using JEVD ensures balanced data representation.
problem PCA's bias in data with demographic characteristics.
method Joint Eigenvalue Decomposition (JEVD) for fair PCA.
result JEVD optimally balances fairness and PCA's data structure.
Two new PCA variants improve financial data analysis.
problem Numerical instability and nonstationarity in PCA for finance.
method Iterated and exponentially weighted moving PCA variants using Ogita-Aishima iteration.
result Improved stability and adaptability in financial data analysis.
One-shot algorithm for feature-distributed kernel PCA reduces communication costs.
problem Efficiently perform kernel PCA in distributed computing environments.
method Inspired by dual relationship between sample-distributed and feature-distributed scenarios, proposes a one-shot algorithm for feature-distributed kernel PCA.
result The algorithm provides high-quality results with low communication costs, especially when eigenvalues decay fast.
EigenGame reinterprets PCA as a game to find eigenvectors.
problem Finding principal components efficiently and accurately.
method EigenGame treats PCA as a Nash equilibrium game, using gradient-based updates.
result EigenGame algorithm combines Oja's rule and Gram-Schmidt orthogonalization.