paper-with-me

홈 › Papers

PRIM-cipal components analysis

2026-04-16 · Tianhao Liu, Daniel Andrés Díaz-Pachón, J. Sunil Rao arxiv

Supervised No Free Lunch Theorems (NFLTs) are well studied, yet unsupervised NFLTs remain underexplored. For elliptical distributions, we prove that there exist two equally optimal, scientifically meaningful bump-hunting strategies that are exact opposites, with no universal winner. Specifically, peeling $k$ orthogonal dimensions from $\mathbb{R}^d$ ($d \ge k$), retaining an inter-quantile region of probability $1-α$ per peeled dimension, maximizes total variance and Frobenius norm when the $k$ smallest principal components (called pettiest components) are selected, and minimizes them when the selected dimensions are the $k$ leading principal components. These optima inspire PRIM-based bump-hunting algorithms either by minimizing variance or by minimizing volume, thereby motivating an NFLT. We test our results on the Fashion-MNIST database, showing that peeling the largest principal components captures multiplicity, while peeling the smallest principal components isolates popular styles.

📄 PDF Abstract BibTeX arXiv:2604.15538

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Principal Component Analysis versus Factor Analysis

2021-10-21 · Zenon Gniazdowski

The article discusses selected problems related to both principal component analysis (PCA) and factor analysis (FA). In particular, both types of analysis were compared. A vector interpretation for both PCA and FA has al…

Unsupervised Bump Hunting Using Principal Components

2014-09-30 · Daniel A Díaz-Pachón, Jean-Eudes Dazard, J. Sunil Rao

Principal Components Analysis is a widely used technique for dimension reduction and characterization of variability in multivariate populations. Our interest lies in studying when and why the rotation to principal compo…

Dimensionality Reduction

Simplified Rules and Theoretical Analysis for Information Bottleneck Optimization and PCA with Spiking Neurons

2007-12-01 · NeurIPS 2007 12 · Lars Buesing, Wolfgang Maass

We show that under suitable assumptions (primarily linearization) a simple and perspicuous online learning rule for Information Bottleneck optimization with spiking neurons can be derived. This rule performs on common be…

Robust Market Interventions

2024-11-05 · Andrea Galeotti, Benjamin Golub, Sanjeev Goyal, Eduard Talamàs 외

When can interventions in markets be designed to increase surplus robustly -- i.e., with high probability -- accounting for uncertainty due to imprecise information about economic primitives? In a setting with many strat…

On Estimation and Inference of Large Approximate Dynamic Factor Models via the Principal Component Analysis

2022-11-03 · Matteo Barigozzi

We provide an alternative derivation of the asymptotic results for the Principal Components estimator of a large approximate factor model. Results are derived under a minimal set of assumptions and, in particular, we req…

regressionTime SeriesTime Series AnalysisTime Series Regression