Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity
Jian-Feng Cai, Zhuozhi Xian, Jiaxi Ying
2/14/2026
No confident code implementation found for this paper. 2 possible matches can be shown below.
Code Implementations
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Similar Papers
An Efficient and Robust Framework for Approximate Nearest Neighbor Search with Attribute Constraint
99% match2026
Whittle Index with Multiple Actions and State Constraint for Inventory Management
98% match2026
Active Learning for Object Detection with Evidential Deep Learning and Hierarchical Uncertainty Aggregation
98% match1 repo262026
Bootstrapping Variational Information Pursuit with Large Language and Vision Models for Interpretable Image Classification
97% match1 repo62026
LipsNet: A Smooth and Robust Neural Network with Adaptive Lipschitz Constant for High Accuracy Optimal Control
97% match1 repo352026
BaWA: Automatic Optimizing Pruning Metric for Large Language Models with Balanced Weight and Activation
96% match2026
Cite this paper
@article{cai2026fast,
title = {Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity},
author = {Jian-Feng Cai and Zhuozhi Xian and Jiaxi Ying},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:00ed8cf93b4246e8472cd742a01bb0d65c1b4b19},
journal = {ICML 2025 2025}
}Add a badge to your README
Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/00ed8cf93b4246e8472cd742a01bb0d65c1b4b19)