New graph PCA and dictionary learning methods detect cyber intrusions.
problem Detecting anomalous connectivity patterns in graphs.
method Multi-centrality graph PCA and dictionary learning.
result Effective detection of anomalous connectivity patterns and attack classification.
PCA on graph paths reduces data requirements for network analysis.
problem Reducing data requirements for network principal component analysis.
method Sparse PCA on a directed acyclic graph, solving a non-convex quadratic maximization problem.
result Side information from graph structure improves principal component recovery.
This paper explains spectral clustering and its equivalence to PCA, breaking it into fully connected and multi-connected cases.
problem Understanding the mathematics behind spectral clustering and its equivalence to PCA.
method Dividing spectral clustering into two categories based on graph connectivity and proving the equivalence to PCA.
result Spectral clustering and PCA are equivalent, with specific proofs for fully connected and multi-connected graphs.
A new GNN architecture called coVariance neural network (VNN) improves stability and transferability of covariance matrix analysis.
problem Stability and transferability issues in covariance matrix analysis.
method Developed coVariance neural network (VNN) that operates on sample covariance matrices.
result VNN is more stable and transferable than PCA-based approaches.
Estimates manifold dimension using local graph structure.
problem Estimating the intrinsic dimension of manifolds from data.
method Regression on local PCA coordinates, focusing on local graph structure.
result Proposed QE and TLS estimators outperform existing methods.
Combines PCA and message passing for better graph node embeddings.
problem Challenges of learning long-range dependencies in graph data.
method PCAPass: PCA + message passing for unsupervised node embeddings.
result Empirically shows competitive performance on node classification benchmarks.
GCN and GPCA are mathematically connected, leading to improved node classification performance.
problem Improving node classification performance in semi-supervised settings.
method Established a mathematical connection between GCN and GPCA, demonstrating their equivalence and using this to design an effective initialization strategy.
result GPCA paired with a simple MLP achieves similar or better performance than GCN on semi-supervised node classification tasks.
A new method identifies phase connections in smart grids using PCA and graph theory.
problem Keeping track of consumer phase connections in smart grids.
method Data-driven approach using PCA and graph theory.
result Algorithm infers phase connectivity from noisy smart meter data.
We propose a spectral clustering method based on local principal components analysis (PCA). After performing local PCA in selected neighborhoods, the algorithm builds a nearest neighbor graph weighted according to a discrepancy between the principal subspaces in the neighborhoods, and then applies spectral clustering. …
New framework for low-rank tensor analysis on graphs.
problem Low-rank tensor analysis on non-Euclidean domains.
method Graph-based low-rank decomposition and convex optimization.
result Significant speed-up and performance enhancement at low SNR.
SDSPCAAN combines supervised and local data structures for better dimensionality reduction.
problem Preserving both global and local data structures for noisy high-dimensional data.
method Supervised discriminative sparse PCA with adaptive neighbors (SDSPCAAN).
result SDSPCAAN improves classification accuracy on high-dimensional datasets.
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. For this purpose, we reformulate the problem in the sparse inverse covariance (concentration) domain and solve the global eigenvalue problem …
STVNN models spatiotemporal data using covariance matrices.
problem Challenges in modeling spatiotemporal interactions in multivariate time series.
method Introduces SpatioTemporal coVariance Neural Network (STVNN) that operates on sample covariance matrix and uses joint spatiotemporal convolutions.
result STVNN is stable to online estimation uncertainties and outperforms temporal PCA.
A novel 3D shape registration method using spectral graph embedding and probabilistic matching.
problem Challenges in 3D shape analysis and registration, especially with large variability.
method Combining spectral graph matching with Laplacian embedding for large graphs, using commute-time embedding and PCA.
result A method to register shapes with different samplings and isometric deformations.
Graphs improve brain activity decoding from fMRI data.
problem Decoding brain activity from fMRI data.
method Dimensionality reduction techniques based on graph representations of the brain.
result Mixed graphs using both geometric structure and functional connectivity offer the best performance.
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.
Paper analyzes shapes of brain arterial networks using statistical methods.
problem Quantifying and comparing shapes of brain arterial networks.
method Mathematical representation of BAN shapes as elastic shape graphs, development of Riemannian metrics and geometrical tools.
result Age has a clear, quantifiable effect on BAN shapes, with increased variance in shapes as age increases.
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.
CNN-PCA method uses deep learning to parameterize complex geological models.
problem Representing complex geological models in a low-dimensional space.
method CNN-PCA method combines PCA and CNN to honor geological features.
result CNN-PCA provides high-quality realizations and history matching results.
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.
Explains various PCA and SPCA methods with theory and applications.
problem No specific problem stated; focuses on explaining methods.
method Explains PCA, SPCA, kernel PCA, and kernel SPCA methods with theory and applications.
result Comprehensive coverage of PCA and SPCA methods with theory and applications.
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.
BSA reduces network data by interpreting feature subspaces.
problem Interpreting feature subspaces of unlabeled network data.
method Barycentric Subspace Analysis (BSA) for unlabeled networks.
result BSA provides a more interpretable approach compared to PCA.
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.
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.
CSTs improve stability in covariance spectrum analysis without training.
problem Stability and expressiveness in covariance spectrum analysis.
method Sequential application of covariance wavelet filters to input data.
result Stable and expressive hierarchical representations in low-data settings.
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.
Method calculates Shapley values for PCA reconstruction errors to explain anomaly detection.
problem Explaining PCA-based anomaly detection results.
method Utilizes probabilistic PCA view to compute Shapley values of reconstruction errors.
result Shapley values are more advantageous than raw errors for explaining anomalies.
FVNNs use graph convolutions on fair covariance estimates to improve fairness in machine learning.
problem Data-driven methods can encode biases in sample covariance matrices, leading to unfair treatment of different subpopulations.
method FVNNs perform graph convolutions on fair covariance estimates and use a fairness regularizer in the loss function.
result FVNNs provide a flexible model that is intrinsically fairer than PCA approaches and can handle low sample regimes.
SDSPCA improves PCA for disease diagnosis using sparse components and discriminative information.
problem Class ambiguity and low interpretability in traditional PCA.
method Incorporates discriminative information and sparsity into PCA, focusing on sparse components.
result SDSPCA outperforms other methods in gene selection and tumor classification on multi-view biological data.
Sparse PCA method for clustering Gaussian mixtures.
problem Clustering Gaussian mixture models.
method Sparse Principal Component Analysis (SPCA) for clustering.
result Comparison with IF-PCA method and discussion of non-diagonal covariance matrices.
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.
Empirical comparison of PCA and ICA on noisy time series.
problem Comparing PCA and ICA performance on noisy data.
method Applied PCA and ICA to two simulated noisy time series with varying distribution parameters and noise levels.
result ICA outperforms PCA due to considering higher moments of data distribution.
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.
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.
Paper compares PCA of neural network training to high-dimensional random walks.
problem Understanding the dynamics of neural network training through PCA.
method PCA of neural network parameters and random walks, comparison of variances and projections.
result Most variance in neural network training and high-dimensional random walks is captured by the first few PCA components.
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…
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. The paper reviews optimization methods for robust PCA and variants.
problem Efficient optimization for robust PCA and related problems.
method Review of existing optimization methods for convex and nonconvex relaxations/variants of robust PCA.
result Insights for future research directions in optimization methods.
New method improves PCA for large-scale data with missing values.
problem Inconsistent PCA estimators in high-dimensional settings.
method Generalized sparse PCA for exponential family distributions.
result SG-PCA algorithms achieve faster convergence and better scalability.
Mapper-GIN simplifies 3D point cloud classification with lightweight structure.
problem Robust 3D point cloud classification under corruption.
method Mapper algorithm for structural decomposition, GIN for graph classification.
result Mapper-GIN achieves competitive accuracy with minimal parameters.
New robust PCA method minimizes trimmed reconstruction error over Stiefel manifold.
problem Outliers affect PCA's accuracy; robustification needed.
method Directly minimizes trimmed reconstruction error over the Stiefel manifold without deflation.
result Outperforms or matches state-of-the-art methods in efficiency and accuracy.