The self-consistent field iteration for p-spectral clustering
arXiv:2111.09750
Abstract
The self-consistent field (SCF) iteration, combined with its variants, is one of the most widely used algorithms in quantum chemistry. We propose a procedure to adapt the SCF iteration for the p-Laplacian eigenproblem, which is an important problem in the field of unsupervised learning. We formulate the p-Laplacian eigenproblem as a type of nonlinear eigenproblem with one eigenvector nonlinearity , which then allows us to adapt the SCF iteration for its solution after the application of suitable regularization techniques. The results of our numerical experiments confirm the viablity of our approach.
References in corpus (8)
- Finding community structure in networks using the eigenvectors of matrices
- Spectral redemption: clustering sparse networks
- An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA
- PECOS: Prediction for Enormous and Correlated Output Spaces
- General Cheeger inequalities for p-Laplacians on graphs
- Community detection in networks via nonlinear modularity eigenvectors
- Convolution based smooth approximations to the absolute value function with application to non-smooth regularization
- Optimal Convergence Rate of Self-Consistent Field Iteration for Solving Eigenvector-dependent Nonlinear Eigenvalue Problems