Skip to content
conftrace_

Papers (including subtopics)

Maximum Volume Clustering AISTATS 2011 Message-Passing for Approximate MAP Inference with Latent Variables NeurIPS 2011 Metric Learning with Multiple Kernels NeurIPS 2011 Minimax Algorithm for Learning Rotations COLT 2011 Minimax Localization of Structural Information in Large Noisy Matrices NeurIPS 2011 Minimax Policies for Combinatorial Prediction Games COLT 2011 Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011 Minimum Description Length Penalization for Group and Multi-Task Sparse Learning JMLR 2011 Missing Information Impediments to Learnability COLT 2011 Mixability is Bayes Risk Curvature Relative to Log Loss COLT 2011 Model-Based Proprioceptive State Estimation for Spring-Mass Running RSS 2011 Modelling Genetic Variations using Fragmentation-Coagulation Processes NeurIPS 2011 Models of Cooperative Teaching and Learning JMLR 2011 Monte Carlo Value Iteration with Macro-Actions NeurIPS 2011 Multi-armed bandits on implicit metric spaces NeurIPS 2011 Multi-Bandit Best Arm Identification NeurIPS 2011 Multiclass Boosting: Theory and Algorithms NeurIPS 2011 Multiclass Learnability and the ERM principle COLT 2011 Multicore Gibbs Sampling in Dense, Unstructured Graphs AISTATS 2011 Multi-Level Partitioning and Distribution of the Assignment Problem for Large-Scale Multi-Robot Task Allocation RSS 2011 Multiple Instance Learning on Structured Data NeurIPS 2011 Nearest Neighbor based Greedy Coordinate Descent NeurIPS 2011 Neural Reconstruction with Approximate Message Passing (NeuRAMP) NeurIPS 2011 Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NeurIPS 2011 Neyman-Pearson Classification, Convexity and Stochastic Constraints JMLR 2011