We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Dear Justin
First of all, thanks a lot for your excellent implementation of sparse PCA using proximal gradient methods! I was looking through your Python code for sparse PCA and found that you used the SVD of the data matrix twice for the initialization of the optimization algorithm, see: https://github.com/xinging-birds/AManPG/blob/7566b947982016a722ef9e4ec2e2206458065cae/Python/sparsepca/sparsepca.py#L65-L68
Is this intentional or did you simply overlook this when reviewing the code?
Best, Kevin
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Dear Justin
First of all, thanks a lot for your excellent implementation of sparse PCA using proximal gradient methods!
I was looking through your Python code for sparse PCA and found that you used the SVD of the data matrix twice for the initialization of the optimization algorithm, see:
https://github.com/xinging-birds/AManPG/blob/7566b947982016a722ef9e4ec2e2206458065cae/Python/sparsepca/sparsepca.py#L65-L68
Is this intentional or did you simply overlook this when reviewing the code?
Best,
Kevin
The text was updated successfully, but these errors were encountered: