Computer Science

Hogwild!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent NeurIPS 2011 ICA with Reconstruction Cost for Efficient Overcomplete Feature Learning NeurIPS 2011 Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D RSS 2011 Learning a Robust Relevance Model for Search Using Kernel Methods JMLR 2011 Learning to Search Efficiently in High Dimensions NeurIPS 2011 Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning NeurIPS 2011 Multiple Instance Learning on Structured Data NeurIPS 2011 Nearest Neighbor based Greedy Coordinate Descent NeurIPS 2011 Nonstandard Interpretations of Probabilistic Programs for Efficient Inference NeurIPS 2011 On NDCG Consistency of Listwise Ranking Methods AISTATS 2011 Orthogonal Matching Pursuit with Replacement NeurIPS 2011 Phase transition in the family of p-resistances NeurIPS 2011 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011 Randomized Algorithms for Comparison-based Search NeurIPS 2011 Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound NeurIPS 2011 Reconstructing Patterns of Information Diffusion from Incomplete Observations NeurIPS 2011 Recovering Intrinsic Images with a Global Sparsity Prior on Reflectance NeurIPS 2011 Regularized Laplacian Estimation and Fast Eigenvector Approximation NeurIPS 2011 Scikit-learn: Machine Learning in Python JMLR 2011 See the Tree Through the Lines: The Shazoo Algorithm NeurIPS 2011 SpaRCS: Recovering low-rank and sparse matrices from compressive measurements NeurIPS 2011 Sparse Features for PCA-Like Linear Regression NeurIPS 2011 Support Vector Machines Under Adversarial Label Noise ACML 2011 Uniqueness of Belief Propagation on Signed Graphs NeurIPS 2011