conftrace_

low-rank approximation

323 papers

Explore in graph

Also known as

LORA

Co-occurring keywords

model compression (3302) matrix factorization (529) matrix completion (356) tensor decomposition (375) singular value decomposition (222) matrix approximation (89) dimensionality reduction (720) tensor completion (64) kernel methods (1097) convex optimization (1321)

Papers

Fast Approximation of Matrix Coherence and Statistical Leverage JMLR 2012
Scaling up Kernel SVM on Limited Resources: A Low-rank Linearization Approach AISTATS 2012
Probabilistic Low-Rank Subspace Clustering NIPS 2012
Near-optimal Differentially Private Principal Components NIPS 2012
Sampling Methods for the Nyström Method JMLR 2012
A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound NIPS 2012
Penalty Decomposition Methods for Rank Minimization NIPS 2011
A novel greedy algorithm for Nyström approximation AISTATS 2011
Can matrix coherence be efficiently and accurately estimated? AISTATS 2011
Information Theoretical Clustering via Semidefinite Programming AISTATS 2011
Theoretical Analysis of Bayesian Matrix Factorization JMLR 2011
Transduction with Matrix Completion: Three Birds with One Stone NIPS 2010
Fluid Dynamics Models for Low Rank Discriminant Analysis AISTATS 2010
Exploiting Feature Covariance in High-Dimensional Online Learning AISTATS 2010
Spectral Regularization Algorithms for Learning Large Incomplete Matrices JMLR 2010
Robust PCA via Outlier Pursuit NIPS 2010
CUR from a Sparse Optimization Viewpoint NIPS 2010
Large-Scale Matrix Factorization with Missing Data under Additional Constraints NIPS 2010
Ensemble Nystrom Method NIPS 2009
Polynomial Semantic Indexing NIPS 2009
Graph Laplacian Regularization for Large-Scale Semidefinite Programming NIPS 2006
On the Nystrom Method for Approximating a Gram Matrix for Improved Kernel-Based Learning JMLR 2005
Efficient SVM Training Using Low-Rank Kernel Representations JMLR 2001