A Simple Approach to Automated Spectral Clustering
Nov 28, 2022
Speakers
Jicong Fan
Speaker · 0 followers
Zhao Zhang
Speaker · 0 followers
Mingbo Zhao
Speaker · 0 followers
Haijun Zhang
Speaker · 0 followers
About
The performance of spectral clustering heavily relies on the quality of affinity matrix. A variety of affinity-matrix-construction (AMC) methods have been proposed but they have hyperparameters to determine beforehand, which requires strong experience and lead to difficulty in real applications especially when the inter-cluster similarity is high and/or the dataset is large. In addition, we often need to choose different AMC methods for different datasets, which still depends on experience. To solve these two challenging problems, in this paper, we present a simple yet effective method for automated spectral clustering. First, we propose to find the most reliable affinity matrix via grid search or Bayesian optimization among a set of candidates given by different AMC methods with different hyperparameters, where the reliability is quantified by the relative-eigen-gap of graph Laplacian introduced in this paper. Second, we propose a fast and accurate AMC method based on least squares representation and thresholding and prove its effectiveness theoretically. Finally, we provide a large-scale extension for the automated spectral clustering, of which the time complexity is linear with the number of data points. Extensive experiments of natural image clustering show that our method is more versatile, accurate, and efficient than baseline methods.The performance of spectral clustering heavily relies on the quality of affinity matrix. A variety of affinity-matrix-construction (AMC) methods have been proposed but they have hyperparameters to determine beforehand, which requires strong experience and lead to difficulty in real applications especially when the inter-cluster similarity is high and/or the dataset is large. In addition, we often need to choose different AMC methods for different datasets, which still depends on experience. To s…
Organizer
NeurIPS 2022
Account · 962 followers
Like the format? Trust SlidesLive to capture your next event!
Professional recording and live streaming, delivered globally.
Sharing
Recommended Videos
Presentations on similar topic, category or speaker
AutoMTL: A Programming Framework for Automating Efficient Multi-Task Learning
Watch later
Lijun Zhang, …
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
Sobolev Acceleration and Statistical Optimality for Learning Elliptic Equations via Gradient Descent
Watch later
Yiping Lu, …
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
Stable Diffusion and Friends
Watch later
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
Inferring Class Label Distribution of Training Data from Classifiers: An Accuracy-Augmented Meta-Classifier Attack
Watch later
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
Learning about materials by learning to predict images and videos
Watch later
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representation
Watch later
Jimmy Ba, …
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%