Skip to content
conftrace_

Papers (including subtopics)

Learning to Search Efficiently in High Dimensions NeurIPS 2011 Learning Transformation Models for Ranking and Survival Analysis JMLR 2011 Learning unbelievable probabilities NeurIPS 2011 Learning with Structured Sparsity JMLR 2011 Learning with the weighted trace-norm under arbitrary sampling distributions NeurIPS 2011 Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation NeurIPS 2011 Linear-Time Estimators for Propensity Scores AISTATS 2011 Locally Defined Principal Curves and Surfaces JMLR 2011 Logistic Stick-Breaking Process JMLR 2011 LPmade: Link Prediction Made Easy JMLR 2011 Machine Learning Markets AISTATS 2011 Manifold Precis: An Annealing Technique for Diverse Sampling of Manifolds NeurIPS 2011 Mapping Kernels Defined Over Countably Infinite Mapping Systems and their Application ACML 2011 Matrix Completion for Multi-label Image Classification NeurIPS 2011 Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning NeurIPS 2011 Maximum Covariance Unfolding : Manifold Learning for Bimodal Data NeurIPS 2011 Maximum Margin Multi-Instance Learning NeurIPS 2011 Maximum Margin Multi-Label Structured Prediction NeurIPS 2011 Maximum Volume Clustering AISTATS 2011 Message-Passing for Approximate MAP Inference with Latent Variables NeurIPS 2011 Metric Learning with Multiple Kernels NeurIPS 2011 Microbagging Estimators: An Ensemble Approach to Distance-weighted Classifiers ACML 2011 Minimax Algorithm for Learning Rotations COLT 2011 Minimax Localization of Structural Information in Large Noisy Matrices NeurIPS 2011 Minimum Description Length Penalization for Group and Multi-Task Sparse Learning JMLR 2011