Skip to content
conftrace_

greedy algorithm

267 papers

Papers

Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization CVPR 2014 Parallel Double Greedy Submodular Maximization NeurIPS 2014 Submodular Attribute Selection for Action Recognition in Video NeurIPS 2014 Submodular meets Structured: Finding Diverse Subsets in Exponentially-Large Structured Item Sets NeurIPS 2014 Transformation Pursuit for Image Classification CVPR 2014 Zeta Hull Pursuits: Learning Nonconvex Data Hulls NeurIPS 2014 Greedy Bilateral Sketch, Completion & Smoothing AISTATS 2013 Greedy Sparsity-Constrained Optimization JMLR 2013 Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization ICML 2013 Scalable Influence Estimation in Continuous-Time Diffusion Networks NeurIPS 2013 Sensor Selection in High-Dimensional Gaussian Trees with Nuisances NeurIPS 2013 Submodular Salient Region Detection CVPR 2013 When in Doubt, SWAP: High-Dimensional Sparse Recovery from Correlated Measurements NeurIPS 2013 GenDeR: A Generic Diversified Ranking Algorithm NeurIPS 2012 Mandatory Leaf Node Prediction in Hierarchical Multilabel Classification NeurIPS 2012 Selecting Diverse Features via Spectral Regularization NeurIPS 2012 A novel greedy algorithm for Nyström approximation AISTATS 2011 Bandits, Query Learning, and the Haystack Dimension COLT 2011 Greedy Algorithms for Structurally Constrained High Dimensional Problems NeurIPS 2011 Greedy Model Averaging NeurIPS 2011 Learning with Structured Sparsity JMLR 2011 Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels NeurIPS 2011 On fast approximate submodular minimization NeurIPS 2011 On Learning Discrete Graphical Models using Greedy Methods NeurIPS 2011 Orthogonal Matching Pursuit with Replacement NeurIPS 2011