-
Notifications
You must be signed in to change notification settings - Fork 16
New issue
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
Sparse pca steps #83
Sparse pca steps #83
Conversation
Excited to see this progress! It looks like this is solving the problem of sparse PCA with regularization. I think this is important, but I'd suggest distinguishing it from my suggestion in #82 of truncated PCA. Truncated PCA is in my view an easier problem; it doesn't need hyperparameters like (This is IMO a good recipe step! But I agree with Alex's comment in #82 that this doesn't solve the problem of |
Co-authored-by: Hannah Frick <hfrick@users.noreply.github.com>
Co-authored-by: Hannah Frick <hfrick@users.noreply.github.com>
looks good! |
This pull request has been automatically locked. If you believe you have found a related problem, please file a new issue (with a reprex: https://reprex.tidyverse.org) and link to this issue. |
@dgrtwo
Steps for two types of sparse PCA;
step_pca_sparse()
can zero out values from the loading matrix anywhere.step_pca_sparse_bayes()
does the same but is encouraged to do so in a way that can eliminate all the loadings for a predictor.All feedback welcome.
An example:
data(pd_speech)
Created on 2021-06-07 by the reprex package (v2.0.0)