Sparse PCA with Overlapping Supports: NP-Hardness and an FPTAS
cs.LG, math.OC
Submitted: 2026-11-11
Updated: 2026-11-11
Terminology
Sources
- Sparse PCA via Bipartite Matchings
- A bound on the minimum of a real positive polynomial over the standard simplex
- A Decomposition Framework for Certifiably Optimal Orthogonal Sparse PCA
- Approximation Algorithms for Sparse Principal Component Analysis
- A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis