Related papers: Lie PCA: Density estimation for symmetric manifold…
Oja's algorithm of principal component analysis (PCA) has been one of the methods utilized in practice to reduce dimension. In this paper, we focus on the convergence property of the discrete algorithm. To realize that, we view the…
Principal component analysis (PCA) is a classical feature extraction method, but it may be adversely affected by outliers, resulting in inaccurate learning of the projection matrix. This paper proposes a robust method to estimate both the…
We analyze the classical equations of motion for a particle moving in the presence of a static magnetic field applied in the $ z $ direction, which varies as $ {1\over{x^2}} $. We find the symmetries through Lie's method of group analysis.…
We present quasicyclic principal component analysis (QPCA), a generalization of principal component analysis (PCA), that determines an optimized basis for a dataset in terms of families of shift-orthogonal principal vectors. This is of…
Principal Component Analysis (PCA) is a ubiquitous tool with many applications in machine learning including feature construction, subspace embedding, and outlier detection. In this paper, we present an algorithm for computing the top…
In many CAD-based applications, complex geometries are defined by a high number of design parameters. This leads to high-dimensional design spaces that are challenging for downstream engineering processes like simulations, optimization, and…
We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…
Principal Component Analysis (PCA) is a popular tool for dimensionality reduction and feature extraction in data analysis. There is a probabilistic version of PCA, known as Probabilistic PCA (PPCA). However, standard PCA and PPCA are not…
In this work we introduce a new residual for normal linear models that are suitable for situations in which we are dealing with heteroskedasticity of unknown form, they are referred to by principal component analysis (PCA) residuals. These…
Understanding the morphology of galaxies is a critical aspect of astrophysics research, providing insight into the formation, evolution, and physical properties of these vast cosmic structures. Various observational and computational…
Lie symmetry transformations that leave a differential equation invariant play a fundamental role in science and mathematics. Such Lie symmetry groups uniquely determine their Lie symmetry algebras. Exact differential elimination algorithms…
Advanced representation learning techniques require reliable and general evaluation methods. Recently, several algorithms based on the common idea of geometric and topological analysis of a manifold approximated from the learned data…
Results on characterization of manifolds in terms of certain Lie algebras growing on them, especially Lie algebras of differential operators, are reviewed and extended. In particular, we prove that a smooth (real-analytic, Stein) manifold…
Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering. Still it is highly sensitive to outliers and does not scale well with respect to the number of data samples. Robust PCA…
We extend the principal component analysis (PCA) to second-order stationary vector time series in the sense that we seek for a contemporaneous linear transformation for a $p$-variate time series such that the transformed series is segmented…
Principal Component Analysis (PCA) is a well-known technique used to decorrelate a set of vectors. It has been applied to explore the star formation history of galaxies or to determine distances of mass-lossing stars. Here we apply PCA to…
We consider the problem of estimating multiple principal components using the recently-proposed Sparse and Functional Principal Components Analysis (SFPCA) estimator. We first propose an extension of SFPCA which estimates several principal…
We introduce a novel algorithm that computes the $k$-sparse principal component of a positive semidefinite matrix $A$. Our algorithm is combinatorial and operates by examining a discrete set of special vectors lying in a low-dimensional…
We propose a geometric numerical analysis of SDEs admitting Lie symmetries which allows us to individuate a symmetry adapted coordinates system where the given SDE has notable invariant properties. An approximation scheme preserving the…
Methods of Lie group analysis of differential equations are extended to weak solutions of (linear and nonlinear) PDEs, where the term ``weak solution'' comprises the following settings: (a) Distributional solutions. (b) Solutions in…