Mathematics & Optimization

Prediction strategies without loss NeurIPS 2011 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Probabilistic amplitude and frequency demodulation NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 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 Query-Aware MCMC NeurIPS 2011 Randomized Algorithms for Comparison-based Search NeurIPS 2011 Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound 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 Regression on Fixed-Rank Positive Semidefinite Matrices: A Riemannian Approach JMLR 2011 Regularized Laplacian Estimation and Fast Eigenvector Approximation NeurIPS 2011 Reinforcement Learning using Kernel-Based Stochastic Factorization NeurIPS 2011 Revisiting MAP Estimation, Message Passing and Perfect Graphs AISTATS 2011 Robust approachability and regret minimization in games with partial monitoring COLT 2011 Robust Approximate Bilinear Programming for Value Function Approximation JMLR 2011 Robust Lasso with missing and grossly corrupted observations NeurIPS 2011 RTRMC: A Riemannian trust-region method for low-rank matrix completion NeurIPS 2011 Safe Learning: bridging the gap between Bayes, MDL and statistical learning theory via empirical convexity COLT 2011 Scalable Training of Mixture Models via Coresets NeurIPS 2011 See the Tree Through the Lines: The Shazoo Algorithm NeurIPS 2011 Semi-supervised Learning by Higher Order Regularization AISTATS 2011 Shaping Level Sets with Submodular Functions NeurIPS 2011