Optimization

Penalty Decomposition Methods for Rank Minimization NeurIPS 2011 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011 Proximal Methods for Hierarchical Sparse Coding JMLR 2011 Pylon Model for Semantic Segmentation NeurIPS 2011 Quadratic Weighted Automata:Spectral Algorithm and Likelihood Maximization ACML 2011 Quasi-Newton Methods for Markov Chain Monte Carlo NeurIPS 2011 Real-time prioritized kinematic control under inequality constraints for redundant manipulators RSS 2011 Reconstructing Patterns of Information Diffusion from Incomplete Observations NeurIPS 2011 Regret Bounds for the Adaptive Control of Linear Quadratic Systems COLT 2011 Robust approachability and regret minimization in games with partial monitoring COLT 2011 Robust Lasso with missing and grossly corrupted observations NeurIPS 2011 RTRMC: A Riemannian trust-region method for low-rank matrix completion NeurIPS 2011 Scalable Training of Mixture Models via Coresets NeurIPS 2011 Semi-supervised Learning by Higher Order Regularization AISTATS 2011 Semi-Supervised Learning with Measure Propagation JMLR 2011 Semi-supervised Regression via Parallel Field Regularization NeurIPS 2011 Shaping Level Sets with Submodular Functions NeurIPS 2011 SpaRCS: Recovering low-rank and sparse matrices from compressive measurements NeurIPS 2011 Sparse Estimation with Structured Dictionaries NeurIPS 2011 Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation NeurIPS 2011 Sparse recovery by thresholded non-negative least squares NeurIPS 2011 Sparse Recovery with Brownian Sensing NeurIPS 2011 Statistical Optimization of Non-Negative Matrix Factorization AISTATS 2011 Statistical Tests for Optimization Efficiency NeurIPS 2011