Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

168337505673 · Jun 202019922001200920182026
48 results for Kernel Principal Component Analysis

Generalizes PCA to maximize any convex function of components.

problem Finding a principal vector that maximizes a convex function of components.
method Gradient ascent algorithm for solving the generalized PCA problem; fixed points of neural networks for kernel version.
result Solutions can be obtained as fixed points of simple neural networks.

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.

Kernel PCA explains self-attention mechanisms in deep learning models.

problem Understanding and explaining self-attention mechanisms in deep learning models.
method Deriving self-attention from kernel principal component analysis (kernel PCA).
result RPC-Attention, a robust attention mechanism, outperforms softmax attention in various tasks.

Study on reducing dimensionality in high-dimensional regression with kernel methods and stability analysis.

problem Analyzing errors in high-dimensional regression with dimensionality reduction and kernel regression.
method Derive a stability result for kernel regression with Wasserstein distance and apply it to PCA to deduce convergence rates.
result Two-step procedure yields useful convergence rates in semi-supervised settings.

Paper extends RPD for better handling multiple modalities and non-convexity.

problem Handling multiple modalities and non-convexity in data clouds.
method Computes RPD in a reproducing kernel Hilbert space using kernel principal component analysis.
result The method outperforms RPD and is comparable to other models on benchmark datasets.

Robust principal component analysis (RPCA) can recover low-rank matrices when they are corrupted by sparse noises. In practice, many matrices are, however, of high-rank and hence cannot be recovered by RPCA. We propose a novel method called robust kernel principal component analysis (RKPCA) to decompose a partially cor…

2018-02-28abs ↗pdf ↗

A new method for efficient nonlinear process monitoring using random Bernoulli features.

problem High computational demands and real-time responsiveness in online monitoring systems.
method Random Bernoulli principal component analysis to capture nonlinear patterns efficiently.
result The proposed methods offer excellent scalability and reduced computational complexity.

Proposes an online method for high-dimensional streaming data.

problem Increasing variable dimensions with sample size in online kernel sliced inverse regression.
method Introduces approximate linear dependence condition and dictionary variable sets to address the problem. Transforms into online generalized eigen-decomposition problem and uses stochastic optimization for updates.
result Achieves close performance to batch processing kernel sliced inverse regression.

Proposes a method to optimize class mean preservation in kernel-based feature spaces.

problem Optimizing the selection of kernel subspace for better performance.
method Component analysis method for kernel-based dimensionality reduction that optimally preserves class mean distances.
result Discriminant analysis version of the proposed method provides insights into feature space properties.

Kernelized PCovR reveals structure-property relations in chemistry and materials.

problem Understanding structure-property relations in complex systems.
method Kernel Principal Covariates Regression (kernel PCovR) with sparsification.
result Kernelized PCovR effectively reveals and predicts structure-property relations.

Principal component analysis (PCA) is largely adopted for chemical process monitoring and numerous PCA-based systems have been developed to solve various fault detection and diagnosis problems. Since PCA-based methods assume that the monitored process is linear, nonlinear PCA models, such as autoencoder models and kern…

2017-12-12abs ↗pdf ↗

Kernel principal component analysis (KPCA) provides a concise set of basis vectors which capture non-linear structures within large data sets, and is a central tool in data analysis and learning. To allow for non-linear relations, typically a full n×nn \times n kernel matrix is constructed over nn data points, but this…

2015-12-16abs ↗pdf ↗

This work analyzes when contrastive models are close to PCA or kernel methods.

problem Understanding when contrastive models are equivalent to kernel methods or PCA.
method Analyzing the training dynamics of two-layer contrastive models with non-linear activation.
result Wide contrastive models with cosine similarity based losses are close to PCA.

Proposes a new PCA method using SSIM for image subspace learning.

problem Lack of principled assessment methods for image fidelity and similarity.
method Defines an image structure subspace using SSIM, proposes ISCA and kernel ISCA.
result Demonstrates improved image subspace learning using SSIM.

Two strategies for embedding new data points from proximity data are explored.

problem Embedding new data points using proximity data.
method Two competing strategies: projection and restricted reconstruction.
result Projection and restricted reconstruction can be derived from kernel methods.

This study compares DR methods with kernel variations for face image analysis.

problem High dimensionality, noise, and correlation in data.
method Reviews and comparative study of PCA, LDA, KPCA, KLDA, SKPCA.
result SKPCA outperforms other methods in gender classification on face databases.

Additive principal components (APCs for short) are a nonlinear generalization of linear principal components. We focus on smallest APCs to describe additive nonlinear constraints that are approximately satisfied by the data. Thus APCs fit data with implicit equations that treat the variables symmetrically, as opposed t…

2015-11-21abs ↗pdf ↗

The paper introduces a method for interpretable principal component analysis of high-dimensional time series.

problem Inconsistent and difficult-to-interpret principal component estimates in high-dimensional regimes.
method Localized sparse principal component analysis of spectral density matrices in frequency domain.
result Efficient algorithm for sparse-localized estimates of principal subspaces.

A mean function in reproducing kernel Hilbert space, or a kernel mean, is an important part of many applications ranging from kernel principal component analysis to Hilbert-space embedding of distributions. Given finite samples, an empirical average is the standard estimate for the true kernel mean. We show that this e…

2013-06-04abs ↗pdf ↗

This work addresses two main issues of the standard Kernel Entropy Component Analysis (KECA) algorithm: the optimization of the kernel decomposition and the optimization of the Gaussian kernel parameter. KECA roughly reduces to a sorting of the importance of kernel eigenvectors by entropy instead of by variance as in K…

2016-03-09abs ↗pdf ↗

Study spectral properties of graph Laplacian for manifold data.

problem Understanding spectral properties of graph Laplacian for manifold data.
method Non-asymptotic error bounds on spectral properties of empirical graph Laplacian.
result Eigenvalues and eigenspaces of empirical graph Laplacian are close to Laplace-Beltrami operator of manifold.

LLMs learn probability density functions in-context, showing distinct learning trajectories.

problem Density estimation of time series data in LLMs.
method Intensive Principal Component Analysis (InPCA) to visualize and analyze LLMs' learning dynamics.
result LLMs follow similar learning trajectories in a low-dimensional InPCA space, distinct from traditional methods.

Spofe bridges statistical rigor and interpretability in feature extraction from tabular data.

problem Ensuring statistical rigor and interpretability in feature extraction from complex tabular data.
method Spofe combines kernel principal components and sparse polynomial functions with a multi-objective knockoff selection procedure.
result Spofe consistently outperforms other methods in feature selection for regression and classification tasks.

New simulations advise caution in choosing principal components for multivariate functional data.

problem Inaccurate selection of principal components in multivariate functional data.
method Extensive simulations investigating the reliability of percentage of variance explained thresholds.
result Conventional threshold methods may fail to accurately explain overall variance in multivariate functional data.

Essential principal components simplify spectral analysis with minimal training data.

problem Accurate spectral quantification from complex mixtures.
method Identifying essential principal components and using molar extinction coefficients.
result Near one-to-one projection from principal components to mixture constituents.

Paper uses PCA to analyze Chinese sovereign bonds and discusses bond immunization.

problem Analyzing factors affecting Chinese sovereign bond yield changes.
method Applied Principal Component Analysis (PCA) on bond yield data.
result Identified principal factors influencing Chinese sovereign bond yield changes.

Integral invariants obtained from Principal Component Analysis on a small kernel domain of a submanifold encode important geometric information classically defined in differential-geometric terms. We generalize to hypersurfaces in any dimension major results known for surfaces in space, which in turn yield a method to …

2018-04-13abs ↗pdf ↗

The paper uses diffusion approximations to analyze and optimize online principal component estimation.

problem Optimizing online principal component estimation from streaming data.
method Diffusion approximation tools applied to Oja's iteration for principal component analysis.
result The Oja's iteration for the top eigenvector generates a continuous-state discrete-time Markov chain over the unit sphere.

In this paper the exact linear relation between the leading eigenvectors of the modularity matrix and the singular vectors of an uncentered data matrix is developed. Based on this analysis the concept of a modularity component is defined, and its properties are developed. It is shown that modularity component analysis …

2015-10-19abs ↗pdf ↗

HPPCA improves imputation of longitudinal data with missing values.

problem Handling incomplete, high-dimensional longitudinal data with nested sources of variation and temporal dependency.
method Hierarchical probabilistic principal component analysis (HPPCA) with a two-level latent factor model and Gaussian process.
result HPPCA outperforms standard PPCA and multivariate functional PCA in imputation accuracy, even under heavy missingness and model misspecification.