{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/pca/papers/12","list_of":"/method/pca","method":"PCA","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":12,"pages_in_order":14,"rows_per_page":100,"rows":[1101,1200],"of":1323,"counts":{"archive_papers_tagged":1323,"with_a_code_link":319,"where_syntology_ran_a_sample":46,"not_listed_spam_title":0,"listed":1323,"listed_where_code_ran":46,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":31,"every_run_a_failure_of_syntologys_instrument":15,"listed_with_a_run_with_no_instrument_failure":31,"listed_every_run_a_failure_of_syntologys_instrument":15,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/pca","prev":"/method/pca/papers/11","next":"/method/pca/papers/13","papers":[{"paper":"/paper/single-pass-pca-of-matrix-products","slug":"single-pass-pca-of-matrix-products","title":"Single Pass PCA of Matrix Products","date":"2016-10-21","arxiv_id":"1610.06656","n_code_links":1,"syntology":null},{"paper":null,"slug":"what-is-the-best-way-for-extracting","title":"What is the Best Way for Extracting Meaningful Attributes from Pictures?","date":"2016-10-17","arxiv_id":"1610.04957","n_code_links":0,"syntology":null},{"paper":"/paper/mapping-between-fmri-responses-to-movies-and","slug":"mapping-between-fmri-responses-to-movies-and","title":"Mapping Between fMRI Responses to Movies and their Natural Language Annotations","date":"2016-10-13","arxiv_id":"1610.03914","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-a-theoretical-analysis-of-pca-for","title":"Towards a Theoretical Analysis of PCA for Heteroscedastic Data","date":"2016-10-12","arxiv_id":"1610.03595","n_code_links":0,"syntology":null},{"paper":null,"slug":"em-based-mixture-models-applied-to-video","title":"EM-Based Mixture Models Applied to Video Event Detection","date":"2016-10-10","arxiv_id":"1610.02923","n_code_links":0,"syntology":null},{"paper":null,"slug":"effective-combination-of-language-and-vision","title":"Effective Combination of Language and Vision Through Model Composition and the R-CCA Method","date":"2016-09-28","arxiv_id":"1609.08810","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-principal-component-regression-for","title":"Sparse principal component regression for generalized linear models","date":"2016-09-28","arxiv_id":"1609.08886","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-rnn-elm-classifier","title":"The RNN-ELM Classifier","date":"2016-09-25","arxiv_id":"1609.07724","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimality-and-sub-optimality-of-pca-for","title":"Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization","date":"2016-09-19","arxiv_id":"1609.05573","n_code_links":0,"syntology":null},{"paper":null,"slug":"coherence-pursuit-fast-simple-and-robust-1","title":"Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis","date":"2016-09-15","arxiv_id":"1609.04789","n_code_links":0,"syntology":null},{"paper":null,"slug":"iteratively-reweighted-least-squares","title":"Iteratively Reweighted Least Squares Algorithms for L1-Norm Principal Component Analysis","date":"2016-09-10","arxiv_id":"1609.02997","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-sparse-principal-components","title":"Structured Sparse Principal Components Analysis with the TV-Elastic Net penalty","date":"2016-09-06","arxiv_id":"1609.01423","n_code_links":0,"syntology":null},{"paper":null,"slug":"pilot-testing-an-artificial-intelligence","title":"Pilot Testing an Artificial Intelligence Algorithm That Selects Homeless Youth Peer Leaders Who Promote HIV Testing","date":"2016-08-19","arxiv_id":"1608.05701","n_code_links":0,"syntology":null},{"paper":null,"slug":"parameterized-principal-component-analysis","title":"Parameterized Principal Component Analysis","date":"2016-08-16","arxiv_id":"1608.04695","n_code_links":0,"syntology":null},{"paper":null,"slug":"correlated-pca-principal-components-analysis","title":"Correlated-PCA: Principal Components' Analysis when Data and Noise are Correlated","date":"2016-08-15","arxiv_id":"1608.04320","n_code_links":0,"syntology":null},{"paper":"/paper/early-methods-for-detecting-adversarial","slug":"early-methods-for-detecting-adversarial","title":"Early Methods for Detecting Adversarial Images","date":"2016-08-01","arxiv_id":"1608.00530","n_code_links":1,"syntology":{"ran":9,"of":10,"n_ran_checked":9,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["hendrycks/fooling"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"face-recognition-using-scattering","title":"Face Recognition Using Scattering Convolutional Network","date":"2016-07-30","arxiv_id":"1608.00059","n_code_links":0,"syntology":null},{"paper":null,"slug":"asymptotic-properties-of-principal-component","title":"Asymptotic properties of Principal Component Analysis and shrinkage-bias adjustment under the Generalized Spiked Population model","date":"2016-07-28","arxiv_id":"1607.08647","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-appearance-models-a-deep-boltzmann","title":"Deep Appearance Models: A Deep Boltzmann Machine Approach for Face Modeling","date":"2016-07-23","arxiv_id":"1607.06871","n_code_links":0,"syntology":null},{"paper":"/paper/explaining-predictions-of-non-linear","slug":"explaining-predictions-of-non-linear","title":"Explaining Predictions of Non-Linear Classifiers in NLP","date":"2016-06-23","arxiv_id":"1606.07298","n_code_links":1,"syntology":null},{"paper":null,"slug":"nearly-optimal-robust-matrix-completion","title":"Nearly-optimal Robust Matrix Completion","date":"2016-06-23","arxiv_id":"1606.07315","n_code_links":0,"syntology":null},{"paper":null,"slug":"mutual-information-for-symmetric-rank-one","title":"Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula","date":"2016-06-13","arxiv_id":"1606.04142","n_code_links":0,"syntology":null},{"paper":null,"slug":"sequential-principal-curves-analysis","title":"Sequential Principal Curves Analysis","date":"2016-06-02","arxiv_id":"1606.00856","n_code_links":0,"syntology":null},{"paper":null,"slug":"suppressing-background-radiation-using","title":"Suppressing Background Radiation Using Poisson Principal Component Analysis","date":"2016-05-26","arxiv_id":"1605.08455","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-algorithms-for-robust-pca-via-gradient","title":"Fast Algorithms for Robust PCA via Gradient Descent","date":"2016-05-25","arxiv_id":"1605.07784","n_code_links":0,"syntology":null},{"paper":null,"slug":"riemannian-svrg-fast-stochastic-optimization","title":"Riemannian SVRG: Fast Stochastic Optimization on Riemannian Manifolds","date":"2016-05-23","arxiv_id":"1605.07147","n_code_links":0,"syntology":null},{"paper":null,"slug":"bayesian-variable-selection-for-globally","title":"Bayesian Variable Selection for Globally Sparse Probabilistic PCA","date":"2016-05-19","arxiv_id":"1605.05918","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-and-accurate-performance-analysis-of-lte","title":"Fast and Accurate Performance Analysis of LTE Radio Access Networks","date":"2016-05-16","arxiv_id":"1605.04652","n_code_links":0,"syntology":null},{"paper":null,"slug":"identification-of-refugee-influx-patterns-in","title":"Identification of refugee influx patterns in Greece via model-theoretic analysis of daily arrivals","date":"2016-05-09","arxiv_id":"1605.02784","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-nonconvex-and-nonsmooth","title":"Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis","date":"2016-05-09","arxiv_id":"1605.02408","n_code_links":0,"syntology":null},{"paper":null,"slug":"matrix-factorization-based-clustering-of","title":"Matrix Factorization-Based Clustering Of Image Features For Bandwidth-Constrained Information Retrieval","date":"2016-05-07","arxiv_id":"1605.02140","n_code_links":0,"syntology":null},{"paper":null,"slug":"estimating-sparse-signals-with-smooth-support","title":"Estimating Sparse Signals with Smooth Support via Convex Programming and Block Sparsity","date":"2016-05-06","arxiv_id":"1605.01813","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-fold-gabor-pca-and-ica-filter","title":"Multi-Fold Gabor, PCA and ICA Filter Convolution Descriptor for Face Recognition","date":"2016-04-24","arxiv_id":"1604.07057","n_code_links":0,"syntology":null},{"paper":null,"slug":"probing-the-intra-component-correlations","title":"Probing the Intra-Component Correlations within Fisher Vector for Material Classification","date":"2016-04-15","arxiv_id":"1604.04473","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-globally-convergent-stochastic","title":"Efficient Globally Convergent Stochastic Optimization for Canonical Correlation Analysis","date":"2016-04-07","arxiv_id":"1604.01870","n_code_links":0,"syntology":null},{"paper":null,"slug":"non-greedy-l21-norm-maximization-for","title":"Non-Greedy L21-Norm Maximization for Principal Component Analysis","date":"2016-03-28","arxiv_id":"1603.08293","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-empirical-study-of-dimensional-reduction","title":"An Empirical Study of Dimensional Reduction Techniques for Facial Action Units Detection","date":"2016-03-25","arxiv_id":"1603.08039","n_code_links":0,"syntology":null},{"paper":null,"slug":"near-optimal-stochastic-approximation-for","title":"Near-Optimal Stochastic Approximation for Online Principal Component Estimation","date":"2016-03-16","arxiv_id":"1603.05305","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-efficient-exact-pga-algorithm-for-constant","title":"An efficient Exact-PGA algorithm for constant curvature manifolds","date":"2016-03-13","arxiv_id":"1603.03984","n_code_links":0,"syntology":null},{"paper":"/paper/elastic-functional-coding-of-riemannian","slug":"elastic-functional-coding-of-riemannian","title":"Elastic Functional Coding of Riemannian Trajectories","date":"2016-03-07","arxiv_id":"1603.02200","n_code_links":1,"syntology":null},{"paper":null,"slug":"pcalda-approach-for-text-independent-speaker","title":"PCA/LDA Approach for Text-Independent Speaker Recognition","date":"2016-02-25","arxiv_id":"1602.08045","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-improved-gap-dependency-analysis-of-the","title":"An Improved Gap-Dependency Analysis of the Noisy Power Method","date":"2016-02-23","arxiv_id":"1602.07046","n_code_links":0,"syntology":null},{"paper":null,"slug":"principal-component-projection-without","title":"Principal Component Projection Without Principal Component Analysis","date":"2016-02-22","arxiv_id":"1602.06872","n_code_links":0,"syntology":null},{"paper":null,"slug":"streaming-pca-matching-matrix-bernstein-and","title":"Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithm","date":"2016-02-22","arxiv_id":"1602.06929","n_code_links":0,"syntology":null},{"paper":null,"slug":"compressive-pca-for-low-rank-matrices-on","title":"Compressive PCA for Low-Rank Matrices on Graphs","date":"2016-02-05","arxiv_id":"1602.02070","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-nystrom-and-column-sampling-methods","title":"On the Nyström and Column-Sampling Methods for the Approximate Principal Components Analysis of Large Data Sets","date":"2016-02-02","arxiv_id":"1602.01120","n_code_links":0,"syntology":null},{"paper":null,"slug":"dimensionality-reduction-via-regression-in","title":"Dimensionality Reduction via Regression in Hyperspectral Imagery","date":"2016-01-31","arxiv_id":"1602.00214","n_code_links":0,"syntology":null},{"paper":null,"slug":"principal-polynomial-analysis","title":"Principal Polynomial Analysis","date":"2016-01-31","arxiv_id":"1602.00221","n_code_links":0,"syntology":null},{"paper":null,"slug":"universal-collaboration-strategies-for-signal","title":"Universal Collaboration Strategies for Signal Detection: A Sparse Learning Approach","date":"2016-01-22","arxiv_id":"1601.06201","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-centrality-graph-spectral","title":"Multi-centrality Graph Spectral Decompositions and their Application to Cyber Intrusion Detection","date":"2015-12-23","arxiv_id":"1512.07372","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-generalized-principal-component","title":"Sparse Generalized Principal Component Analysis for Large-scale Applications beyond Gaussianity","date":"2015-12-12","arxiv_id":"1512.03883","n_code_links":0,"syntology":null},{"paper":null,"slug":"pseudo-bayesian-robust-pca-algorithms-and","title":"Pseudo-Bayesian Robust PCA: Algorithms and Analyses","date":"2015-12-07","arxiv_id":"1512.02188","n_code_links":0,"syntology":null},{"paper":null,"slug":"analysis-of-robust-pca-via-local-incoherence","title":"Analysis of Robust PCA via Local Incoherence","date":"2015-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"informative-data-projections-a-framework-and","title":"Informative Data Projections: A Framework and Two Examples","date":"2015-11-27","arxiv_id":"1511.08762","n_code_links":0,"syntology":null},{"paper":null,"slug":"wishart-mechanism-for-differentially-private","title":"Wishart Mechanism for Differentially Private Principal Components Analysis","date":"2015-11-18","arxiv_id":"1511.05680","n_code_links":0,"syntology":null},{"paper":null,"slug":"online-principal-component-analysis-in-high","title":"Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?","date":"2015-11-11","arxiv_id":"1511.03688","n_code_links":0,"syntology":null},{"paper":"/paper/preconditioned-data-sparsification-for-big","slug":"preconditioned-data-sparsification-for-big","title":"Preconditioned Data Sparsification for Big Data with Applications to PCA and K-means","date":"2015-10-31","arxiv_id":"1511.00152","n_code_links":2,"syntology":null},{"paper":null,"slug":"linear-time-detection-of-non-linear-changes","title":"Linear-time Detection of Non-linear Changes in Massively High Dimensional Time Series","date":"2015-10-28","arxiv_id":"1510.08385","n_code_links":0,"syntology":null},{"paper":"/paper/aggregating-deep-convolutional-features-for","slug":"aggregating-deep-convolutional-features-for","title":"Aggregating Deep Convolutional Features for Image Retrieval","date":"2015-10-26","arxiv_id":"1510.07493","n_code_links":2,"syntology":null},{"paper":"/paper/dimensionality-reduction-for-binary-data","slug":"dimensionality-reduction-for-binary-data","title":"Dimensionality Reduction for Binary Data through the Projection of Natural Parameters","date":"2015-10-21","arxiv_id":"1510.06112","n_code_links":1,"syntology":null},{"paper":null,"slug":"tensor-vs-matrix-methods-robust-tensor","title":"Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations","date":"2015-10-15","arxiv_id":"1510.04747","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-meaningful-maps-of-polish-case-law","title":"Towards Meaningful Maps of Polish Case Law","date":"2015-10-12","arxiv_id":"1510.03421","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-of-stochastic-gradient-descent","title":"Convergence of Stochastic Gradient Descent for PCA","date":"2015-09-30","arxiv_id":"1509.09002","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-complexity-of-robust-pca-and-ell_1","title":"On the Complexity of Robust PCA and $\\ell_1$-norm Low-Rank Matrix Approximation","date":"2015-09-30","arxiv_id":"1509.09236","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-trans-layer-unsupervised-networks-for","title":"Deep Trans-layer Unsupervised Networks for Representation Learning","date":"2015-09-27","arxiv_id":"1509.08038","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-and-simple-pca-via-convex-optimization","title":"Fast and Simple PCA via Convex Optimization","date":"2015-09-18","arxiv_id":"1509.05647","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-low-rank-estimation-by-projected","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","date":"2015-09-10","arxiv_id":"1509.03025","n_code_links":0,"syntology":null},{"paper":"/paper/value-function-approximation-via-low-rank","slug":"value-function-approximation-via-low-rank","title":"Value function approximation via low-rank models","date":"2015-08-31","arxiv_id":"1509.00061","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-randomized-rounding-algorithm-for-sparse","title":"A Randomized Rounding Algorithm for Sparse PCA","date":"2015-08-13","arxiv_id":"1508.03337","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-pca-via-bipartite-matchings","title":"Sparse PCA via Bipartite Matchings","date":"2015-08-04","arxiv_id":"1508.00625","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-worst-case-approximability-of-sparse","title":"On the Worst-Case Approximability of Sparse PCA","date":"2015-07-21","arxiv_id":"1507.05950","n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-smoothing-via-random-matrix","title":"Spectral Smoothing via Random Matrix Perturbations","date":"2015-07-10","arxiv_id":"1507.03032","n_code_links":0,"syntology":null},{"paper":null,"slug":"dctnet-a-simple-learning-free-approach-for","title":"DCTNet : A Simple Learning-free Approach for Face Recognition","date":"2015-07-08","arxiv_id":"1507.02049","n_code_links":0,"syntology":null},{"paper":null,"slug":"iris-recognition-using-scattering-transform","title":"Iris Recognition Using Scattering Transform and Textural Features","date":"2015-07-08","arxiv_id":"1507.02177","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-note-on-patch-based-low-rank-minimization","title":"A note on patch-based low-rank minimization for fast image denoising","date":"2015-06-28","arxiv_id":"1506.08353","n_code_links":0,"syntology":null},{"paper":null,"slug":"principal-geodesic-analysis-for-probability","title":"Principal Geodesic Analysis for Probability Measures under the Optimal Transport Metric","date":"2015-06-26","arxiv_id":"1506.07944","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-structured-low-rank-approximation-on","title":"Robust Structured Low-Rank Approximation on the Grassmannian","date":"2015-06-12","arxiv_id":"1506.03958","n_code_links":0,"syntology":null},{"paper":null,"slug":"stay-on-path-pca-along-graph-paths","title":"Stay on path: PCA along graph paths","date":"2015-06-08","arxiv_id":"1506.02344","n_code_links":0,"syntology":null},{"paper":"/paper/improved-svrg-for-non-strongly-convex-or-sum","slug":"improved-svrg-for-non-strongly-convex-or-sum","title":"Improved SVRG for Non-Strongly-Convex or Sum-of-Non-Convex Objectives","date":"2015-06-05","arxiv_id":"1506.01972","n_code_links":3,"syntology":null},{"paper":"/paper/unsupervised-learning-on-neural-network","slug":"unsupervised-learning-on-neural-network","title":"Unsupervised Learning on Neural Network Outputs: with Application in Zero-shot Learning","date":"2015-06-02","arxiv_id":"1506.00990","n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-pca-optimization-of-the-robust","title":"Robust PCA: Optimization of the Robust Reconstruction Error over the Stiefel Manifold","date":"2015-06-01","arxiv_id":"1506.00323","n_code_links":0,"syntology":null},{"paper":null,"slug":"using-dimension-reduction-to-improve-the","title":"Using Dimension Reduction to Improve the Classification of High-dimensional Data","date":"2015-05-26","arxiv_id":"1505.06907","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-pca-based-convolutional-network","title":"A PCA-Based Convolutional Network","date":"2015-05-14","arxiv_id":"1505.03703","n_code_links":0,"syntology":null},{"paper":null,"slug":"self-expressive-decompositions-for-matrix","title":"Self-Expressive Decompositions for Matrix Approximation and Clustering","date":"2015-05-04","arxiv_id":"1505.00824","n_code_links":0,"syntology":null},{"paper":null,"slug":"deconstructing-principal-component-analysis","title":"Deconstructing Principal Component Analysis Using a Data Reconciliation Perspective","date":"2015-05-02","arxiv_id":"1505.00314","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-orthogonal-multilinear-pca-with-relaxed","title":"Semi-Orthogonal Multilinear PCA with Relaxed Start","date":"2015-04-30","arxiv_id":"1504.08142","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-principal-component-analysis-on-graphs","title":"Robust Principal Component Analysis on Graphs","date":"2015-04-23","arxiv_id":"1504.06151","n_code_links":0,"syntology":null},{"paper":null,"slug":"randomized-block-krylov-methods-for-stronger","title":"Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition","date":"2015-04-21","arxiv_id":"1504.05477","n_code_links":0,"syntology":null},{"paper":null,"slug":"scale-up-nonlinear-component-analysis-with","title":"Scale Up Nonlinear Component Analysis with Doubly Stochastic Gradients","date":"2015-04-14","arxiv_id":"1504.03655","n_code_links":0,"syntology":null},{"paper":null,"slug":"maximum-entropy-linear-manifold-for-learning","title":"Maximum Entropy Linear Manifold for Learning Discriminative Low-dimensional Representation","date":"2015-04-10","arxiv_id":"1504.02622","n_code_links":0,"syntology":null},{"paper":null,"slug":"communication-efficient-distributed-kernel","title":"Communication Efficient Distributed Kernel Principal Component Analysis","date":"2015-03-23","arxiv_id":"1503.06858","n_code_links":0,"syntology":null},{"paper":null,"slug":"analysis-of-pca-algorithms-in-distributed","title":"Analysis of PCA Algorithms in Distributed Environments","date":"2015-03-17","arxiv_id":"1503.05214","n_code_links":0,"syntology":null},{"paper":null,"slug":"online-matrix-completion-and-online-robust","title":"Online Matrix Completion and Online Robust PCA","date":"2015-03-11","arxiv_id":"1503.03525","n_code_links":0,"syntology":null},{"paper":null,"slug":"total-variation-regularized-tensor-rpca-for","title":"Total Variation Regularized Tensor RPCA for Background Subtraction from Compressive Measurements","date":"2015-03-06","arxiv_id":"1503.01868","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-iterative-algorithm-for-robust","title":"Scalable Iterative Algorithm for Robust Subspace Clustering","date":"2015-03-05","arxiv_id":"1503.01578","n_code_links":0,"syntology":null},{"paper":null,"slug":"phase-transitions-for-high-dimensional","title":"Phase Transitions for High Dimensional Clustering and Related Problems","date":"2015-02-24","arxiv_id":"1502.06952","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-sparse-linear-auto-encoders-and","title":"Optimal Sparse Linear Auto-Encoders and Sparse PCA","date":"2015-02-23","arxiv_id":"1502.06626","n_code_links":0,"syntology":null},{"paper":null,"slug":"rectified-factor-networks","title":"Rectified Factor Networks","date":"2015-02-23","arxiv_id":"1502.06464","n_code_links":0,"syntology":null},{"paper":null,"slug":"np-hardness-and-inapproximability-of-sparse","title":"NP-Hardness and Inapproximability of Sparse PCA","date":"2015-02-19","arxiv_id":"1502.05675","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-hmax-with-llc-for-visual-recognition","title":"A HMAX with LLC for visual recognition","date":"2015-02-10","arxiv_id":"1502.02772","n_code_links":0,"syntology":null}],"record_sha256":"83542c7240aa01ffa4d13a2411ee6168e1d399efe858b2a39e288ac91a68d2ca","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}