AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

On Generalization Bounds for Projective Clustering

Maria Sofia Bucarelli, Matilde Fjeldsø Larsen, Chris Schwiegelshohn, Mads Toftrup

NeurIPS 2023 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
compare empirical k-exponent to theoretical valuecenter-based clustering · Covtype, Mushroom, Skin_Nonskin, MNISTfitted exponent q1: 0.5 -> 0.44Improved
compare empirical n-exponent to theoretical valuecenter-based clustering · real datasetsfitted exponent q2: 0.5 -> 0.52No clear effect
increase power z from 1 to 4 (ablation)center-based clustering · Covtypefitted q1 and q2: 0.44 -> 0.44No clear effect
increase power z (ablation)subspace clustering · Covtype, j=1excess risk decrease rateImproved
increase subspace dimension j (ablation)subspace clustering · real datasetsfitted exponentsNo clear effect
increase number of clusters k (ablation)subspace clustering · real datasetsdependency on kMixed
assume margin or stability conditions hold in practiceclustering generalization bounds · real datasetslearning rateNo clear effect

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