Mathematics & Optimization

Learning Scale Free Networks by Reweighted ℓ_1 regularization AISTATS 2011 Learning Sparse Representations of High Dimensional Data on Large Scale Dictionaries NeurIPS 2011 Learning with the weighted trace-norm under arbitrary sampling distributions NeurIPS 2011 Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation AISTATS 2011 Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation NeurIPS 2011 Linear Submodular Bandits and their Application to Diversified Retrieval NeurIPS 2011 Load Balancing for Mobility-on-Demand Systems RSS 2011 Lower Bounds for Passive and Active Learning NeurIPS 2011 Mapping Kernels Defined Over Countably Infinite Mapping Systems and their Application ACML 2011 Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning NeurIPS 2011 Maximum Likelihood vs. Sequential Normalized Maximum Likelihood in On-line Density Estimation 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 Mixed Cumulative Distribution Networks AISTATS 2011 Models of Cooperative Teaching and Learning JMLR 2011 Monotone multi-armed bandit allocations COLT 2011 Motion Planning Under Uncertainty In Highly Deformable Environments RSS 2011 Multi-armed bandits on implicit metric spaces NeurIPS 2011 Multi-Bandit Best Arm Identification NeurIPS 2011 Multi-Label Output Codes using Canonical Correlation Analysis AISTATS 2011 Multilinear Subspace Regression: An Orthogonal Tensor Decomposition Approach 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