We consider Fair Principal Component Analysis (FPCA) and search for a low dimensional subspace that spans multiple target vectors in a fair manner. FPCA is defined as a non-concave maximization of the worst projected target norm within a given set. The problem arises in filter design in signal processing, and when inco…
We found hidden convexity in FPCA and developed a faster algorithm.
problem Bias in PCA leading to unequal subgroup outcomes.
method Convex optimization via eigenvalue optimization.
result Faster and fairer PCA algorithm.
RFPCA improves robustness of FPCA for matrix data.
problem Outliers in matrix data degrade the performance of FPCA.
method RFPCA uses matrix-variate t-distribution and EM algorithm for robust estimation.
result RFPCA outperforms other methods in detecting matrix-valued outliers.
This paper aims to develop new techniques to describe joint behavior of stocks, beyond regression and correlation. For example, we want to identify the clusters of the stocks that move together. Our work is based on applying Kernel Principal Component Analysis(KPCA) and Functional Principal Component Analysis(FPCA) to …
Novel prior for orthogonal functions improves functional component estimation.
problem Improving orthogonality in functional principal component analysis.
method Sequential adaptive priors for orthogonal functions using hierarchical conditionally normal distributions.
result Proposed prior leads to nearly orthogonal posterior estimates.
A method for noise reduction in functional time series using FPCA.
problem Noise contamination in functional time series.
method Extending FPCA to separate signal and noise components.
result Optimal projection minimizes mean integrated squared error.
We consider the sampling problem for functional PCA (fPCA), where the simplest example is the case of taking time samples of the underlying functional components. More generally, we model the sampling operation as a continuous linear map from H to Rm, where the functional components to lie in so…
Proposes FunNoL for better curve classification and reconstruction in multivariate functional data.
problem Linear methods fail to capture nonlinear structures in multivariate functional data.
method Functional nonlinear learning (FunNoL) method using nonlinear mapping.
result FunNoL outperforms FPCA in curve classification and reconstruction, especially in multivariate settings.
A new method clusters rows of a matrix of point processes.
problem Challenges in analyzing structured point process data.
method Mixture model of multi-level marked point processes, combined with ES algorithm and FPCA.
result An efficient method for clustering rows of a matrix of point processes.
Study on liquidity dynamics in Uniswap v3 pools using statistical methods.
problem Characterize liquidity in Uniswap v3 pools.
method Functional principal component analysis (FPCA) and dynamic factor methods.
result Liquidity dynamics in Uniswap v3 pools are well-captured by a low-order Legendre polynomial basis.
The paper proposes a new method for clustering survival data using smoothed log-hazard trajectories.
problem Clustering survival data based on instantaneous risk dynamics.
method Functional Principal Component Analysis applied to B-spline smoothed log-hazard trajectories.
result The proposed method provides an interpretable representation of relative temporal risk dynamics.
A new PCA method for analyzing point processes.
problem Analyzing variability in replicated point processes.
method Functional Principal Component Analysis (fPCA) on cumulative mass functions.
result Established convergence and introduced principal measures.
Enhances Random Forest for imbalanced functional data classification.
problem Challenges in classifying imbalanced functional data.
method Functional Random Forest with Adaptive Cost-Sensitive Splitting (FRF-ACS).
result Significantly improves minority class recall and predictive performance.
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.
The wide variety of motions performed by the human arm during daily tasks makes it desirable to find representative subsets to reduce the dimensionality of these movements for a variety of applications, including the design and control of robotic and prosthetic devices. This paper presents a novel method and the result…