AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Understanding the Generalization Performance of Spectral Clustering Algorithms

AAAI 2023 · Learning theory and algorithms › Clustering · approach: Correlation clustering · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use integral-operator extensions to compare empirical and population continuous solutionsRelaxed RatioCut · Population-level continuous solutionexcess-risk convergence rate: \mathcal{O}\left(\frac{1}{\sqrt{n}} \right)Helped
Use the auxiliary RKHS and integral-operator analysis for the normalized LaplacianRelaxed NCut · Population-level continuous solutionexcess-risk convergence rate: \mathcal{O}\left(\frac{1}{\sqrt{n}}\right)Helped
Add orthonormal-transform discretization to minimize distance from the continuous solutionSpectral clustering discrete solution · Population-level discrete solutionexcess-risk upper bound: 4C\epsilonHelped
Extend eigenfunctions to new samples and discretize with the orthonormal-transform procedureGPOD for relaxed RatioCut and relaxed NCut · Out-of-sample clusteringability to cluster unseen samples without re-eigendecompositionHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy