Linear Algebra

Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model COLT 2012 Spectral Learning of General Weighted Automata via Constrained Matrix Completion NeurIPS 2012 Tensor Decomposition for Fast Parsing with Latent-Variable PCFGs NeurIPS 2012 Toward a Noncommutative Arithmetic-geometric Mean Inequality: Conjectures, Case-studies, and Consequences COLT 2012 A Linear Approximation for Graph-based Simultaneous Localization and Mapping RSS 2011 Anechoic Blind Source Separation Using Wigner Marginals JMLR 2011 Can matrix coherence be efficiently and accurately estimated? AISTATS 2011 Learning Anchor Planes for Classification NeurIPS 2011 Learning a Robust Relevance Model for Search Using Kernel Methods JMLR 2011 Learning Eigenvectors for Free NeurIPS 2011 Learning low-rank output kernels ACML 2011 Learning with the weighted trace-norm under arbitrary sampling distributions NeurIPS 2011 Multilinear Subspace Regression: An Orthogonal Tensor Decomposition Approach NeurIPS 2011 Regularized Laplacian Estimation and Fast Eigenvector Approximation NeurIPS 2011 Sparse Features for PCA-Like Linear Regression NeurIPS 2011 Guaranteed Rank Minimization via Singular Value Projection NeurIPS 2010 Random Projections for k-means Clustering NeurIPS 2010 Subgraph Detection Using Eigenvector L1 Norms NeurIPS 2010 The Group Dantzig Selector AISTATS 2010 Matrix Completion from Noisy Entries NeurIPS 2009 On Learning Rotations NeurIPS 2009 Refinement of Reproducing Kernels JMLR 2009 On the Equivalence of Linear Dimensionality-Reducing Transformations JMLR 2008 PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning NeurIPS 2008 QUIC-SVD: Fast SVD Using Cosine Trees NeurIPS 2008