Supervised PCA: A Multiobjective Approach
Methods for supervised principal component analysis (SPCA) aim to incorporate label information into principal component analysis (PCA), so that the extracted features are more useful for a prediction task of interest. Prior work on SPCA has focused primarily on optimizing prediction error, and has neglected the value of maximizing variance explained by the extracted features. We propose a new method for SPCA that addresses both of these objectives jointly, and demonstrate empirically that our approach dominates existing approaches, i.e., outperforms them with respect to both prediction error and variation explained. Our approach accommodates arbitrary supervised learning losses and, through a statistical reformulation, provides a novel low-rank extension of generalized linear models.
Code (0)
등록된 구현이 없습니다.
Tasks
PredictionSimilar Papers 제목 키워드 기반
Objective-Induced Bias and Search Dynamics in Multiobjective Unsupervised Feature Selection
Unsupervised feature selection is commonly formulated as a multiobjective optimisation problem that jointly optimises subset quality and subset size. Yet the behaviour of this formulation depends critically on the choice…
Multiobjective Optimization and Unsupervised Lexical Acquisition for Named Entity Recognition and Classification
Wasserstein Distributionally Robust Inverse Multiobjective Optimization
Inverse multiobjective optimization provides a general framework for the unsupervised learning task of inferring parameters of a multiobjective decision making problem (DMP), based on a set of observed decisions from the…
Decision MakingMultiobjective OptimizationPortfolio OptimizationEvolutionary Biparty Multiobjective UAV Path Planning: Problems and Empirical Comparisons
Unmanned aerial vehicles (UAVs) have been widely used in urban missions, and proper planning of UAV paths can improve mission efficiency while reducing the risk of potential third-party impact. Existing work has consider…
The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization
A hybrid framework combining the branch and bound method with multiobjective evolutionary algorithms is proposed for nonconvex multiobjective optimization. The hybridization exploits the complementary character of the tw…
Evolutionary AlgorithmsMultiobjective Optimization