arXiv 0804.35752008-04cs.LGcs.CG

Isotropic PCA and Affine-Invariant Clustering

Georgia Tech（佐治亚理工学院）

S. Charles Brubaker, Santosh S. Vempala

英文摘要：

We present a new algorithm for clustering points in R^n. The key property of the algorithm is that it is affine-invariant, i.e., it produces the same partition for any affine transformation of the input. It has strong guarantees when the input is drawn from a mixture model. For a mixture of two arbitrary Gaussians, the algorithm correctly classifies the sample assuming only that the two components are separable by a hyperplane, i.e., there exists a halfspace that contains most of one Gaussian and almost none of the other in probability mass. This is nearly the best possible, improving known results substantially. For k > 2 components, the algorithm requires only that there be some (k-1)-dimensional subspace in which the emoverlap in every direction is small. Here we define overlap to be the ratio of the following two quantities: 1) the average squared distance between a point and the mean of its component, and 2) the average squared distance between a point and the mean of the mixture. The main result may also be stated in the language of linear discriminant analysis: if the standard Fisher discriminant is small enough, labels are not needed to estimate the optimal subspace for projection. Our main tools are isotropic transformation, spectral projection and a simple reweighting technique. We call this combination isotropic PCA.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

空间形式中的主成分分析

Principal Component Analysis in Space Forms

Halıcıoğlu Data Science Institute, UCSD（加州大学圣迭戈分校哈利乔格鲁数据科学学院）；Computer Science and Engineering Department, UCSD（加州大学圣迭戈分校计算机科学与工程系）；Electrical and Computer Engineering Department, UCSD（加州大学圣迭戈分校电气与计算机工程系）

针对传统PCA仅适用于欧氏空间的局限，提出常曲率空间下的SFPCA方法，通过满足特征方程解、子空间嵌套性质的代价函数实现降维，在球面和双曲空间数据上收敛速度与精度均优于现有迭代方法。

2024-07-09cs.LGeess.SPmath.DG

用于（非平方）欧氏距离的 $k$-PCA：多项式时间近似

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation

Robotics & Big Data Labs, University of Haifa, Israel（机器人与大数据实验室，海法大学）

本文针对欧氏空间中 $k$-子空间中位数（非平方距离和最小化）问题，提出首个运行时间与近似因子均不随 $k$ 指数增长的多项式时间确定性算法，近似因子为 $\sqrt{d}$，并给出代码与实验验证。

2025-07-19cs.CGcs.DScs.LG

数据离心率、高斯径向基函数再生核希尔伯特空间的渐近性及核主成分分析

Data eccentricity, asymptotics of Gaussian RBF reproducing kernel Hilbert space, and kernel PCA

Boston College（波士顿学院）

研究高斯RBF再生核希尔伯特空间在大带宽极限下的渐近性质，通过理论分析表明其渐近等距于欧氏空间，核主成分分析相关指标也收敛于线性主成分分析结果，还通过实验证明ρ可预测数据集收敛行为。

2026-07-27cs.LG

图正则化主成分分析

Graph Regularized PCA

Shell Information Technology Limited（Shell信息科技有限公司）；University College London（伦敦大学学院）；Department of Computer Science（计算机科学系）；Systemic Risk Centre（系统性风险中心）；London School of Economics and Political Sciences（伦敦政治经济学院）；Shell Information Technology International B.V.（Shell信息科技国际有限公司）

针对多变量数据复杂依赖性问题，提出图正则化主成分分析（GR - PCA），通过学习稀疏精度图等纳入数据特征依赖结构，在合成数据上评估，与主流方法比有优势，能防止高频信号过拟合，为有结构感知的降维提供实用途径。

2026-07-15cs.LG

Audio scene monitoring using redundant ad-hoc microphone array networks

University of California San Diego（加州大学圣迭戈分校）；Université de Sherbrooke（舍布鲁克大学）

We present a system for localizing sound sources in a room with several ad-hoc microphone arrays. Each circular array performs direction of arrival (DOA) estimation independently using commercial software. The DOAs are fed to a fusion center, concatenated, and used to perform the localization based on two proposed methods, which require only few labeled source locations (anchor points) for training. The first proposed method is based on principal component analysis (PCA) of the observed DOA and does not require any knowledge of anchor points. The array cluster can then perform localization on …

2021-08-23cs.LGcs.SDeess.AS

Impact of PCA-based preprocessing and different CNN structures on deformable registration of sonograms

Westfälische Hochschule University of Applied Sciences（威斯特伐利亚应用科学大学）

Central venous catheters (CVC) are commonly inserted into the large veins of the neck, e.g. the internal jugular vein (IJV). CVC insertion may cause serious complications like misplacement into an artery or perforation of cervical vessels. Placing a CVC under sonographic guidance is an appropriate method to reduce such adverse events, if anatomical landmarks like venous and arterial vessels can be detected reliably. This task shall be solved by registration of patient individual images vs. an anatomically labelled reference image. In this work, a linear, affine transformation is performed on c…

2023-01-20cs.CVcs.LG

更多相关论文收起更多论文

SuperPCA：子空间分析与高维PCA的高效算法

SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA

University of Oxford（牛津大学）；University of Groningen（格罗宁根大学）；EPFL（洛桑联邦理工学院）

针对尖峰协方差模型，发现样本协方差矩阵主要特征向量张成的子空间比单个特征向量更早包含信号信息，据此提出SuperPCA算法，通过子采样坐标高效估计高维多信号主成分，同等测量次数下精度提升10倍。

2026-09-23cs.LGcs.NAmath.NA

Exploring Algorithmic Limits of Matrix Rank Minimization under Affine Constraints

Peking University（北京大学）；Microsoft Research（微软研究院）

Many applications require recovering a matrix of minimal rank within an affine constraint set, with matrix completion a notable special case. Because the problem is NP-hard in general, it is common to replace the matrix rank with the nuclear norm, which acts as a convenient convex surrogate. While elegant theoretical conditions elucidate when this replacement is likely to be successful, they are highly restrictive and convex algorithms fail when the ambient rank is too high or when the constraint set is poorly structured. Non-convex alternatives fare somewhat better when carefully tuned; howev…

2015-07-01cs.LGstat.ML

使用降维的学习增强K-Means聚类

Learning-Augmented K-Means Clustering Using Dimensional Reduction

University of Brawijaya（布拉维贾亚大学）

针对k-means算法计算成本随k值增加且易陷入局部最小值的挑战，提出利用主成分分析（PCA）进行降维的学习增强方案，在k值为10和25时有效降低了成本。

2024-01-06cs.LG

Tight Sensitivity Bounds For Smaller Coresets

University of Haifa（海法大学）

An $\varepsilon$-coreset for Least-Mean-Squares (LMS) of a matrix $A\in{\mathbb{R}}^{n\times d}$ is a small weighted subset of its rows that approximates the sum of squared distances from its rows to every affine $k$-dimensional subspace of ${\mathbb{R}}^d$, up to a factor of $1\pm\varepsilon$. Such coresets are useful for hyper-parameter tuning and solving many least-mean-squares problems such as low-rank approximation ($k$-SVD), $k$-PCA, Lassso/Ridge/Linear regression and many more. Coresets are also useful for handling streaming, dynamic and distributed big data in parallel. With high proba…

2019-07-02cs.LGstat.ML

尖峰张量PCA中交替幂迭代的有限迭代局部动力学与热启动

Finite-Iteration Local Dynamics and Warm Starts for Alternating Power Iteration in Spiked Tensor PCA

Peking University（北京大学）

研究固定阶非对称秩一张量模型中同步交替幂迭代的有限迭代局部理论，提出与初始化无关的误差分解和热启动机制。

2026-06-02cs.LGmath.STstat.ML

Subspace Recovery from Heterogeneous Data with Non-isotropic Noise

Stanford University（斯坦福大学）；Apple（苹果公司）

Recovering linear subspaces from data is a fundamental and important task in statistics and machine learning. Motivated by heterogeneity in Federated Learning settings, we study a basic formulation of this problem: the principal component analysis (PCA), with a focus on dealing with irregular noise. Our data come from $n$ users with user $i$ contributing data samples from a $d$-dimensional distribution with mean $μ_i$. Our goal is to recover the linear subspace shared by $μ_1,\ldots,μ_n$ using the data points from all users, where every data point from user $i$ is formed by adding an independe…

2022-10-24cs.ITcs.LGmath.IT

类型化仿射决策结构的威力：一项案例研究

The Power of Typed Affine Decision Structures: A Case Study

TU Dortmund University（多特蒙德工业大学）

该研究将新颖的白盒神经网络表示TADS应用于神经网络验证，结合前提投影技术与PCA实现鲁棒性误差的精确诊断，验证了其在可解释性与验证上的效用，可处理中等规模问题并提供误差解释。

2023-04-28cs.LGcs.NE

Efficient Clustering for Stretched Mixtures: Landscape and Optimality

Columbia University（哥伦比亚大学）；Princeton University（普林斯顿大学）；Cornell University（康奈尔大学）

This paper considers a canonical clustering problem where one receives unlabeled samples drawn from a balanced mixture of two elliptical distributions and aims for a classifier to estimate the labels. Many popular methods including PCA and k-means require individual components of the mixture to be somewhat spherical, and perform poorly when they are stretched. To overcome this issue, we propose a non-convex program seeking for an affine transform to turn the data into a one-dimensional point cloud concentrating around $-1$ and $1$, after which clustering becomes easy. Our theoretical contribut…

2021-11-27cs.LGmath.OCmath.ST