← Core Methods
Machine Learning › Core Methods ›

Representation Learning

18863 directly classified papers

Papers per year

Papers

Multi-View Learning of Word Embeddings via CCA NIPS 2011
Similarity-based Learning via Data Driven Embeddings NIPS 2011
Bayesian Spike-Triggered Covariance Analysis NIPS 2011
Divide-and-Conquer Matrix Factorization NIPS 2011
A Non-Parametric Approach to Dynamic Programming NIPS 2011
Learning Sparse Representations of High Dimensional Data on Large Scale Dictionaries NIPS 2011
Data Skeletonization via Reeb Graphs NIPS 2011
Dimensionality Reduction Using the Sparse Linear Model NIPS 2011
Testing a Bayesian Measure of Representativeness Using a Large Image Database NIPS 2011
Structure Learning for Optimization NIPS 2011
Computationally Efficient Sufficient Dimension Reduction via Squared-Loss Mutual Information ACML 2011
The Sample Complexity of Dictionary Learning JMLR 2011
Universality, Characteristic Kernels and RKHS Embedding of Measures JMLR 2011
Learning Latent Tree Graphical Models JMLR 2011
Locally Defined Principal Curves and Surfaces JMLR 2011
Posterior Sparsity in Unsupervised Dependency Parsing JMLR 2011
The Indian Buffet Process: An Introduction and Review JMLR 2011
-Norm Multiple Kernel Learning JMLR 2011
A novel greedy algorithm for Nyström approximation AISTATS 2011
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning JMLR 2011
A Serial Approach to Handling High-Dimensional Measurements in the Sigma-Point Kalman Filter RSS 2011
Probabilistic Modeling of Dependencies Among Visual Short-Term Memory Representations NIPS 2011
Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Functions on Graphs JMLR 2011
Learning with Structured Sparsity JMLR 2011
Convex and Network Flow Optimization for Structured Sparsity JMLR 2011