资源分类
》 资源 》论文》Optimal Sparse Linear Encoders and Sparse PCA

Optimal Sparse Linear Encoders and Sparse PCA

2020-02-05 | |  142 |   132 |   0

Abstract

 Principal components analysis (PCA) is the optimal linear encoder of data. Sparse linear encoders (e.g., sparse PCA) produce more interpretable features that can promote better generalization. (i) Given a level of sparsity, what is the best approximation to PCA? (ii) Are there efficient algorithms which can achieve this optimal combinatorial tradeoff? We answer both questions by providing the first polynomial-time algorithms to construct optimal sparse linear auto-encoders; additionally, we demonstrate the performance of our algorithms on real data.

上一篇：Joint quantile regression in vector-valued RKHSs

下一篇：Quantum Perceptron Models

用户评价
全部评价

热门资源

  • Regularizing RNNs...

    Recently, caption generation with an encoder-de...

  • Deep Cross-media ...

    Cross-media retrieval is a research hotspot in ...

  • Learning Expressi...

    Facial expression is temporally dynamic event w...

  • Compact MDDs for ...

    Pseudo-Boolean (PB) constraints are usually en...

  • Attributed Graph ...

    Graph clustering is a fundamental task which di...