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.

168,657 papers · 148 categories

Trend · papers per month

1122 · Oct 201919922001200920172026
21 results for KPCA

Nyström KPCA balances computational efficiency and statistical accuracy.

problem Computational burden in large sample situations for kernel methods.
method Theoretical analysis of Nyström approximate kernel principal component analysis (KPCA).
result Nyström approximate KPCA matches statistical performance of non-approximate KPCA while being computationally beneficial.

Paper extends KPCA using dualization for faster, more robust algorithms.

problem Efficiently perform KPCA with robustness and sparsity.
method Dualization of convex functions for multiple objective functions, promoting sparsity and robustness.
result Significant speedup in KPCA training time and improved robustness and sparsity.

KPCA-BO improves BO for high-dimensional optimization problems by learning a non-linear sub-manifold.

problem High-dimensional optimization problems where Gaussian Process regression requires too much data and computation.
method KPCA-BO embeds a non-linear sub-manifold in the search space, learning a GPR model on this sub-manifold.
result KPCA-BO outperforms vanilla BO in convergence speed, especially as dimensionality increases.

In this paper, we propose a new method to perform Sparse Kernel Principal Component Analysis (SKPCA) and also mathematically analyze the validity of SKPCA. We formulate SKPCA as a constrained optimization problem with elastic net regularization (Hastie et al.) in kernel feature space and solve it. We consider outlier d…

2018-09-07abs ↗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 ↗

Paper explores how unsupervised learning reduces financial crime risks.

problem Identifying high-risk financial groups from complex data.
method Combines clustering and dimensionality reduction techniques.
result KPCA outperforms other techniques in reducing financial crime risks.

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 ↗

The main contribution of the paper is to show that Gaussian sketching of a kernel-Gram matrix K\boldsymbol K yields an operator whose counterpart in an RKHS H\mathcal H, is a \emph{random projection} operator---in the spirit of Johnson-Lindenstrauss (J-L) lemma. To be precise, given a random matrix ZZ with i.i.d. Ga…

2019-08-16abs ↗pdf ↗

In this paper we introduce the deep kernelized autoencoder, a neural network model that allows an explicit approximation of (i) the mapping from an input space to an arbitrary, user-specified kernel space and (ii) the back-projection from such a kernel space to input space. The proposed method is based on traditional a…

2017-02-08abs ↗pdf ↗

One of the major problems in natural language processing (NLP) is the word sense disambiguation (WSD) problem. It is the task of computationally identifying the right sense of a polysemous word based on its context. Resolving the WSD problem boosts the accuracy of many NLP focused algorithms such as text classification…

2019-07-21abs ↗pdf ↗

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.